Analysis of Future Event Set Algorithms for Discrete Event Simulation

Simple item page
dc.contributor.authorMcCormack, William M.en
dc.contributor.authorSargent, Robert G.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:29Zen
dc.date.available2013-06-19T14:36:29Zen
dc.date.issued1980en
dc.description.abstractThis work reports on new analytical and empirical results on the performance of algorithms for handling the future event set in discrete event simulation. These results provide a clear insight to the factors affecting algorithm performance; evaluate the "hold" model, often used to study future event set algorithms; and determine the best algorithm(s) to use.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000845/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000845/01/CS80002-R.pdfen
dc.identifier.trnumberCS80002-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20345en
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.titleAnalysis of Future Event Set Algorithms for Discrete Event Simulationen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS80002-R.pdf
Size:
1.8 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports