This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.
Distributed Algorithms
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
When looking into distributed systems, and the current research on distributed problems, a central issue is the breaking of symmetry. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
same identity number, expected message complexity, random leader, system send events, fairness algorithm, correct processors, random spanning tree, privilege message, synchronous multicast, ring revolutions, sequential branch, safe bits, atomicity conditions, deadlock detection algorithm, initialization init, root processor, atomic bits, combinatorial search problems, distributed deadlock detection, atomic variable, vertex cover problem, nearest king, reader protocol, protocol variables, crash failures Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Systems, New York, Theory of Computing, International Workshop, Lecture Notes, Cornell University, Springer Verlag, The Netherlands, British Columbia, Internal Report, North Holland, Proof Let, Selected Areas, Software Engineering, University of Nijmegen, Communication Magazine, Computing Surveys, Constructing Two-writer Atomic Registers New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
When looking into distributed systems, and the current research on distributed problems, a central issue is the breaking of symmetry. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
same identity number, expected message complexity, random leader, system send events, fairness algorithm, correct processors, random spanning tree, privilege message, synchronous multicast, ring revolutions, sequential branch, safe bits, atomicity conditions, deadlock detection algorithm, initialization init, root processor, atomic bits, combinatorial search problems, distributed deadlock detection, atomic variable, vertex cover problem, nearest king, reader protocol, protocol variables, crash failures Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Systems, New York, Theory of Computing, International Workshop, Lecture Notes, Cornell University, Springer Verlag, The Netherlands, British Columbia, Internal Report, North Holland, Proof Let, Selected Areas, Software Engineering, University of Nijmegen, Communication Magazine, Computing Surveys, Constructing Two-writer Atomic Registers New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 32
books:
See all 32 books this book cites
- Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) by Nancy A. Lynch on page 11, page 108, and page 109
- Algorithms for Mutual Exclusion (Scientific Computation) by Michel Raynal on page 23, and page 43
- Database Systems: Concepts, Languages and Architectures by Paolo Atzeni on page 206
- Parallel Complexity Theory (Research notes in theoretical computer science) by Ian Parberry on page 279
- Software Engineering by Gregory W. Jones in Front Matter
See all 32 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
