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

Graduate Thesis Or Dissertation

Público Deposited

Baixar PDF

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/pn89d961q

Descriptions

Attribute Name	Values
Creator	Baghgandomi, Shahla Saidi
Abstract	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	Masters Thesis
Date Available	2013-08-05T21:09:18+00:00
Date Issued	1982-08-11
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1983
Advisor	Lewis, Ted G.
Academic Affiliation	Computer Science
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Computer graphics
Declaração de direitos	Copyright Not Evaluated
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
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	http://hdl.handle.net/1957/41573

Parents:

This work has no parents.

Em Collection:

Miniatura	Título	Data de carga	Acesso	Ações
	BaghgandomiShahlaS1983.pdf	2017-08-10	Público	Baixar