Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Distributed Algorithms

9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings
BuchKartoniert, Paperback
340 Seiten
Englisch
Springererschienen am30.08.1995
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.mehr

Produkt

KlappentextThis 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.
Details
ISBN/GTIN978-3-540-60274-3
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr1995
Erscheinungsdatum30.08.1995
Seiten340 Seiten
SpracheEnglisch
Gewicht499 g
IllustrationenXII, 340 p.
Artikel-Nr.10730108

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Schlagworte