Is distributed locking harder?

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Paris C. Kanellakis Brown University
Christos H. Papadimitriou Massachusetts Institute of Technology and National Technical University of Athens
Published in:
· Proceeding
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Pages 98-107
ACM New York, NY, USA ©1982
table of contents ISBN:0-89791-070-2 doi>10.1145/588111.588129
Is distributed locking harder? Published by ACM 1982 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 266
· Citation Count: 3


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