An extended banker's algorithm for deadlock avoidance

IEEE Transactions on Software Engineering

Volumn 25, Issue 3, 1999, Pages 428-432

  Lang, Sheau Dong ^a  

^a University of Central Florida   (United States)

Author keywords

Banker's algorithm; Deadlock; Deadlock avoidance; Graph reduction; Operating system; Worst case complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; GRAPH THEORY;

BANKER'S ALGORITHM;

COMPUTER SYSTEM RECOVERY;

EID: 0032594210     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.798330     Document Type: Article

References (7)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysi of Computer Algorithms. Reading, Mass.: Addison-Wesley, 1974.
2. E.W. DijkstraCooperating Sequential Processes Programmin Languages, E Genuys, éd., pp. 103-110, New York: Academic Press 1968.
3. R. Finkel and H.H. MadduriAn Efficient Deadlock Avoidanc Algorithm Information Processing Letters, vol. 24, no. 1, pp. 25-30 Jan. 1987.
4. A.N. HabermannPrevention of System Deadlocks Comm ACM, vol. 12, no. 7, pp. 373-377, 385, July 1969.
5. A.N. Habermann, Introduction to Operating System Design. Chicago Science Research Assoc, Inc., 1976.
6. R.C. HoltSome Deadlock Properties of Computer Systems, ACM Computing Surveys, vol. 4, no. 3, pp. 179-196, Sept. 1972.
7. T. MinouraDeadlock Avoidance Revisited J. ACM, vol. 29, no. 4 pp. 1,023-1,048, Oct. 1982.