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):||14 July 2016|
|PDF File Size:||14.38 Mb|
|ePub File Size:||13.27 Mb|
|Price:||Free* [*Free Regsitration Required]|
Safe Privatization in Transactional Memory. RamalingamNoam Rinetzky: Distributed Computing 30 5: Safety of Live Transactions in Transactional Memory: This book covers the main elements of the theory of distributed computing, in a unifying approach which emphasizes the similarities between different ahgit, when possible, or explains inherent discrepancies, when they exist. The complexity of updating multi-writer snapshot objects. Efficient adaptive collect using randomization.
You are currently using the site but have requested a page in the site. Distributed Computing 18 3: Hagit AttiyaGili Yavneh: TMS is Necessary and Sufficient.
Fast Randomized Test-and-Set and Renaming. Randomization does not reduce the average delay in parallel packet switches.
Hagit AttiyaZvi Avidor: A non-topological proof for the impossibility of k-set agreement. Hagit AttiyaPanagiota Fatourou: The inherent queuing delay of parallel packet switches.
Ronit NossensonHagit Attiya: Polylogarithmic concurrent data structures from monotone circuits. Communication Systems 17 5: Account Options Sign in. Hagit AttiyaEyal Dagan: Efficient Adaptive Collect Using Randomization.
Hagit AttiyaJennifer Welch. Tight RMR lower bounds for mutual exclusion and other problems. The book covers a variety of problem domains within the models, including: Permissions Request permission to reuse content from this site.
It’s all about change. Views Read Edit View history.
dblp: Hagit Attiya
Hagit AttiyaSergio Rajsbaum: Hagit AttiyaAmi Paz: Quantifying rollback propagation in distributed checkpointing. The relationships between the various models are demonstrated by simulations showing that algorithms designed for one model can be run in another model. Adaptive and efficient mutual exclusion. 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.
She has been the editor-in-chief of the journal Distributed Computing since Upper bound on the complexity of solving hard renaming. 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. Distributed Computing Jennifer L. Algorithms adapting to point contention.
Hagit Attiya – Wikipedia
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. Lower bounds for restricted-use objects: Parallel Processing Letters 16 4: Hagit AttiyaFabian KuhnC. Distributed Computing 16