The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Concurrent Programming Concepts
ACM Computing Surveys (CSUR)
A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Specification of time dependencies and synthesis of concurrent processes
ICSE '87 Proceedings of the 9th international conference on Software Engineering
ICSE '87 Proceedings of the 9th international conference on Software Engineering
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The global time assumption and semantics for concurrent systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On Lamport's interprocessor communication model
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent data structures and actor programming under the Matroshka model
OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Decentralized mutual exclusion in the presence of link failures
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Critical Races in Ada Programs
IEEE Transactions on Software Engineering
Memory Access Dependencies in Shared-Memory Multiprocessors
IEEE Transactions on Software Engineering
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Improving the accuracy of data race detection
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
What are race conditions?: Some issues and formalizations
ACM Letters on Programming Languages and Systems (LOPLAS)
Adaptive solutions to the mutual exclusion problem
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A formalism for specifying communicating processes
CSC '93 Proceedings of the 1993 ACM conference on Computer science
The Ariadne debugger: scalable application of event-based abstraction
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
On the power of shared object types to implement one-resilient Consensus
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
IEEE Transactions on Computers
Thin locks: featherweight synchronization for Java
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The mutual exclusion problem has been solved
Communications of the ACM
Weak ordering—a new definition
25 years of the international symposia on Computer architecture (selected papers)
A novel checkpointing scheme for distributed database systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Persistent execution state of a Java virtual machine
Proceedings of the ACM 2000 conference on Java Grande
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Partial order relations in distributed object environments
ACM SIGOPS Operating Systems Review
Checkpointing for Distributed Databases: Starting from the Basics
IEEE Transactions on Parallel and Distributed Systems
Aggressive Transmissions of Short Messages Over Redundant Paths
IEEE Transactions on Parallel and Distributed Systems
Finding Consistent Global Checkpoints in a Distributed Computation
IEEE Transactions on Parallel and Distributed Systems
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Self-Stabilizing Mutual Exclusion in the Presence of Faulty Nodes
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Arbitration-free synchronization
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Thin locks: featherweight Synchronization for Java
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Detecting global predicates in distributed systems with clocks
Distributed Computing
Causality and atomicity in distributed computations
Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
On the power of shared object types to implement one-resilient Consensus
Distributed Computing
Linearizable counting networks
Distributed Computing
Distributed Computing
Tight Bounds for Critical Sections in Processor Consistent Platforms
IEEE Transactions on Parallel and Distributed Systems
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Closure operators for order structures
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A generalisation of a relational structures model of concurrency
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
VLSI implementation of a distributed algorithm for fault-tolerant clock generation
Journal of Electrical and Computer Engineering - Special issue on Clock/Frequency Generation Circuits and Systems
On Causality Semantics of Nets with Priorities
Fundamenta Informaticae
Modeling interval order structures with partially commutative monoids
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.02 |
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.