Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Automatic Mutual Exclusion and Atomicity Checks

Summary: Automatic Mutual Exclusion
and Atomicity Checks
Mart´in Abadi1,2
Microsoft Research
University of California, Santa Cruz
Abstract. This paper provides an introduction to the Automatic Mu-
tual Exclusion (AME) programming model and to its formal study,
through the AME calculus. AME resembles cooperative multithreading;
in the intended implementations, however, software transactional mem-
ory supports the concurrent execution of atomic fragments. This paper
also studies simple dynamic and static mechanisms for atomicity checks
in AME.
1 Introduction
Transactions promise a practical mechanism for synchronization that should
facilitate the design and coding of a wide range of concurrent systems. In partic-
ular, in shared-memory concurrency, systems based on transactions may achieve
the efficiency of fine-grained locking while reducing the opportunities for dead-
locks, race conditions, and other bugs. For these benefits to be realized, however,


Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz


Collections: Computer Technologies and Information Sciences