A basic unit of computation in distributed systems

Ahuja, M.; Kshemkalyani, Ajay D.; Carlson, Timothy J.

doi:10.1109/icdcs.1990.89327

Cited by 26 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An example of the assignment o f v ector timestamps to e v ents is given in Figure 4, The following t wo w ell-known theorems show t hat t imestamps can be used to d etermine t he causal relation between primitive e v ents. For two v ectors t 0 ; t 1 This precedence test formalizes the visualization of precedence given in Figure 3. It provides an e cient w ay to d etermine precedence among primitive e v ents; at most N integer comparisons are necessary.…”

Section: Vector Timementioning

confidence: 99%

“…First, for the sake of simplicity, a n y timestamp should contain at most one i n teger entry per process. 1 Second, when calculating a t imestamp for an abstract event, no information about a n y primitive e v ent is used other than the process in which t he e v ent occurs, whether it is part of the a bstract event, and i t s t imestamps. Third, the only information about a process that m ay be used is whether part of the a bstract event occurs in it.…”

Section: Timestamps and Precedence Tests For Abstract Eventsmentioning

confidence: 99%

See 1 more Smart Citation

Vector time and causality among abstract events in distributed computations

Basten

Kunz

Black

et al. 1997

Distributed Computing

View full text Add to dashboard Cite

An important problem in analyzing distributed computations is the amount of information. In event-based models, even for simple applications, the n umber of events is large and t he c a usal structure is complex. Event a bstraction can be used to r e d uce the a p parent complexity o f a distributed computation.This paper discusses one important aspect of event a bstraction: causality among a bstract events. Following Lamport 24 , two c a usality relations are de ned on abstract events, called weak and strong precedence. A general theoretical framework based on logical vector time is developed in which s e v eral meaningful timestamps for abstract events are derived. These timestamps can be used to e ciently determine c a usal relationships between arbitrary abstract events. The class of convex abstract events i s i d enti ed as a subclass of abstract events t hat i s general enough to be widely applicable and restricted enough to simplify timestamping s c hemes used for characterizing w eak precedence. We explain why s u ch a simpli cation seems not possible for strong precedence.

show abstract

Section: Vector Timementioning

confidence: 99%

Section: Timestamps and Precedence Tests For Abstract Eventsmentioning

confidence: 99%

Vector time and causality among abstract events in distributed computations

Basten

Kunz

Black

et al. 1997

Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Hence we may suppose that (ρ) = (E, λ, { p }, , ≤) where E = {e 1 where θ j = (n j , Γ j , W j , n j ) with n j being the starting node of j , and Γ j the collection of all λ(e) for all events e that are in both ( j ) and With Lemma 3, we establish Theorem 1. As for complexity, the bound on the number of states in A H stated in Theorem 1 is clear from the construction of A H .…”

Section: Lemma 3 Let σ ∈ σ Then σ Is Accepted By a H Iff σ Is In Lmentioning

confidence: 99%

“…We shall adapt the notion of atoms [1,9] and the techniques from [6]. Let us first introduce a notion of decomposition of causal MSCs into basic parts.…”

Section: Fig 7 a Globally-cooperative Causal Hmsc That Is Not Existmentioning

confidence: 99%

See 1 more Smart Citation

Causal Message Sequence Charts

Gazagnaire

Genest

Hélouët

et al.

CONCUR 2007 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Scenario languages based on Message Sequence Charts (MSCs) and related notations have been widely studied in the last decade [14,13,2,9,6,12,8]. The high expressive power of scenarios renders many basic problems concerning these languages undecidable. The most expressive class for which several problems are known to be decidable is one which possesses a behavioral property called "existentially bounded". However, scenarios outside this class are frequently exhibited by asynchronous distributed systems such as sliding window protocols. We propose here an extension of MSCs called Causal Message Sequence Charts, which preserves decidability without requiring existential bounds. Interestingly, it can also model scenarios from sliding window protocols. We establish the expressive power and complexity of decision procedures for various subclasses of Causal Message Sequence Charts.

show abstract

Units of Computation in Fault-Tolerant Distributed Systems

Ahuja

Mishra

1997

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

A basic unit of computation in distributed systems

Cited by 26 publications

References 13 publications

Vector time and causality among abstract events in distributed computations

Vector time and causality among abstract events in distributed computations

Causal Message Sequence Charts

Units of Computation in Fault-Tolerant Distributed Systems

Contact Info

Product

Resources

About