Blick ins Buch

Distributed Algorithms

4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings.

Jan van Leeuwen, Nicola Santoro (Herausgeber)

Buch | Softcover

VIII, 436 Seiten

1991
Springer Berlin (Verlag)
978-3-540-54099-1 (ISBN)

Artikel merken

This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and otherinterested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering current research in such aspects of distributed algorithm design as distributed combinatorial algorithms, distributed algorithms on graphs, distributed algorithms for new types of decentralized systems, distributed data structures, synchronization and load-balancing, distributed algorithms for control and communication, design and verification of network protocols, routing algorithms, fail-safe and fault-tolerant distributed algorithms, distributed database techniques, algorithms for transaction management and replica control, and other related topics.

Self-stabilizing ring orientation.- Memory-efficient self stabilizing protocols for general networks.- On the computational power needed to elect a leader.- Spanning tree construction for nameless networks.- A linear fault-tolerant naming algorithm.- Distributed data structures: A complexity-oriented view.- An improved algorithm to detect communication deadlocks in distributed systems.- On the average performance of synchronized programs in distributed networks.- Distributed algorithms for reconstructing MST after topology change.- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks.- Stepwise development of a distributed load balancing algorithm.- Greedy packet scheduling.- Optimal computation of global sensitive functions in fast networks.- Efficient mechanism for fairness and deadlock-avoidance in high-speed networks.- Strong verifiable secret sharing extended abstract.- Weak consistency and pessimistic replica control.- Localized-access protocols for replicated databases.- Weighted voting for operation dependent management of replicated data.- Wakeup under read/write atomicity.- Time and message efficient reliable broadcasts.- Early-stopping distributed bidding and applications.- Fast consensus in networks of bounded degree.- Common knowledge and consistent simultaneous coordination.- Agreement on the group membership in synchronous distributed systems.- Tight bounds on the round complexity of distributed 1-solvable tasks.- A time-randomness tradeoff for communication complexity.- Bounds on the costs of register implementations.- A bounded first-in, first-enabled solution to the l-exclusion problem.

Erscheint lt. Verlag	19.6.1991
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VIII, 436 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	728 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Schlagworte	algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • broadcast • Complexity • Databases • data structure • Distributed Systems • Echtzeit-Verarbeitung • Load Balancing • Netzwerkprotokoll • Routing • verification • Verteilte Systeme
ISBN-10	3-540-54099-7 / 3540540997
ISBN-13	978-3-540-54099-1 / 9783540540991
Zustand	Neuware