.png){kind=icon}
返回
Efficient self-tuning spin-locks using competitive analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2006.11.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reactive spin-lock algorithms that can automatically adapt to contention variation on the lock have received great attention in the field of multiprocessor synchronization since they can help applications achieve good performance in all possible contention conditions. However, in existing reactive spin-locks the reaction relies on (i) some fixed experimentally tuned thresholds, which may get frequently outdated in dynamic environments like multiprogramming/multiprocessor systems, or (ii) known probability distributions of inputs. This paper presents a new reactive spin-lock algorithm that is completely self-tuning, which means no experimentally tuned parameter nor probability distribution of inputs are needed. The new spin-lock is built on both synchronization structures of applications and online algorithmic techniques. Our experiments, which use the Spark98 kernels and the SPLASH-2 applications as application benchmarks, on a multiprocessor machine SGI Origin2000 and an Intel Xeon workstation have showed that the new self-tuned spin-lock performs as well as the best of hand-tuned spin-lock representatives in a wide range of contention levels. (C) 2006 Elsevier Inc. All rights reserved.
Keyword:
reactive synchronization
spin-locks
shared memory multiprocessors
concurrent
performance
online algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
Optimising cognitive load and usability to improve the impact of e-learning in medical education
OAAI
OAAI分享收藏
查看更多内容