Show simple item record

dc.contributor.authorAbrams, Marcen_US
dc.date.accessioned2013-06-19T14:36:59Z
dc.date.available2013-06-19T14:36:59Z
dc.date.issued1993-09-01
dc.identifierhttp://eprints.cs.vt.edu/archive/00000372/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19775
dc.description.abstractCertain parallel software performance evaluation problems are equivalent to computational geometric problems. Consider a timed transition system representing a parallel program: a set of variables, a set of states, an initial state, a transition function mapping a set to a set of successor states, and a description of the time between transitions. Given a timed transition system, the paper solves four problems: (1) state the necessary and sufficient conditions for a TES to contain a LCES; (2) given the initial starting time of each process, find a representation of the set of all possible TESs; (3) determine if any initial process starting times exist that lead to a LCES in which no process ever blocks; and (4) find the set of all possible LCESs.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.titleComputational Geometric Performance Analysis of Limit Cycles in Timed Transition Systemsen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-93-30en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000372/01/TR-93-30.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record