The structure of the “THE”-multiprogramming system
Communications of the ACM
A scheduling philosophy for multiprocessing systems
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
ACM Computing Surveys (CSUR)
Synchronizing processors with memory-content-generated interrupts
Communications of the ACM
A proposal for certain process management and intercommunication primitives
ACM SIGOPS Operating Systems Review
Avoiding deadlock in distributed data bases
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Database sharing: A study of interference, roadblock and deadlock
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
A graduate course in database management
ACM SIGMOD Record
ACM SIGMIS Database
Data base system objectives as design constraints
ACM SIGMIS Database
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Data base system objectives as design constraints
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
The formulary model for flexible privacy and access controls
AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Database sharing: an efficient mechanism for supporting concurrent processes
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.24 |
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.