Show simple item record

dc.contributor.authorAbrams, Marcen_US
dc.contributor.authorAgrawala, Ashoken_US
dc.date.accessioned2013-06-19T14:36:19Z
dc.date.available2013-06-19T14:36:19Z
dc.date.issued1990
dc.identifierhttp://eprints.cs.vt.edu/archive/00000241/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19655
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_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleGeometric Performance Analysis of Mutual Exclusion: The Model Solutionen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-90-59en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000241/01/TR-90-59.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record