Thumbnail
Access Restriction
Subscribed

Author Lamport, Leslie
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Readers/writers problem ♦ Multiprocess synchronization ♦ Asynchronous multiprocessing ♦ Shared data
Abstract The problem of sharing data among asynchronous processes is considered. It is assumed that only one process at a time can modify the data, but concurrent reading and writing is permitted. Two general theorems are proved, and some algorithms are presented to illustrate their use. These include a solution to the general problem in which a read is repeated if it might have obtained an incorrect result, and two techniques for transmitting messages between processes. These solutions do not assume any synchronizing mechanism other than data which can be written by one process and read by other processes.
Description Affiliation: Massachusetts Computer Associates, Wakefield (Lamport, Leslie)
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 20
Issue Number 11
Page Count 6
Starting Page 806
Ending Page 811


Open content in new tab

   Open content in new tab
Source: ACM Digital Library