Elements of Distributed Algorithms

Wolfgang Reisig

ISBN 10: 3540627529 / ISBN 13: 9783540627524

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1998, 1998

About this Item

Neuware -Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 324 pp. Englisch.

Seller Inventory # 9783540627524

Bibliographic Details

• Title: Elements of Distributed Algorithms
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1998
• Publication Date: 1998
• Language: English
• ISBN 10: 3540627529
• ISBN 13: 9783540627524
• Binding: Buch
• Condition: Neu

About this title

Synopsis

Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.
In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.
The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.