Synchronization in a parallel-accessed data base
- 1 November 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (11) , 604-607
- https://doi.org/10.1145/363269.363277
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.Keywords
This publication has 3 references indexed in Scilit:
- A scheduling philosophy for multiprocessing systemsCommunications of the ACM, 1968
- The structure of the “THE”-multiprogramming systemCommunications of the ACM, 1968
- Programming semantics for multiprogrammed computationsCommunications of the ACM, 1966