| J. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986. |
....exclusion, algorithms for both shared memory and message passing systems have been considered. In this proposal, we consider only algorithms in which processes communicate through shared memory. A comprehensive survey of recent work on the shared memory mutual exclusion problem can be found in [8]. Recent work on shared memory mutual exclusion has shed some light on the following fundamental question: given a system model, what is the time complexity of an optimal mutual exclusion algorithm With fetch and primitives the answer is trivial, because constant time algorithms are already ....
....DSM systems. The three most well known such algorithms are due to T. Anderson [10] Graunke and Thakkar [17] and Mellor Crummey and Scott [25] T. Anderson s queue based algorithm [10] uses both fetch and increment and atomic add. This algorithm has O(1) time complexity under the CC model. In [8], I presented a simple transformation to make the algorithm run with O(1) time complexity under the DSM model. Graunke and Thakkar s algorithm [17] uses fetch and store. This algorithm has O(1) time complexity under the CC model. However, the algorithm does not spin locally under the DSM model, ....
[Article contains additional citation context not shown here]
J. Anderson and Y.-J. Kim. Shared-memory mutual exclusion: Major research trends since
No context found.
J. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986.
No context found.
James H. Anderson, Yong-Jik Kim, Ted Herman, \Shared-memory mutual exclusion: major research trends since
No context found.
J. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC