Improving fast mutual exclusion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Improving fast mutual exclusion

Full text

Pdf (935 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing table of contents

Vancouver, British Columbia, Canada

Pages: 159 - 168

Year of Publication: 1992

ISBN:0-89791-495-3

Author

Eugene Styer

Department of Math, Statistics and Computer Science, Eastern Kentucky University, Richmond, KY

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 14, Citation Count: 13

Additional Information:

references cited by index terms review collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/135419.135453 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	James E. Burns. Symmetry in systems of asynchronous processes. In 22nd FOCS, pages 169-174. IEEE, 1981.
	2	E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, v.8 n.9, p.569, Sept. 1965 [doi>10.1145/365559.365617]
	3	Leslie Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems (TOCS), v.5 n.1, p.1-11, Feb. 1987 [doi>10.1145/7351.7352]
	4	Gary L. Peterson, Jan 1988. Private Communication.
	5	Eugene Styer and Gary Peterson. Tight bounds for shared memory symmetric mutual exclusion problems. Technical Report GIT-ICS-89/09, Georgia Institute of Technology, February 1989.

CITED BY 13

	Jae-Heon Yang , James H. Anderson, Fast, scalable synchronization with minimal hardware support, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.171-182, August 15-18, 1993, Ithaca, New York, United States
	Manhoi Choy , Ambuj K. Singh, Adaptive solutions to the mutual exclusion problem, Distributed Computing, v.8 n.1, p.1-17, August 1994
	James H. Anderson, Lamport on mutual exclusion: 27 years of planting seeds, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.3-12, August 2001, Newport, Rhode Island, United States
	Hagit Attiya , Vita Bortnikov, Adaptive and efficient mutual exclusion (extended abstract), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.91-100, July 16-19, 2000, Portland, Oregon, United States
	Manhoi Choy , Ambuj K. Singh, Adaptive solutions to the mutual exclusion problem, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.183-194, August 15-18, 1993, Ithaca, New York, United States
	Yehuda Afek , Hagit Attiya , Arie Fouren , Gideon Stupp , Dan Touitou, Long-lived renaming made adaptive, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.91-103, May 04-06, 1999, Atlanta, Georgia, United States
	Hagit Attiya , Vita Bortnikov, Adaptive and efficient mutual exclusion, Distributed Computing, v.15 n.3, p.177-189, July 2002
	James H. Anderson , Yong-Jik Kim, Nonatomic mutual exclusion with local spinning, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	James H. Anderson , Yong-Jik Kim , Ted Herman, Shared-memory mutual exclusion: major research trends since 1986, Distributed Computing, v.16 n.2-3, p.75-110, September 2003
	James H. Anderson , Yong-Jik Kim, An improved lower bound for the time complexity of mutual exclusion, Distributed Computing, v.15 n.4, p.221-253, December 2002
	Yehuda Afek , Gideon Stupp , Dan Touitou, Long lived adaptive splitter and applications, Distributed Computing, v.15 n.2, p.67-86, April 2002
	Rajeev Alur , Gadi Taubenfeld, Fast timing-based algorithms, Distributed Computing, v.10 n.1, p.1-10, July 1996
	Yong-Jik Kim , James H. Anderson, Adaptive mutual exclusion with local spinning, Distributed Computing, v.19 n.3, p.197-236, January 2007

INDEX TERMS

Primary Classification:
D. Software
D.4 OPERATING SYSTEMS
D.4.1 Process Management
Subjects: Mutual exclusion

General Terms:
Algorithms, Theory

REVIEW

"Edward A. Feustel : Reviewer"

Styer presents an algorithm to improve the performance of mutual exclusion when there are many contenders for the resource. He proves that the algorithm takes Otkl more...

Collaborative Colleagues:

Eugene Styer: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player