|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Havender, J. W. "Avoiding Deadlock in Multitasking Systems," IBM Systems Journal, 7(2)74-84, 1968.
|
| |
2
|
Murphy, J. E. "Resource Allocation with Interlock Detection in a Multi-Task System," Proceedings of the 1968 Fall Joint Computer Conference, pp. 1169-1176.
|
 |
3
|
|
 |
4
|
|
 |
5
|
|
| |
6
|
Collmeyer, Arthur J. "Database Management in a Multi-Access Environment," Computer, 4(6):36-46, November/December 1971.
|
 |
7
|
|
 |
8
|
|
| |
9
|
King, P. F. and A. J. Collmeyer. "Database Sharing - An Efficient Mechanism for Supporting Concurrent Processes," Proceedings of the 1973 National Computer Conference and Exposition, June 1973, Vol. 42, pp. 271 - J275.
|
| |
10
|
Chu. W. W. "Optimal File Allocation in a Multiple Computer System," IEEE Transactions on Computers, C-18(10):885-889, October 1969.
|
|