Browsing LCS Technical Memos (1974 - 2003) by Author "Attiya, Hagit"
Now showing items 1-7 of 7
-
Are Wait-free Algorithms Fast?
Attiya, Hagit; Lynch, Nancy A.; Shavit, Nir (1991-03)The time complexity of wait-free algorithms in "normal" executions, where no failures occure and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any wait-free ... -
Atomic Snapshots of Shared Memory
Afek, Yehuda; Attiya, Hagit; Dolev, Danny; Gafni, Eli; Merritt, Michael; e.a. (1990-05) -
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
Attiya, Hagit; Dwork, Cynthia; Lynch, Nancy A.; Stockmeyer, Larry (1990-11) -
Optimal Clock Synchronization Under Different Delay Assumptions
Attiya, Hagit; Herzberg, Amir; Rajsbaum, Sergio (1994-04)The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family ... -
Reliable Communication Over Unreliable Channels
Afek, Yehuda; Attiya, Hagit; Fekete, Alan; Fischer, Michael; Lynch, Nancy A.; e.a. (1992-10)Layered communication protocols frequently implement a FIFO message facility on top of an unreliable non-FIFO service such as that provided by a packet-switching network. This paper investigates the possibility of implementing ... -
Sharing Memory Robustly in Message-passing Systems
Attiya, Hagit; Bar-Noy, Amotz; Dolev, Danny (1990-02) -
Time Bounds for Real-time Process Control in the Presence of Time Uncertainty
Attiya, Hagit; Lynch, Nancy A. (1989-07)