Shared-memory Mutual Exclusion: Major Research Trends Since 1986 - Anderson, Kim (ResearchIndex)

The Wayback Machine - https://web.archive.org/web/20060525013335/http://citeseer.ist.psu.edu:80/anderson01sharedmemory.html

Shared-memory Mutual Exclusion: Major Research Trends Since 1986 - Anderson, Kim (ResearchIndex)

The recent database difficulties have been resolved. Please let us know if you encounter any data corruptions.

Shared-memory Mutual Exclusion: Major Research Trends Since 1986 (2001) (Make Corrections) (4 citations)
James H. Anderson, Yong-Jik Kim

Home/Search Context Related

View or download:
unc.edu/~anderson/papers/survey.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  unc.edu/~anderson/papers (more)
Homepages:  J.Anderson  Y.Kim
  HPSearch  (Update Links)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [54]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion. (Update)

Context of citations to this paper: More

...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...

Cited by: More
Efficient Adaptive Collect using Randomization - Hagit Attiya Fabian (Correct)
ACM SIGACT News Distributed Computing Column 13 - Sergio Rajsba Um (Correct)
Appendix D - Detailed Proof Of (Correct)

Similar documents (at the sentence level):
22.5%: Time Complexity Bounds for Shared-memory Mutual Exclusion - Kim (2001) (Correct)
9.2%: Lamport on Mutual Exclusion: 27 Years of Planting Seeds - Anderson (2001) (Correct)

Active bibliography (related documents): More All
1.0: Nonatomic Mutual Exclusion with Local Spinning (Extended.. - Anderson, Kim (2002) (Correct)
0.6: An Improved Lower Bound for the Time Complexity of Mutual.. - Anderson, Kim (2002) (Correct)
0.6: Adaptive Mutual Exclusion with Local Spinning - Anderson, Kim (2001) (Correct)

Similar documents based on text: More All
0.6: Using k-Exclusion to Implement Resilient, Scalable Shared.. - Anderson, Moir (1994) (Correct)
0.6: The Mutual Exclusion Problem - Part II: Statement and Solutions - Lamport (2000) (Correct)
0.6: A Family of 2-process Mutual Exclusion Algorithms - Notes on.. - Misra (1994) (Correct)

Related documents from co-citation: More All
3: Adaptive mutual exclusion with local spinning - Anderson, Kim
2: Information and Computation - Anderson, Yang et al. - 1996
2: A space- and time-ecient local-spin spin lock - Kim, Anderson - 2001

BibTeX entry: (Update)

J. Anderson and Y.-J. Kim. Shared-memory mutual exclusion: Major research trends since http://citeseer.ist.psu.edu/anderson01sharedmemory.html More

@misc{ anderson-sharedmemory,
  author = "J. Anderson and Y.-J. Kim",
  title = "Shared-memory mutual exclusion: Major research trends since 1986",
  url = "citeseer.ist.psu.edu/anderson01sharedmemory.html" }

Citations (may not include all citations):
597 How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979  DBLP
336 Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1982  ACM   DBLP
196 The performance of spin lock alternatives for shared-memory .. (context) - Anderson - 1990
147 A fast mutual exclusion algorithm - Lamport - 1987  ACM   DBLP
141 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965  ACM
107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974  ACM   DBLP
80 Synchronization algorithms for shared-memory multiprocessors (context) - Graunke, Thakkar - 1990  ACM   DBLP
76 Myths about the mutual exclusion problem (context) - Peterson - 1981  DBLP
72 Algorithms for Mutual Exclusion (context) - Raynal - 1986  ACM
55 Contention in shared memory algorithms - Dwork, Herlihy et al. - 1997  ACM   DBLP
45 Concurrent control with readers and writers (context) - Courtois, Heymans et al. - 1971
44 The mutual exclusion problem: Part I - A theory of interproc.. - Lamport - 1986
43 The mutual exclusion problem: Part II - Statement and soluti.. - Lamport - 1986
40 Adaptive solutions to the mutual exclusion problem (context) - Choy, Singh - 1994
28 Adaptive wait-free algorithms for lattice agreement and rena.. (context) - Attiya, Fouren - 1998
26 Scheduler-conscious synchronization - Kontothanassis, Wisniewski et al. - 1997  ACM   DBLP
24 Results about fast mutual exclusion (context) - Alur, Taubenfeld - 1992  DBLP
24 Algorithms for scalable synchronization on shared-memory mul.. - Mellor-Crummey, Scott - 1991  ACM   DBLP
22 A new approach to proving the correctness of multiprocess pr.. (context) - Lamport - 1979  ACM   DBLP
22 Long-lived renaming made adaptive - Afek, Attiya et al. - 1999  ACM   DBLP
22 Science of Computer Programming (context) - Moir, Anderson et al. - 1995
22 Speeding Lamport's fast mutual exclusion algorithm (context) - Merritt, Taubenfeld - 1993  ACM   DBLP
21 Additional comments on a problem in concurrent programming c.. (context) - Knuth - 1966  ACM   DBLP
21 Improving fast mutual exclusion (context) - Styer - 1992  ACM   DBLP
20 Asynchronous group mutual exclusion - Joung - 2000
20 Bounds on shared memory for mutual exclusion - Burns, Lynch - 1993
18 Mutual exclusion using indivisible reads and writes - Burns, Lynch - 1980
17 wait-free (context) - Afek, Merritt - 1999
17 Long-lived renaming made fast - Buhrman, Garay et al. - 1995  ACM   DBLP
16 Scalable spin locks for multiprogrammed systems - Wisniewski, Kontothanassis et al. - 1994  ACM   DBLP
15 Scalable reader-writer synchronization for shared-memory mul.. (context) - Mellor-Crummey, Scott - 1991
15 High performance synchronization algorithms for multiprogram.. - Wisniewski, Kontothanassis et al. - 1995  ACM   DBLP
14 Adaptive mutual exclusion with local spinning - Anderson, Kim - 2000  ACM   DBLP
14 The communication requirements of mutual exclusion - Cypher - 1995  ACM   DBLP
14 An improved lower bound for the time complexity of mutual ex.. - Anderson, Kim - 2001  ACM   DBLP
12 Multiprocessor synchronization primitives with priorities (context) - Markatos
12 scalable mutual exclusion algorithm (context) - Yang, Anderson et al. - 1995
12 Queuing spin lock algorithms to support timing predictabilit.. (context) - Craig - 1993
11 Information and Computation - Anderson, Yang et al. - 1996  DBLP
11 Adaptive long-lived renaming with read and write operations - Attiya, Fouren - 1999
10 Adaptive and ecient mutual exclusion (context) - Attiya, Bortnikov - 2000
9 Using local-spin k-exclusion algorithms to improve wait-free.. - Anderson, Moir - 1997  DBLP
8 long-lived renaming (context) - Moir, Anderson - 1994
8 Resource allocation with immunity to process failure (context) - Fischer, Lynch et al. - 1979
7 A circular list-based mutual exclusion scheme for large shar.. - Fu, Tzeng - 1997
6 A time complexity bound for adaptive mutual exclusion - Kim, Anderson - 2001  ACM   DBLP
6 Contention-free complexity of shared memory algorithms - Alur, Taubenfeld - 1996  ACM   DBLP
6 Ecient object sharing in quantum-based real-time systems (context) - Anderson, Jain et al. - 1998
5 A space- and time-ecient local-spin spin lock - Kim, Anderson - 2001
5 Fast and fair mutual exclusion for shared memory systems (context) - Huang - 1999  ACM   DBLP
4 local-spin group mutual exclusion algorithm (context) - Keane, Moir et al. - 1999
4 A new fast-path mechanism for mutual exclusion - Anderson, Kim - 2001  DBLP
4 Evaluating and designing software mutual exclusion algorithm.. (context) - Zhang, Yan et al. - 1996  ACM
3 Fast mutual exclusion - Michael, Scott - 1993
3 When does a correct mutual exclusion algorithm guarantee mut.. - Lamport, Perl et al. - 2000
3 A ne-grained solution to the mutual exclusion problem (context) - Anderson - 1993
3 Arbitration without common modiable variables (context) - Kessels - 1982
2 Deriving a scalable algorithm for mutual exclusion - Tsay - 1998  ACM   DBLP
2 An ecient recovery-based spin lock protocol for preemptive s.. (context) - Rhee, Lee - 1996
2 A comment on \A circular list-based mutual exclusion scheme .. (context) - Huang, Shann - 1998
2 IEEE Transactions on Parallel and Distributed Systems (context) - Johnson, Harathi et al. - 1997

Documents on the same site (http://www.cs.unc.edu/~anderson/papers.html): More
The Granularity of Waiting (Extended Abstract) - Anderson, Yang, Gouda (1992) (Correct)
The Elusive Atomic Register - Singh, Anderson, al. (1992) (Correct)
A New Explanation of the Glitch Phenomenon - Anderson, Gouda (1989) (Correct)

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