Distributed Algorithms
Springer Berlin (Verlag)
978-3-540-19366-1 (ISBN)
A distributed spanning tree algorithm.- Directed network protocols.- Fault tolerant queries in computer networks.- General and efficient decentralized consensus protocols.- A framework for agreement.- Byzantine firing squad using a faulty external source.- An improved multiple identification algorithm for synchronous broadcasting networks.- Distributed algorithms for tree pattern matching.- On the packet complexity of distributed selection.- Load balancing in a network of transputers.- Experience with a new distributed termination detection algorithm.- A distributed deadlock avoidance technique.- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion.- Verification of connection-management protocols.- Generalized scheme for topology-update in dynamic networks.- Local fail-safe network reset procedure.- Synchronizing asynchronous bounded delay networks.- A modular proof of correctness for a network synchronizer.- On the use of synchronizers for asynchronous communication networks.- Atomic multireader register.- An optimistic resiliency control scheme for distributed database systems.- A failsafe scheme for replicated information.- Randomized function evaluation on a ring.- A distributed ring orientation algorithm.- Constructing efficient election algorithms from efficient traversal algorithms.- Optimal resilient ring election algorithms.- Fault-tolerant distributed algorithm for election in complete networks.- Lower bounds for synchronous networks and the advantage of local information.- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes.- Stepwise removal of virtual channels in distributed algorithms.
Erscheint lt. Verlag | 1.5.1988 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VII, 432 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 721 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • combinatorics • Complexity • Database • data structures • Load Balancing • Topology • verification |
ISBN-10 | 3-540-19366-9 / 3540193669 |
ISBN-13 | 978-3-540-19366-1 / 9783540193661 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich