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
Communication Patterns in Distributed Computations
โ Scribed by Ajay D. Kshemkalyani; Mukesh Singhal
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 206 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
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 used to define the global patterns, termed segments and paths, that occur across nodes in distributed computations. By controlling the predicates on the local patterns used to define segments and paths, various types of segments and paths can be defined. While a causal chain captures only the causality relation, it turns out that some of the other message sequences that do not capture causality also play a significant role in the analysis of a distributed computation. The paper presents a framework and shows that a number of key concepts and structures characterizing distributed computations are specific instantiations of the communication patterns identified in the framework.
๐ SIMILAR VOLUMES
The use of distributed computer control systems (DCCS) demands high reliability. adequate real-time behaviour and increasinsJy econonxical systems. The last d t~nand rezluires the use of cheap standard ccmpcoents, wl~ncver possible. The following paper discusses the realizMJon of DCCS with respect t
Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.