SIGN IN
SIGN UP
How fast can a distributed atomic read be?
Full Text:
Pdf
Buy this Article
Authors:
Partha Dutta
EPFL, Lausanne, Switzerland
Rachid Guerraoui
EPFL, Lausanne, Switzerland
Ron R. Levy
EPFL, Lausanne, Switzerland
Arindam Chakraborty
EPFL, Lausanne, Switzerland
2004 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 354
· Citation Count: 12
Published in:
· Proceeding
PODC '04
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Pages 236 - 245
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-802-4
doi>
10.1145/1011767.1011802
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
atomic registers
concurrency
distributed networks
multiprocessing/multiprogramming/multitasking
relations between models
reliability
shared-memory emulation
synchronization
theory
time-complexity
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder