Thumbnail
Access Restriction
Subscribed

Author Reed, David P. ♦ Kanodia, Rajendra K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Security models ♦ Distributed systems ♦ Process synchronization ♦ Semaphores ♦ Mutual exclusion ♦ Interprocess communication
Abstract Synchronization of concurrent processes requires controlling the relative ordering of events in the processes. A new synchronization mechanism is proposed, using abstract objects called eventcounts and sequencers, that allows processes to control the ordering of events directly, rather than using mutual exclusion to protect manipulations of shared variables that control ordering of events. Direct control of ordering seems to simplify correctness arguments and also simplifies implementation in distributed systems. The mechanism is defined formally, and then several examples of its use are given. The relationship of the mechanism to protection mechanisms in the system is explained; in particular, eventcounts are shown to be applicable to situations where confinement of information matters. An implementation of eventcounts and sequencers in a system with shared memory is described.
Description Affiliation: Massachusetts Institute of Technology, Cambridge, MA (Reed, David P.; Kanodia, Rajendra K.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 2
Page Count 9
Starting Page 115
Ending Page 123


Open content in new tab

   Open content in new tab
Source: ACM Digital Library