Deadlock avoidance: Improved algorithms for centralized and distributed systems

Persistent Link:
http://hdl.handle.net/10150/291335
Title:
Deadlock avoidance: Improved algorithms for centralized and distributed systems
Author:
Chua, Kee Koon, 1965-
Issue Date:
1992
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
A deadlock avoidance algorithm for a centralized resource allocation system is presented. Unlike the Banker's algorithm, this proposed algorithm makes use of the state of the previous safe sequence to construct a new safe sequence. The performance of this proposed algorithm is compared to that of both the Banker's algorithm and an efficient algorithm proposed by Belik. The simulation results show that our algorithm's execution time is significantly better than the Banker's algorithm and is very competitive with Belik's algorithm. In addition, our Modified Banker's Algorithm produces optimal results unlike Belik's approach which sometimes deems a safe allocation request unsafe. This centralized algorithm combined with an algorithm by Moser, is extended for use in distributed systems. Compared with Moser's algorithm, this algorithm is less restrictive in acquiring resources from other processes and allowing increase in its maximum resource requirement as confirmed by our analysis and simulation results.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Engineering, Electronics and Electrical.; Computer Science.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Electrical and Computer Engineering
Degree Grantor:
University of Arizona
Advisor:
Carothers, Jo Dale

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleDeadlock avoidance: Improved algorithms for centralized and distributed systemsen_US
dc.creatorChua, Kee Koon, 1965-en_US
dc.contributor.authorChua, Kee Koon, 1965-en_US
dc.date.issued1992en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractA deadlock avoidance algorithm for a centralized resource allocation system is presented. Unlike the Banker's algorithm, this proposed algorithm makes use of the state of the previous safe sequence to construct a new safe sequence. The performance of this proposed algorithm is compared to that of both the Banker's algorithm and an efficient algorithm proposed by Belik. The simulation results show that our algorithm's execution time is significantly better than the Banker's algorithm and is very competitive with Belik's algorithm. In addition, our Modified Banker's Algorithm produces optimal results unlike Belik's approach which sometimes deems a safe allocation request unsafe. This centralized algorithm combined with an algorithm by Moser, is extended for use in distributed systems. Compared with Moser's algorithm, this algorithm is less restrictive in acquiring resources from other processes and allowing increase in its maximum resource requirement as confirmed by our analysis and simulation results.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectEngineering, Electronics and Electrical.en_US
dc.subjectComputer Science.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorCarothers, Jo Daleen_US
dc.identifier.proquest1350833en_US
dc.identifier.bibrecord.b25529079en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.