A first-come-first-served mutual-exclusion algorithm with small communication variables

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Edward A. Lycklama Univ. of Toronto, Toronto, Ont., Canada
Vassos Hadzilacos Univ. of Toronto, Toronto, Ont., Canada
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive
Volume 13 Issue 4, Oct. 1991
Pages 558 - 576
ACM New York, NY, USA
table of contents doi>10.1145/115372.115370
A first-come-first-served mutual-exclusion algorithm with small communication variables Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 18
· Downloads (cumulative): 492
· Citation Count: 13


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder