Protocols by Invariants [Paperback]

Collection of protocols for distributed and parallel computing, with applications.Distributed algorithms are conceptually far more complex than algorithms in the single processing unit environment. When the number of possibilities of what can happen at any one time becomes large, human minds cannot keep track of all of them. Naturally, however, it is necessary to know whether the distributed algorithm in question will have the desired effect. In this book Dr. Schoone discusses assertaional verification by system-wide invariants for verifying the behaviour of distributed algorithms. The approach is entirely pragmatic and many different examples, from a wide range of algorithms and protocols, are considered in detail. This self contained volume will be an essential purchse for all those with an interest in distributed algorithms.Distributed algorithms are conceptually far more complex than algorithms in the single processing unit environment. When the number of possibilities of what can happen at any one time becomes large, human minds cannot keep track of all of them. Naturally, however, it is necessary to know whether the distributed algorithm in question will have the desired effect. In this book Dr. Schoone discusses assertaional verification by system-wide invariants for verifying the behaviour of distributed algorithms. The approach is entirely pragmatic and many different examples, from a wide range of algorithms and protocols, are considered in detail. This self contained volume will be an essential purchse for all those with an interest in distributed algorithms.Algorithms are a set of rules that specify a sequence of actions to be taken to solve a problem. Distributed algorithms, which are designed to solve many problems at once, are conceptually far more complex than algorithms in a single processing unit environment. When the number of simultaneous events becomes large, human minds cannot keep track of all of them. Naturally, it is necessary to know whetlÌ