Distributed Algorithms: 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. Proceedings
Jean-Michel Helary, Michel Raynal
Springer, Sep 28, 1995 - Electronic data processing - 333 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
On RealTime and Non RealTime Distributed Computing
9 other sections not shown
Other editions - View all
actions application arbitrary assume asynchronous systems Atomic Commitment BCl-n-cube block bound broadcasting bunch Byzantine faults communication complexity Computer Science concurrent condition configuration consider construction convergence correct crash defined definition denoted detection deterministic Distributed Algorithms Distributed Computing distributed systems execution fault-tolerant faulty nodes finite global Gouda graph Herlihy's holds hypercubes IEEE implementation initial input interval label Lemma linear linearizable load balancing MDST multicast n-cube NB-AC node NP-complete operation optimal participant pointer predicate problem Proc Proceedings processor Proof properties protocol queue random real-time real-time computing requires rounds satisfies schedule Section self-stabilizing sequence sequential shortest paths solved SP-VSC stabilizing steps subset Symposium Theorem token topology total order Toueg tree TV-consensus Uniform Consensus universal hash function unreliable failure detectors update variable vertex vote wait-free write