An analysis of dag-consistent distributed shared-memory algorithms

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Robert D. Blumofe Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
Matteo Frigo MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Christopher F. Joerg MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Charles E. Leiserson MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
Keith H. Randall MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts
An analysis of dag-consistent distributed shared-memory algorithms Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 40
· Downloads (cumulative): 406
· Citation Count: 37

Published in:
Cover Image
 
· Proceeding
SPAA '96 Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Pages 297 - 308
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-809-6 doi>10.1145/237502.237574

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