Distributed Computing: Fundamentals, Simulations and Advanced Topics, Second Edition. Author(s). Hagit Attiya · Jennifer Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd Edition HAGIT ATTIYA received her PhD in Computer Science from Hebrew. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Front Cover · Hagit Attiya, Jennifer Welch. John Wiley & Sons, Mar.
|Published (Last):||18 November 2014|
|PDF File Size:||10.80 Mb|
|ePub File Size:||2.73 Mb|
|Price:||Free* [*Free Regsitration Required]|
RamalingamNoam Rinetzky: The book highlights techniques and results that are applicable in several places throughout the text. Concurrency and the Principle of Data Locality. You are currently using the site but have requested a page in the site. Distributed Computing 29 2: Separating Lock-Freedom from Wait-Freedom. This page was last edited on 26 Octoberat Efficient Adaptive Collect Using Randomization. She has also received several teaching awards. Structured Derivation of Semi-Synchronous Algorithms.
Popular passages Page 2 – each computing entity can only be aware of information that it acquires, it has only a local view of the global situation. Communication Systems 17 5: The relationships between the various models are demonstrated by simulations showing that algorithms designed for one model can be run in another model. Upper bound on the complexity of solving hard renaming.
Solving Consensus in Eventually Stable Systems. Other editions – View all Distributed Computing: The book presents up-to-date results in a precise, and detailed, yet accessible manner.
Read, highlight, and take notes, across web, tablet, and phone. Retrieved from ” https: Additional material exercise solutions and lecture notes for a sample course is available for instructors only ; send mail to Hagit Attiya.
She has also received several teaching awards. Hagit AttiyaKeren Censor-Hillel: This approach exposes the inherent similarities in solutions to seemingly diverse problems. Adaptive and efficient mutual exclusion extended abstract.
Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd Edition
Sharing Memory in a Self-stabilizing Manner. An O 1 -barriers optimal RMRs mutual exclusion algorithm: Attiya became a fellow of the Association for Computing Machinery in for “contributions to distributed and parallel computing”. Algorithms adapting to point contention. Quantifying Rollback Propagation in Distributed Checkpointing.
Hagit Attiya – Wikipedia
Wait-Free Simulations of Compuuting Objects. Living people Israeli computer scientists Israeli women computer scientists Researchers in distributed computing Hebrew University of Jerusalem alumni Technion — Israel Institute of Technology faculty Fellows of the Association for Computing Machinery.
Directory Protocols for Distributed Transactional Memory. She has been the editor-in-chief of the journal Distributed Computing since Specification and Complexity of Collaborative Text Editing.
Tight bounds for asynchronous randomized consensus. The major models of distributed computing are covered, varying by the mode of communication message passing and shared memoryby the synchrony assumptions synchronous, asynchronous and clockedand by the failure type crash and Byzantine.
Hagit AttiyaSergio Rajsbaum: Lower Bounds for Restricted-Use Objects. Selected pages Title Page.