SIGN IN
SIGN UP
Sharing memory robustly in message-passing systems
Full Text:
PDF
Buy this Article
Authors:
Hagit Attiya
The Technion, Haifa, Israel
Amotz Bar-Noy
IBM T.J. Watson Research Center, Yorktown Heights, NY
Danny Dolev
IBM Almaden Research Center, San Jose CA and Hebrew Univ., Jerusalem, Israel
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 42 Issue 1, Jan. 1995
Pages 124-142
ACM
New York, NY
, USA
table of contents
doi>
10.1145/200836.200869
1995 Article
Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 123
· Downloads (cumulative): 1,194
· Citation Count: 102
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
atomic registers
concurrency
distributed networks
emulation
fault-tolerance
message passing
message sending
multiprocessing/multiprogramming/multitasking
processor and link failures
relations between models
reliability
shared memory
synchronization
theory
wait-freedom
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