메뉴 건너뛰기




Volumn 23, Issue , 2004, Pages 236-245

How fast can a distributed atomic read be?

Author keywords

Atomic registers; Shared memory emulation; Time complexity

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; DATA STRUCTURES; SERVERS;

EID: 10444268834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011802     Document Type: Conference Paper
Times cited : (44)

References (9)
  • 1
    • 0029215351 scopus 로고
    • Sharing memory robustly in message-passing systems
    • January
    • H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, January 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.1 , pp. 124-142
    • Attiya, H.1    Bar-Noy, A.2    Dolev, D.3
  • 5
  • 6
    • 0022873767 scopus 로고
    • On interprocess communication - Parts I-II
    • May
    • L. Lamport. On interprocess communication - parts I-II. Distributed Computing, 1(2):77-101, May 1986.
    • (1986) Distributed Computing , vol.1 , Issue.2 , pp. 77-101
    • Lamport, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.