Geometric Performance Analysis of Mutual Exclusion: The Model

Simple item page
dc.contributor.authorAbrams, Marcen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:07Zen
dc.date.available2013-06-19T14:37:07Zen
dc.date.issued1990en
dc.description.abstractThis paper is motivated by the need to better understand parallel program run-time behavior. The paper first formally describes a general model of program execution based on Djkstra's progress graphs. The paper then defines a special case of the model representing two cyclic processes sharing mutually exclusive, reusable resources. Processes synchronize through semaphore operations that are not embedded in conditionally executed code segments. Model parameters are the times at which each semaphore operation completes and the independently derived, constant execution time required by each process between points of completion of semaphore operations.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000240/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000240/01/TR-90-58.pdfen
dc.identifier.trnumberTR-90-58en
dc.identifier.urihttp://hdl.handle.net/10919/19647en
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 Modelen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-90-58.pdf
Size:
1.88 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports