wait-free synchronizationA wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one ...
Wait-Free Synchronization 来自 Springer 喜欢 0 阅读量: 174 作者: M Herlihy 摘要: A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. ...
Synchronization among the processors is achieved with a variety of clock configurations. A new notion of fault-tolerance for clock synchronization algorithms is defined, tailored to the requirements and failure patterns of shared memory multiprocessors. Algorithms in this class can tolerate any number of...
Reliable Distributed Systems, Oct. 1990. [14] M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1), 1991. [15] M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Sys...
在本文中,我们将介绍zookeeper,它是一个用于协调分布式应用程序的服务。 因为zookeeper是关键基础结构的一部分,其目的在于提供一个简单和高性能的内核,以便客户端可以构建更复杂的协调原语。 它将组消息传递(group messageing)、共享寄存器和分布式锁服务纳入到一个重新分配的、集中化的服务中。 由ZooKeeper暴露出来的接口...
Wait-Free Synchronization A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, rega... M Herlihy - 《Acm Trans Programming Languages & Systems》 被引量: 2910发表: 1996年 Wait-free Programming for...
Wait-free synchronization. ACM TOPLAS, 13(1):124–149, 1991. Article Google Scholar M. P. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 111–120, 1993. Google Scholar M.P. ...
Our result demonstrates that it is possible to construct wait-free synchronization mechanisms for GPUs without strong synchronization primitives in hardware and that wait-free programming is possible for such GPUs. 展开 关键词: consensus graphics processors many-core architectures read-modify-write objects...
(including arbitrary delay) of other processes.Support for wait-free synchronization requires genuinely new language constructs, not just variations on ... M Yılsen,H Meral,T Aydemir,... - OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming 被...
In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Wait-free and lock-free ... G Hui,JF Groote,WH Hesselink - Technische Universiteit Eindhoven 被引量: 22发表: 2003年 Highly-Efficient Wait-Free Synchronization We stu...