Probability of deadlock in a system of processes and resources for shared and exclusive access Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/pn89d961q

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • A process-resource graph is a directed graph with m resource nodes and n process nodes. A request edge is directed from a process to a resource. An assignment edge is directed from a resource to a process. A cycle in the process-resource graph is a necessary and sufficient condition for a deadlock to exist. This paper presents a method to find the probability of deadlock for shared access (read only) and exclusive access (read/write). Two formulae are given, one to count the total number of graphs, and another to count the total number of graphs which have at least one cycle. The probability of deadlock is then calculated by dividing the total number of graphs into the number of graphs with cycle.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-08-05T21:09:18Z (GMT) No. of bitstreams: 1 BaghgandomiShahlaS1983.pdf: 686761 bytes, checksum: ae4dba64ec0338540cb9283b5620a12a (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-08-01T18:47:23Z (GMT) No. of bitstreams: 1 BaghgandomiShahlaS1983.pdf: 686761 bytes, checksum: ae4dba64ec0338540cb9283b5620a12a (MD5)
  • description.provenance : Made available in DSpace on 2013-08-05T21:09:18Z (GMT). No. of bitstreams: 1 BaghgandomiShahlaS1983.pdf: 686761 bytes, checksum: ae4dba64ec0338540cb9283b5620a12a (MD5) Previous issue date: 1982-08-11
  • description.provenance : Submitted by Katy Davis (kdscannerosu@gmail.com) on 2013-08-01T18:18:43Z No. of bitstreams: 1 BaghgandomiShahlaS1983.pdf: 686761 bytes, checksum: ae4dba64ec0338540cb9283b5620a12a (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items