skip to main content
Skip header Section
Distributed computing: fundamentals, simulations and advanced topicsOctober 1998
Publisher:
  • McGraw-Hill, Inc.
  • Professional Book Group 11 West 19th Street New York, NY
  • United States
ISBN:978-0-07-709352-5
Published:30 October 1998
Pages:
451
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Pandurangan G, Robinson P and Scquizzato M (2019). A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees, ACM Transactions on Algorithms, 16:1, (1-27), Online publication date: 31-Jan-2020.
  2. ACM
    Pandurangan G, Robinson P and Scquizzato M A time- and message-optimal distributed algorithm for minimum spanning trees Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (743-756)
  3. Gafni E and Malkhi D Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363, (140-153)
  4. Ma Z (2015). Towards computational models of animal communications, an introduction for computer scientists, Cognitive Systems Research, 33:C, (70-99), Online publication date: 1-Mar-2015.
  5. ACM
    Alistarh D, Aspnes J, Censor-Hillel K, Gilbert S and Guerraoui R (2014). Tight Bounds for Asynchronous Renaming, Journal of the ACM, 61:3, (1-51), Online publication date: 1-May-2014.
  6. Delporte-Gallet C, Fauconnier H, Gafni E and Lamport L Adaptive Register Allocation with a Linear Number of Registers Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205, (269-283)
  7. Maurer A and Tixeuil S On byzantine broadcast in loosely connected networks Proceedings of the 26th international conference on Distributed Computing, (253-266)
  8. ACM
    Castañeda A and Rajsbaum S (2012). New combinatorial topology bounds for renaming, Journal of the ACM, 59:1, (1-49), Online publication date: 1-Feb-2012.
  9. Attiya H and Castañeda A A non-topological proof for the impossibility of k-set agreement Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (108-119)
  10. ACM
    Dobre D, Guerraoui R, Majuntke M, Suri N and Vukolić M The complexity of robust atomic storage Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (59-68)
  11. ACM
    Hong G and Srimani P A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph Proceedings of the 49th Annual Southeast Regional Conference, (306-307)
  12. Junqueira F, Marzullo K, Herlihy M and Penso L (2010). Threshold protocols in survivor set systems, Distributed Computing, 23:2, (135-149), Online publication date: 1-Oct-2010.
  13. ACM
    Friedman R, Kliot G and Avin C (2008). Probabilistic quorum systems in wireless Ad Hoc networks, ACM Transactions on Computer Systems (TOCS), 28:3, (1-50), Online publication date: 1-Sep-2010.
  14. Okun M (2010). Strong order-preserving renaming in the synchronous message passing model, Theoretical Computer Science, 411:40-42, (3787-3794), Online publication date: 1-Sep-2010.
  15. Castañeda A and Rajsbaum S (2010). New combinatorial topology bounds for renaming, Distributed Computing, 22:5-6, (287-301), Online publication date: 1-Aug-2010.
  16. ACM
    Delporte-Gallet C, Fauconnier H and Guerraoui R (2010). Tight failure detection bounds on atomic object implementations, Journal of the ACM (JACM), 57:4, (1-32), Online publication date: 1-Apr-2010.
  17. Juan Marín R, Cholvi V, Jiménez E and Muñoz-Escoí F Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I, (449-466)
  18. Vojdani M and Taj Y DR Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing, (90-99)
  19. ACM
    Attiya H and Censor K Lower bounds for randomized consensus under a weak adversary Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (315-324)
  20. ACM
    Castañeda A and Rajsbaum S New combinatorial topology upper and lower bounds for renaming Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (295-304)
  21. ACM
    Delporte-Gallet C, Fauconnier H and Guerraoui R Sharing is harder than agreeing Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (85-94)
  22. Wang X, Teo Y and Cao J (2008). Message and time efficient consensus protocols for synchronous distributed systems, Journal of Parallel and Distributed Computing, 68:5, (641-654), Online publication date: 1-May-2008.
  23. ACM
    Guerraoui R, Levy R, Pochon B and Pugh J (2008). The collective memory of amnesic processes, ACM Transactions on Algorithms, 4:1, (1-31), Online publication date: 1-Mar-2008.
  24. ACM
    Dinitz Y, Moran S and Rajsbaum S (2008). Bit complexity of breaking and achieving symmetry in chains and rings, Journal of the ACM, 55:1, (1-28), Online publication date: 1-Feb-2008.
  25. ACM
    Vaidya N and Das S (2008). RFID-based networks, ACM SIGMOBILE Mobile Computing and Communications Review, 12:1, (2-14), Online publication date: 1-Jan-2008.
  26. Gramoli V and Raynal M Timed quorum systems for large-scale and dynamic environments Proceedings of the 11th international conference on Principles of distributed systems, (429-442)
  27. Gramoli V and Raynal M Timed Quorum Systems for Large-Scale and Dynamic Environments Principles of Distributed Systems, (429-442)
  28. Viswanathan S, Veeravalli B and Robertazzi T (2007). Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems, IEEE Transactions on Parallel and Distributed Systems, 18:10, (1450-1461), Online publication date: 1-Oct-2007.
  29. Guerraoui R and Raynal M From unreliable objects to reliable objects Proceedings of the 9th international conference on Parallel Computing Technologies, (47-61)
  30. Hamid B, Le Saëc B and Mosbah M Distributed local 2-connectivity test of graphs and applications Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications, (195-207)
  31. Chalopin J, Godard E, Métivier Y and Ossamy R Mobile agent algorithms versus message passing algorithms Proceedings of the 10th international conference on Principles of Distributed Systems, (187-201)
  32. Beauquier J, Delaët, S and Haddad S A 1-strong self-stabilizing transformer Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems, (95-109)
  33. Chalopin J, Métivier Y and Zielonka W (2019). Local Computations in Graphs: The Case of Cellular Edge Local Computations, Fundamenta Informaticae, 74:1, (85-114), Online publication date: 31-Oct-2006.
  34. Okun M and Barak A Renaming in message passing systems with byzantine failures Proceedings of the 20th international conference on Distributed Computing, (16-30)
  35. ACM
    Keidar I and Shraer A Timeliness, failure-detectors, and consensus performance Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (169-178)
  36. Nesterenko M and Tixeuil S Discovering network topology in the presence of byzantine faults Proceedings of the 13th international conference on Structural Information and Communication Complexity, (212-226)
  37. Beauquier J, Delaët S and Haddad S Necessary and sufficient conditions for 1-adaptivity Proceedings of the 20th international conference on Parallel and distributed processing, (96-96)
  38. Higham L and Johnen C Relationships between communication models in networks using atomic registers Proceedings of the 20th international conference on Parallel and distributed processing, (92-92)
  39. Gafni E, Rajsbaum S, Raynal M and Travers C The committee decision problem Proceedings of the 7th Latin American conference on Theoretical Informatics, (502-514)
  40. Chalopin J, Métivier Y and Zielonka W (2006). Local Computations in Graphs: The Case of Cellular Edge Local Computations, Fundamenta Informaticae, 74:1, (85-114), Online publication date: 1-Jan-2006.
  41. Cohen R, Fraigniaud P, Ilcinkas D, Korman A and Peleg D Labeling schemes for tree representation Proceedings of the 7th international conference on Distributed Computing, (13-24)
  42. Chockler G, Lynch N, Mitra S and Tauber J Proving atomicity Proceedings of the 19th international conference on Distributed Computing, (152-168)
  43. Parvedy P, Raynal M and Travers C Early-stopping k-set agreement in synchronous systems prone to any number of process crashes Proceedings of the 8th international conference on Parallel Computing Technologies, (49-58)
  44. Dinitz Y and Solomon N Two absolute bounds for distributed bit complexity Proceedings of the 12th international conference on Structural Information and Communication Complexity, (115-126)
  45. ACM
    Reynal M (2005). A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, 36:1, (53-70), Online publication date: 1-Mar-2005.
  46. Ioannidou K (2018). Transformations of self-stabilizing algorithms, Journal of High Speed Networks, 14:1, (85-105), Online publication date: 1-Jan-2005.
  47. ACM
    Cachin C and Strobl R Asynchronous group key exchange with failures Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (357-366)
  48. ACM
    Delporte-Gallet C, Fauconnier H, Guerraoui R, Hadzilacos V, Kouznetsov P and Toueg S The weakest failure detectors to solve certain fundamental problems in distributed computing Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (338-346)
  49. ACM
    Dutta P, Guerraoui R, Levy R and Chakraborty A How fast can a distributed atomic read be? Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (236-245)
  50. Nichitiu C, Papazian C and Rémila E (2019). Leader election in plane cellular automata, only with left-right global convention, Theoretical Computer Science, 319:1-3, (367-384), Online publication date: 10-Jun-2004.
  51. ACM
    Teo Y and Onggo B Formalization and strictness of simulation event orderings Proceedings of the eighteenth workshop on Parallel and distributed simulation, (89-96)
  52. Guerraoui R and Raynal M (2004). The Information Structure of Indulgent Consensus, IEEE Transactions on Computers, 53:4, (453-466), Online publication date: 1-Apr-2004.
  53. ACM
    Mostefaoui A, Rajsbaum S and Raynal M (2003). Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM (JACM), 50:6, (922-954), Online publication date: 1-Nov-2003.
  54. Fich F and Ruppert E (2003). Hundreds of impossibility results for distributed computing, Distributed Computing, 16:2-3, (121-163), Online publication date: 1-Sep-2003.
  55. Aspnes J (2003). Randomized protocols for asynchronous consensus, Distributed Computing, 16:2-3, (165-175), Online publication date: 1-Sep-2003.
  56. Dolev S and Rajsbaum S (2019). Stability of long-lived consensus, Journal of Computer and System Sciences, 67:1, (26-45), Online publication date: 1-Aug-2003.
  57. Takamura M and Igarashi Y Group mutual exclusion algorithms based on ticket orders Proceedings of the 9th annual international conference on Computing and combinatorics, (232-241)
  58. ACM
    Fatourou P, Fich F and Ruppert E A tight time lower bound for space-optimal implementations of multi-writer snapshots Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (259-268)
  59. Junqueira F and Marzullo K Synchronous Consensus for Dependent Process Failures Proceedings of the 23rd International Conference on Distributed Computing Systems
  60. Dinitz Y, Moran S and Rajsbaum S (2018). Exact communication costs for consensus and leader in a tree, Journal of Discrete Algorithms, 1:2, (167-183), Online publication date: 1-Apr-2003.
  61. Friedman R, Mostéfaoui A, Rajsbaum S and Raynal M Using error-correcting codes to solve distributed agreement problems Future directions in distributed computing, (17-21)
  62. ACM
    Greenwald M Two-handed emulation Proceedings of the twenty-first annual symposium on Principles of distributed computing, (260-269)
  63. ACM
    Fatourou P, Fich F and Ruppert E Space-optimal multi-writer snapshot objects are slow Proceedings of the twenty-first annual symposium on Principles of distributed computing, (13-20)
  64. Peleg D (2019). Local majorities, coalitions and monopolies in graphs, Theoretical Computer Science, 282:2, (231-257), Online publication date: 10-Jun-2002.
  65. ACM
    Spielmann M, Tyszkiewicz J and Van den Bussche J Distributed computation of web queries using automata Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (97-108)
  66. Pascoe J, Loader R and Sunderam V (2019). Collaborative Group Membership, The Journal of Supercomputing, 22:1, (55-68), Online publication date: 1-May-2002.
  67. Mostefaoui A, Mourgaya E and Raynal M (2018). An introduction to oracles for asynchronous distributed systems, Future Generation Computer Systems, 18:6, (757-767), Online publication date: 1-May-2002.
  68. Abraham U, Dolev S, Herman T and Koll I (2001). Self-stabilizing l-exclusion, Theoretical Computer Science, 266:1-2, (653-692), Online publication date: 6-Sep-2001.
  69. ACM
    Mostefaoui A, Rajsbaum S, Raynal M and Roy M A hierarchy of conditions for consensus solvability Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (151-160)
  70. ACM
    Mostefaoui A, Rajsbaum S and Raynal M Conditions on input vectors for consensus solvability in asynchronous distributed systems Proceedings of the thirty-third annual ACM symposium on Theory of computing, (153-162)
  71. Herman T (2000). Phase Clocks for Transient Fault Repair, IEEE Transactions on Parallel and Distributed Systems, 11:10, (1048-1057), Online publication date: 1-Oct-2000.
  72. ACM
    Malpani N, Welch J and Vaidya N Leader election algorithms for mobile ad hoc networks Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, (96-103)
  73. ACM
    Dolev S and Rajsbaum S Stability of long-lived consensus (extended abstract) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, (309-318)
  74. ACM
    Barak B, Herzberg A, Naor D and Shai E The proactive security toolkit and applications Proceedings of the 6th ACM conference on Computer and communications security, (18-27)
  75. ACM
    Dinitz Y, Moran S and Rajsbaum S Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (265-274)
Contributors
  • Texas A&M University
  • Technion - Israel Institute of Technology

Recommendations

Reviews

Shrisha Rao

Distributed computing is an important field of study. Its relevance is easy to realize--the world of computing is increasingly distributed, with resources that are geographically spread, often with no central authority or assurances of performance. Tasks and services that a single person uses are increasingly likely to depend upon invocations of resources that are distributed. The safety of persons or property may also depend upon the proper functioning and coordination of diverse, uncorrelated computing elements. At present, there is a significant dichotomy in the study and practice of distributed computing. On the one hand, academics study it as a theoretical subject, a pure science almost, and derive theorems and protocols regarding distributed systems. On the other, practitioners who do not care much for theory attempt to create distributed systems that have to deliver real-world results. The two groups often do not speak the same language, and members of one often have little interest in what the other is doing. Until very recently, researchers in distributed computing have had to face other problems as well: the field is extensively researched but has little by way of tutorial or textbook resources, hence a newcomer or a practitioner wishing to learn was often obliged to weave through a maze of research papers in hopes of obtaining his end. Although distributed computing has been, and remains as, one of the areas of research where even relatively new graduate students can conduct useful research (provided they have been diligent in doing their homework in the first course or two they took), this problem has made it difficult for researchers to communicate the relevance and significance of their work to the larger community of computer scientists. It has also meant that a researcher presenting a paper on distributed computing to an audience of non-specialists is obliged to spend a good chunk of his allotted time in first explaining the very rudiments of the subject before moving on to his specialized topic. Part of the problem has been the lack of attention paid to distributed computing in traditional undergraduate computer science curricula (it continues to remain largely outside the pale of core subjects even in graduate studies), but then this in turn is also attributable to the lack of tutorial material. The present book by Attiya and Welch is thus a welcome addition to the literature on distributed computing, as it lays out important theoretical results in the field in a fashion that a newcomer (or a practitioner) can grasp with ease, and as it also makes a significant beginning in bridging the gap between theory and practice. As the title suggests, the book is divided into three major parts, dealing respectively with fundamentals, simulations, and advanced topics. These are in turn further subdivided into six, seven, and five chapters respectively. A course on distributed computing can be variably designed, depending on the instructor's priorities, using the first part and selected portions from the next two. The first part of the book covers the very basic ideas such as message-passing, mutual exclusion, shared memory, consensus, and logical time. The second part, which in the opinion of this reviewer is what makes the book most worthwhile, deals with abstractions for describing and designing systems to solve, or simulate, real problems such as broadcast and multicast. The discussion on read/write registers and the like is crucial to the field and has attracted extensive interest, but has not previously been covered outside the research literature. The last part of the book deals with some advanced questions which an interested student may refer to en route to his plunge into the current research literature. The student exercises and `Chapter Notes' given at the end of each chapter are useful instructional resources; the publisher also has solutions to selected exercises available upon request to instructors. The book has a small number of mostly self-correcting typographical errors; the author Attiya has a list of errata on her Web site.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.