ACM Computing Surveys (CSUR)
Comments on prevention of system deadlocks
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
Flow control in a resource-sharing computer network
Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems
DEADLOCK-FREE SHARING OF RESOURCES IN ASYNCHRONOUS SYSTEMS
DEADLOCK-FREE SHARING OF RESOURCES IN ASYNCHRONOUS SYSTEMS
On deadlock in computer systems
On deadlock in computer systems
A model for deadlock-free resource allocation
A model for deadlock-free resource allocation
Bus communications systems.
| Hi-index | 0.00 |
The importance of computer networking to achieve resource sharing and data sharing is widely recognized. Local networking to achieve high performance and reliability is inevitable for the future. As cost of logic and memory decreases, the cost of communications resources become increasingly significant and these resources must be increasingly shared. This heightens the possibility of deadlocks due to this sharing. Deadlocks in the ARPA network are examples of this type of deadlock. Deadlock problems due to sharing of the resources allocated by operating systems have been extensively studied. Deadlock problems in computer networks require significantly different approaches due to the distributed control of the network. This paper studies the deadlock problem in this new context; as an example, a simple solution to the ARPA network store-and-forward lockup problem is given.