Journal ArticleDOI
The mutual exclusion problem: part I—a theory of interprocess communication
Reads0
Chats0
TLDR
A novel formal theory of concurrent systems that does not assume any atomic operations is introduced and the mutual exclusion is expressed precisely in terms of this model.Abstract:
A novel formal theory of concurrent systems that does not assume any atomic operations is introduced. The execution of a concurrent program is modeled as an abstract set of operation executions with two temporal ordering relations: “precedence” and “can causally affect”. 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.read more
Citations
More filters
Book
The Art of Multiprocessor Programming
TL;DR: Transactional memory as discussed by the authors is a computational model in which threads synchronize by optimistic, lock-free transactions, and there is a growing community of researchers working on both software and hardware support for this approach.
Journal ArticleDOI
Algorithms for scalable synchronization on shared-memory multiprocessors
TL;DR: The principal conclusion is that contention due to synchronization need not be a problemin large-scale shared-memory multiprocessors, and the existence of scalable algorithms greatly weakens the case for costly special-purpose hardware support for synchronization, and provides protection against so-called “dance hall” architectures.
Book
Algorithms for scalable synchronization on shared-memory multiprocessors
TL;DR: In this article, the authors present a scalable algorithm for spin locks that provides reasonable latency in the absence of contention, requires only a constant amount of space per lock, and requires no hardware support other than a swap-with-memory instruction.
Proceedings ArticleDOI
LogTM: log-based transactional memory
TL;DR: This paper presents a new implementation of transactional memory, log-based transactionalMemory (LogTM), that makes commits fast by storing old values to a per-thread log in cacheable virtual memory and storing new values in place.
Journal ArticleDOI
Total order broadcast and multicast algorithms: Taxonomy and survey
TL;DR: Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance.
References
More filters
Journal ArticleDOI
Ethernet: distributed packet switching for local computer networks
TL;DR: The design principles and implementation are described, based on experience with an operating Ethernet of 100 nodes along a kilometer of coaxial cable, of a model for estimating performance under heavy loads and a packet protocol for error controlled communication.
Journal ArticleDOI
On interprocess communication: Part I: Basic formalism
TL;DR: In Part II, the formalism is used to specify several classes of interprocess communication mechanisms and to prove the correctness of algorithms for implementing them.
Journal ArticleDOI
Solution of a problem in concurrent programming control
TL;DR: A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the “critical section” of its cycle.
Journal ArticleDOI
A new solution of Dijkstra's concurrent programming problem
TL;DR: A simple solution to the mutual exclusion problem is presented which allows the system to continue to operate despite the failure of any individual component.
Book
Solution of a problem in concurrent programming control
TL;DR: A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the "critical section" of its cycle.