Shared Global States in Distributed Computations
โ Scribed by Eddy Fromentin; Michel Raynal
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 324 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
A consistent observation of a given distributed computation is a sequence of global states that could be produced by executing that computation on a monoprocessor system. Therefore a distributed execution generally accepts several consistent observations. This paper investigates global states shared by all such observations. A necessary and sufficient condition characterizing these states is first given. Then, an algorithm that computes shared global states is described.
๐ SIMILAR VOLUMES
This paper identifies two classes of communication patterns that occur in distributed computations and explores their properties. It first examines local patterns, primarily IO and OI intervals, that occur at nodes in distributed computations. These local patterns form building blocks that are then
The domain of a global function is the set of all global states of an execution of a distributed program. We show how to monitor a program in order to determine if there exists a global state in which the sum x 1 + x 2 + 1 1 1 + x N exceeds some constant K, where x i is defined in process i. We exam