The Mutual Exclusion Problem - Part I: A Theory of Interprocess Communication

The Mutual Exclusion Problem - Part I: A Theory of Interprocess Communication (2000)

by L. Lamport

Citations:

45 - 4 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Mutual Exclusion Problem - Part I: A Theory of Interprocess Communication	user correction - Legacy Corrections
AUTHOR NAME	L. Lamport	user correction - Legacy Corrections
ABSTRACT	A novel formal theory of concurrent systems is introduced that does not assume any atomic operations. The execution of a concurrent program is modeled as an abstract set of operation executions with two temporal ordering relations: "precedence" and "can causally a#ect". A primitive interprocess communication mechanism is then defined. In Part II, the mutual exclusion is expressed precisely in terms of this model, and solutions using the communication mechanism are given. Contents 1 Introduction 2 2 The Model 2 2.1 Physical Considerations . . . . . . . . . . . . . . . . . . . . . 3 2.2 System Executions . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Higher-Level Views . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Interprocess Communication 9 4 Processes 14 5 Multiple-Reader Variables 17 6 Discussion of the Assumptions 18 7 Conclusion 19 1 1 Introduction The mutual exclusion problem was first described and solved by Dijkstra in [3]. In this problem, there is a collection...	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0