Helary

Distributed Algorithms

9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings
Herausgegeben:Helary, Jean-Michel; Raynal, Michel

• Broschiertes Buch

Produktbeschreibung

This book constitutes the proceedings of the 9th International Workshop on Distributed Algorithms, WDAG '95, held in Le Mont-Saint-Michel, France in September 1995.
Besides four invited contributions, 18 full revised research papers are presented, selected from a total of 48 submissions during a careful refereeing process. The papers document the progress achieved in the area since the predecessor workshop (LNCS 857); they are organized in sections on asynchronous systems, networks, shared memory, Byzantine failures, self-stabilization, and detection of properties.

Produktdetails

• Lecture Notes in Computer Science 972
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-60274-3
• 1995.
• Seitenzahl: 352
• Erscheinungstermin: 30. August 1995
• Englisch
• Abmessung: 235mm x 155mm x 20mm
• Gewicht: 499g
• ISBN-13: 9783540602743
• ISBN-10: 3540602747
• Artikelnr.: 23144457

Inhaltsangabe

The triumph and tribulation of system stabilization.- Wait-free computing.- On real-time and non real-time distributed computing.- Theory and practice in distributed systems.- The inherent cost of strong-partial view-synchronous communication.- Revisiting the relationship between non-blocking atomic commitment and consensus.- Dissecting distributed coordination.- Optimal Broadcast with Partial Knowledge.- Multi-dimensional Interval Routing Schemes.- Data transmission in processor networks.- Distributed protocols against mobile eavesdroppers.- Universal constructions for large objects.- Load balancing: An exercise in constrained convergence.- Larchant-RDOSS: A distributed shared persistent memory and its garbage collector.- Broadcasting in hypercubes with randomly distributed Byzantine faults.- On the number of authenticated rounds in Byzantine Agreement.- Total ordering algorithms for asynchronous Byzantine systems.- A uniform self-stabilizing minimum diameter spanning tree algorithm.- Self-stabilization of wait-free shared memory objects.- Deterministic, constant space, self-stabilizing leader election on uniform rings.- Efficient detection of restricted classes of global predicates.- Faster possibility detection by combining two approaches.