论文信息 - Avoiding deadlock in distributed data bases

Avoiding deadlock in distributed data bases

Deadlock prevention mechanisms and a deadlock protection mechanism for distributed data base systems are presented. The notion of process sets used in preventing deadlock is introduced. Examples are given to illustrate these methods for avoiding file deadlock in computer networks.

W. W. Chu | G. Ohlmacher

[1] Richard C. Holt,et al. Some Deadlock Properties of Computer Systems , 1972, CSUR.

[2] Arthur J. Collmeyer. Datebase Management in a Multi-Access Environment , 1971, Computer.

[3] Richard C. Holt,et al. Some deadlock properties of computer systems , 1971, SOSP '71.

[4] Wesley W. Chu,et al. Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[5] Jack E. Shemer,et al. Database sharing: A study of interference, roadblock and deadlock , 1972, SIGFIDET '72.

[6] 花田収悦,et al. Optimal File Allocation in a Multiple Computer System , 1970 .

[7] Arie Shoshani,et al. System Deadlocks , 1971, CSUR.

[8] Arie Shoshani,et al. Synchronization in a parallel-accessed data base , 1969, CACM.

[9] Paul F. King,et al. Database sharing: an efficient mechanism for supporting concurrent processes , 1973, AFIPS National Computer Conference.

[10] A. Nico Habermann,et al. Prevention of system deadlocks , 1969, CACM.

[11] James E. Murphy. Resource allocation with interlock detection in a multi-task system , 1968, AFIPS '68 (Fall, part II).

[12] James W. Havender. Avoiding Deadlock in Multitasking Systems , 1968, IBM Syst. J..