Geometric Performance Analysis of Mutual Exclusion: The Model Solution

Simple item page
dc.contributor.authorAbrams, Marcen
dc.contributor.authorAgrawala, Ashoken
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:19Zen
dc.date.available2013-06-19T14:36:19Zen
dc.date.issued1990en
dc.description.abstractThis paper presents an analytic solution to progress graphs used for performance analysis. It derives the exact sequence of blocking and running times experienced by two processes sharing mutually exclusive, reusable resources. A novel application of Dijkstra's progress graphs yields the complex relationship between the waiting times at each synchronization point. The problem of solving progress graphs is formulated in terms of finding the minimum solution of each of a set of Diophantine equations. An algorithm is presented to find all steady state behaviors involving blocking that emerge from any initial condition.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000241/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000241/01/TR-90-59.pdfen
dc.identifier.trnumberTR-90-59en
dc.identifier.urihttp://hdl.handle.net/10919/19655en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleGeometric Performance Analysis of Mutual Exclusion: The Model Solutionen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-90-59.pdf
Size:
976.72 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports