The weakest failure detector for wait-free dining under eventual weak exclusion

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Srikanth Sastry Texas A&M University, College Station, TX, USA
Scott M. Pike Texas A&M University, College Station, TX, USA
Jennifer L. Welch Texas A&M University, College Station, TX, USA
Published in:
Cover Image
 
· Proceeding
SPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Pages 111-120
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-606-9 doi>10.1145/1583991.1584021
The weakest failure detector for wait-free dining under eventual weak exclusion Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 18
· Downloads (cumulative): 130
· Citation Count: 2


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