Distributed algorithms : 9th international workshop, WDAG '95, Le-Mont-Saint-Michel, France, September 13-15, 1995 : proceedings

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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Coauteur: International Workshop on Distributed Algorithms :Le-Mont-Saint-Michel
Andere auteurs: Hélary, Jean-Michel, 1943- (Publishing director), Raynal, Michel, 1949-...., informaticien (Publishing director)
Formaat: Livre numérique
Taal:Anglais
Gepubliceerd in: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Reeks:Lecture notes in computer science 972
Onderwerpen:
Online toegang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Opmerking: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Distributed algorithms, 9th international workshop, WDAG '95, Le-Mont-Saint-Michel, France, September 13-15, 1995, proceedings, Jean-Michel Hélary et Michel Raynal (eds.), Berlin, Springer-Verlag, 1995, 1 vol. (XI-333 p.), Lecture notes in computer science, 3-540-60274-7
• Distributed Algorithms, Texte imprimé, 9783662177495
Inhoudsopgave:
  • 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.