Communication Patterns in Distributed Computations

Kshemkalyani, Ajay D.; Singhal, Mukesh

doi:10.1006/jpdc.2001.1818

Cited by 6 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Global state observation and predicate detection are fundamental problems in distributed systems. This paper provides an understanding of interval-based global states in terms of the causal communication patterns induced by the message-passing interactions in an execution [25]. 4.…”

Section: Summary Of Results and Contributionsmentioning

confidence: 99%

“…For example, in the context of checkpointing [4,5,15,33,34], ψ i can be used to describe the kth checkpoint interval at P i . To characterize deadlock [26,25], ψ i denotes the interval from the time of incoming wait-for dependency to the time of an outgoing wait-for dependency, or vice versa; such intervals at different processes capture how dependency chains grow. For conjunctive predicate detection [7,12], ψ i is the predicate on the local variables that the application wants to detect.…”

Section: System Model and Backgroundmentioning

confidence: 99%

“…The interval has the property that a predicate defined on local variables is always true in the interval and is false immediately before and immediately after the interval. The semantics of the interval depend on the predicate which is application-specific [17,18,20,22,25,27,29]; application areas such as sensor networks, distributed debugging, deadlock characterization [26], predicate detection [7,11,12], checkpointing [3][4][5]33,34], and industrial process control model such intervals. Such high-level abstract events at processes and the corresponding time intervals that they span have been explicitly studied [18,20,21,29].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Data-stream-based global event monitoring using pairwise interactions

Chandra

Kshemkalyani

2008

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

The problem of global state observation is fundamental to distributed systems and to the analysis of data streams. Many interactions in distributed systems can be analyzed in terms of the building block formed by the pairwise interactions of intervals at two processes. Considering causality-based pairwise interactions by which two processes may interact with each other, there are 40 orthogonal interaction types. For each pair of processes (P i , P j ), let interaction type r i, j be of interest. This paper examines the problem: "If a global state of interest to an application is specified in terms of such pairwise interaction types, one per pair of processes, how can such a global state be detected?" A solution identifies a global state in which the interaction type specified for each process pair is satisfied. This paper formulates the specific conditions on the communication structures to determine which of the intervals being examined at any time may never satisfy the stipulated interaction type for that pair of processes, and therefore that interval(s) need no longer be considered as forming a part of any solution. Based on this theory, the paper proposes two on-line distributed algorithms to solve the problem.

show abstract

Section: Summary Of Results and Contributionsmentioning

confidence: 99%

Section: System Model and Backgroundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Data-stream-based global event monitoring using pairwise interactions

Chandra

Kshemkalyani

2008

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [4], two classes of communication patterns that occur in a network computing environment were identified and explored. In [3], a multilevel scheme was proposed for reducing the data dependency among computing nodes.…”

Section: Introductionmentioning

confidence: 99%