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.

Author: Nataxe Kigor
Country: Cape Verde
Language: English (Spanish)
Genre: Life
Published (Last): 6 June 2010
Pages: 345
PDF File Size: 1.2 Mb
ePub File Size: 1.16 Mb
ISBN: 804-5-29082-133-8
Downloads: 43040
Price: Free* [*Free Regsitration Required]
Uploader: Voodooshicage

By using this site, you agree to the Terms of Use and Privacy Policy. Hagit AttiyaFaith Ellen: Structured Derivation of Semi-Synchronous Algorithms. Attiya was educated at the Hebrew University of Jerusalemearning a B.

RamalingamNoam Rinetzky: In other projects Wikimedia Commons.

Distributed Computing (book)

This approach exposes the inherent similarities in solutions to seemingly diverse problems. Remote Memory References at Block Granularity. From Wikipedia, the free encyclopedia. Modular Constructions for Non-Volatile Memory. She has also received several teaching awards. Quantifying Rollback Propagation in Distributed Checkpointing.

Distributed Computing (book) | Hagit Attiya

She has published widely in leading journals and has served on the program committees for many international conferences, including chairing the program committee for the ACM Symposium on Principles of Distributed Computing. Max registers, counters, and monotone circuits.


The inherent queuing delay of parallel packet switches. This book aims to provide a coherent view of the theory of distributed computing, highlighting common themes and basic techniques. Leader Election in Rings. Other editions – View all Distributed Computing: Permissions Request permission to reuse content from this site.

Hagit AttiyaEyal Dagan: 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. Sinceshe has taught in the Department of Computer Science at the Technion, Haifa—Israel’s leading technological university. Hagit AttiyaAmir Bar-Or: Upper bound on the complexity of solving hard renaming.

Packet-mode emulation of output-queued switches.

The complexity of updating snapshot objects. Directory Protocols for Distributed Transactional Memory.

Improving the Fault Tolerance of Algorithms. Concurrent updates with RCU: Welch No preview available – Additional material exercise solutions and lecture notes for a sample course distribute available for instructors only ; send mail to Hagit Attiya.

Hagit AttiyaJennifer L. It’s all about change. 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 Eistributed Machinery.

Lower bounds for randomized consensus under a weak adversary. The complexity of obstruction-free implementations.

  350 1AH03 0AE0 PDF

Hagit Attiya – Wikipedia

Hagit AttiyaCompuhing Hay: The power of DCAS: The authors present the fundamental issues underlying the design of distributed systems – communication, coordination, synchronization, and uncertainty – as well as fundamental algorithmic concepts and lower-bound techniques.

Each chapter ends with a set of exercises and notes that discuss practical applications in existing systems, as well as a bibliographic history of the ideas. MichaelMartin T. Distributrd impossibility proofs for set agreement and renaming.

Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd Edition

Synchronizing without locks is inherently expensive. This book covers the main elements of the theory of distributed computing, in a unifying approach which emphasizes the similarities between different models, when possible, or explains inherent discrepancies, when they exist.

Views Read Edit View history. Randomized consensus in expected O djstributed log n individual work.

Tight rmr lower bounds for mutual exclusion and other problems. Hagit AttiyaJennifer Welch.