Journal ArticleDOI
Adaptive solutions to the mutual exclusion problem
Manhoi Choy,Ambuj K. Singh +1 more
TLDR
Algorithms for mutual exclusion that adapt to the current degree of contention are developed and achieve system response times that are independent of the total number of processes and governed instead by the current level of contention.Abstract:
Algorithms for mutual exclusion that adapt to the current degree of contention are developed. A filter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.read more
Citations
More filters
Journal ArticleDOI
Shared-memory mutual exclusion: major research trends since 1986
TL;DR: This paper surveys major research trends since 1986 in work on shared-memory mutual exclusion with a focus on algorithms for mutual exclusion.
Journal ArticleDOI
Contention in shared memory algorithms
TL;DR: The first formal complexity model for contention in shared-memory multiprocessors is introduced and certain counting networks outperform conventional single-variable counters at high levels of contention, providing the first formal model explaining this phenomenon.
Proceedings ArticleDOI
Contention in shared memory algorithms
TL;DR: The first formal complexity model for contention in shared-memory multiprocessors is introduced and certain counting networks outperform conventional single-variable counters at high levels of contention, providing the first formal model explaining this phenomenon.
Proceedings ArticleDOI
Long-lived renaming made adaptive
TL;DR: Two implementations of an adaptive, wait-free, and long-lived renaming task in the read/write shared memory model are presented and they use completely different techniques to achieve their goals.
Journal ArticleDOI
A pleasant stroll through the land of infinitely many creatures
TL;DR: This paper considers such systems, and gives algorithms that are new and simple (but not necessarily efficient) for common problems, to better expose some of the algorithmic techniques for dealing with infinitely many processes.
References
More filters
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Book
Parallel Program Design: A Foundation
TL;DR: One that the authors will refer to break the boredom in reading is choosing parallel program design a foundation as the reading material.
Journal ArticleDOI
Solution of a problem in concurrent programming control
TL;DR: A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the “critical section” of its cycle.
Journal ArticleDOI
A new solution of Dijkstra's concurrent programming problem
TL;DR: A simple solution to the mutual exclusion problem is presented which allows the system to continue to operate despite the failure of any individual component.
Journal ArticleDOI
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
TL;DR: The design for the NYU Ultracomputer is presented, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements that uses an enhanced message switching network with the geometry of an Omega-network to approximate the ideal behavior of Schwartz's paracomputers model of computation.