Thumbnail
Access Restriction
Subscribed

Author Bernstein, A. J. ♦ Shoshani, A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Deadlock ♦ File search ♦ Parallel accessing ♦ Parallel search ♦ Synchronization ♦ Data base ♦ Locking
Abstract The following problem is considered: Given a data base which can be manipulated simultaneously by more than one process, what are the rules for synchronization which will maximize the amount of parallel activity allowed. It is assumed that the data base can be represented as a graph. An example of such a data base is a hierarchy of directories for an on-line file system. Methods for synchronization of processes are examined; their validity is discussed and their performance compared.
Description Affiliation: Princeton Univ., Princeton, NJ (Shoshani, A.) || General Electric Co., Schenectady, NY (Bernstein, A. J.)
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 12
Issue Number 11
Page Count 4
Starting Page 604
Ending Page 607


Open content in new tab

   Open content in new tab
Source: ACM Digital Library