A resource-allocation scheme for multi-user on-line operation of a small computer

Reiter, Allen

doi:10.1145/1465482.1465484

Cited by 5 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other approaches to this problem are discussed in the report by Collier [5], and in the papers by lIleiter [6], Murphy [7], and ~.Ierikallio and Holland [8].…”

Section: Prevention Of Deadlockmentioning

confidence: 99%

System Deadlocks

Coffman

Elphick

Shoshani³

1971

ACM Comput. Surv.

675

244

View full text Add to dashboard Cite

show abstract

“…Other approaches to this problem are discussed in the report by Collier [5], and in the papers by lIleiter [6], Murphy [7], and ~.Ierikallio and Holland [8].…”

Section: Prevention Of Deadlockmentioning

confidence: 99%

System Deadlocks

Coffman

Elphick

Shoshani³

1971

ACM Comput. Surv.

675

244

View full text Add to dashboard Cite

show abstract

“…The matrix C = [C(i, j)], whose (i, j) element is C(i, j), is called the claim matrix. If E C(i,j) _< 6 (1) ~EN is satisfied for allj E M, then there will always be enough free (i.e., nonallocated) units to grant any request immediately, and therefore the system is free from deadlock [22]. The state of a gwen system is defined by a pair of n x m matrices (A, R), where A = [A (t, j)] is called the allocation matrtx and R = JR(i, j)] the request matrix.…”

Section: Modelmentioning

confidence: 99%

Testing Deadlock-Freedom of Computer Systems

Kameda

1980

J. ACM

View full text Add to dashboard Cite

The problem of determining whether it is possible for a set of "free-running" processes to become deadlocked is considered. It is assumed that any request by a process is immediately granted as long as there are enough free resource umts to satisfy the request The questton of whether or not there exists a polynomml algorithm for predicting deadlock in a "claim-limited" serially reusable resource system has been open. An algorithm employing a network flow technique is presented for this purpose. Its running time is bounded by O(mn 15) if the system consists of n processes sharing m types of serially reusable resources. K~Y WORDS AND PHRASES:deadlock, serially reusable resource, resour~ allocation, process, deadlock algorithm, operating system, efficient algorithm, network flow, bipartite matching, degree-constrained matchmg, algorithm complexity CR CATEGORIES. 4.32, 4 35, 5.25, 5.32

show abstract

A polynomial-time test for the deadlock-freedom of computer systems

Kameda¹

1977

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A resource-allocation scheme for multi-user on-line operation of a small computer

Cited by 5 publications

References 2 publications

System Deadlocks

System Deadlocks

Testing Deadlock-Freedom of Computer Systems

A polynomial-time test for the deadlock-freedom of computer systems

Contact Info

Product

Resources

About