NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A graph model for deadlock prevention
| dc.contributor.advisor | Pooch, Udo W. | |
| dc.creator | Tanik, Murat Mehmet | |
| dc.date.accessioned | 2020-08-21T22:46:43Z | |
| dc.date.available | 2020-08-21T22:46:43Z | |
| dc.date.issued | 1978 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-199073 | |
| dc.description | Vita. | en |
| dc.description.abstract | A deadlock prevention model is developed. In the process, a relationship between two seemingly unrelated problems and their relevance to deadlock prevention problem is demonstrated. These problems are Dijkstra's n-philosophers synchronization problem and n-queens problem. A program is developed in which the generation of deadlock free paths is possible. Several synchronization models are compared and their relationship to deadlock prevention problem is shown. A graphic representation of task systems model is developed which makes the identification of the relationship between task systems model and vector addition systems more transparent. | en |
| dc.format.extent | xv, 163 leaves | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject | Computing Science | en |
| dc.subject.classification | 1978 Dissertation T164 | |
| dc.subject.lcsh | Operating systems (Computers) | en |
| dc.subject.lcsh | Graphic methods | en |
| dc.subject.lcsh | Computer programs | en |
| dc.title | A graph model for deadlock prevention | en |
| dc.type | Thesis | en |
| thesis.degree.grantor | Texas A&M University | en |
| thesis.degree.name | Doctor of Philosophy | en |
| dc.type.genre | dissertations | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
| dc.publisher.digital | Texas A&M University. Libraries | |
| dc.identifier.oclc | 5543689 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.