On Lamport's interprocessor communication model

Anger, Frank D.

doi:10.1145/65979.65982

Cited by 36 publications

(12 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the latter relation, by the axioms of Anger [1989], TW [k j ] p (O[ p]) E TR [l] i,q (O[q]). The following lemma shows that Scans can determine the correct temporal order of the private values of all processes.…”

Section: Corollary 1 It Is Clear From the Proof Of Lemma 7 That If Amentioning

confidence: 99%

Bounded concurrent timestamp systems using vector clocks

Haldar¹,

Vitányi

2002

J. ACM

View full text Add to dashboard Cite

Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication object, and has been shown to be a powerful tool to solve many concurrency control problems. It has turned out to be possible to construct such higher typed objects from primitive lower typed ones. The next step is to find efficient constructions. We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer shared registers. This finalizes, corrects, and extends a preliminary bounded multiwriter construction proposed by the second author in 1986. That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.

show abstract

Section: Corollary 1 It Is Clear From the Proof Of Lemma 7 That If Amentioning

confidence: 99%

Bounded concurrent timestamp systems using vector clocks

Haldar¹,

Vitányi

2002

J. ACM

View full text Add to dashboard Cite

show abstract

“…X −− → Y iff some atomic event in X causally precedes some atomic event in Y . The model and axioms in [27] were further examined in [1,4,5].…”

Section: Previous Workmentioning

confidence: 99%

Causality and atomicity in distributed computations

Kshemkalyani

1998

Distributed Computing

View full text Add to dashboard Cite

In a distributed system, high-level actions can be modeled by nonatomic events. This paper proposes causality relations between distributed nonatomic events and provides efficient testing conditions for the relations. The relations provide a fine-grained granularity to specify causality relations between distributed nonatomic events. The set of relations between nonatomic events is complete in first-order predicate logic, using only the causality relation between atomic events. For a pair of distributed nonatomic events X and Y , the evaluation of any of the causality relations requires |N X | × |N Y | integer comparisons, where |N X | and |N Y |, respectively, are the number of nodes on which the two nonatomic events X and Y occur. In this paper, we show that this polynomial complexity of evaluation can by simplified to a linear complexity using properties of partial orders. Specifically, we show that most relations can be evaluated in min(|N X |, |N Y |) integer comparisons, some in |N X | integer comparisons, and the others in |N Y | integer comparisons. During the derivation of the efficient testing conditions, we also define special system execution prefixes associated with distributed nonatomic events and examine their knowledge-theoretic significance.

show abstract

“…Timed observation sequences. We model system executions by in nite discrete state sequences s = s 0 ; s 1 ; : : : 5 . We restrict ourselves to the externally observable state component of any system and assume the existence of global system states.…”

Section: A Real-time Execution Modelmentioning

confidence: 99%

“…3 =0 INPUT(UDind a (n))): 17 For an estimation of t S compare the number of frames transmitted per second in a multimedia application, which is typically less than 2 5 , with the possible size of the range of a sequence number of 2 m where m is likely to be greater or equal to 8.…”

Section: Inter-stream Synchronizationmentioning

confidence: 99%

Formal methods for broadband and multimedia systems

Fischer

Leue

1998

Computer Networks and ISDN Systems

View full text Add to dashboard Cite

The proper capture of desired system properties is a pivotal step in providing high quality systems. The formal speci cation of these properties is necessary to provide unambiguous documentation as well as automated transformation of system requirements during all stages of the life cycle. The standardized Formal Description Techniques (FDTs) Estelle and SDL have proved useful for the speci cation of traditional protocols and distributed systems. With the availability of high-speed networks new applications with additional requirements and characteristics are becoming reality. These requirements are often referred to as Quality of Service (QoS) requirements. We show that the above mentioned FDTs do not possess the expressiveness to capture important classes of QoS requirements, namely quantitative deterministic real-time-related properties. It is the purpose of this paper to exemplify steps that need to be taken in order to overcome this de cit. We rst discuss choices that need to be made when designing a suitable real-time execution model for SDL and Estelle and proceed to present two remedies to the inexpressiveness problem: First, we introduce the concept of complementary real-time speci cation by reconciling the semantic models of Metric Temporal Logic and SDL and showing how both languages can be used in a complementary fashion. Second, we suggest a language extension and the corresponding semantic interpretation for Estelle. While we present examples from the domain of multimedia and broadband systems, the applicability of our speci cation methods extends to hard real-time systems. Finally, we discuss extensions of our techniques to capture QoS stochastic properties, and we allude to formal requirements veri cation and automatic implementation based on our techniques.

show abstract

On Lamport's interprocessor communication model

Cited by 36 publications

References 13 publications

Bounded concurrent timestamp systems using vector clocks

Bounded concurrent timestamp systems using vector clocks

Causality and atomicity in distributed computations

Formal methods for broadband and multimedia systems

Contact Info

Product

Resources

About