Performance evaluation of N-processor Time Warp using stochastic activity networks

Persistent Link:
http://hdl.handle.net/10150/278314
Title:
Performance evaluation of N-processor Time Warp using stochastic activity networks
Author:
McLeod, Bruce Daniel, 1968-
Issue Date:
1993
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
The speedup obtainable with Time Warp parallel discrete-event simulation varies greatly with the characteristics of the simulation and the Time Warp implementation. Analytic studies have been done to determine the expected speedup of Time Warp, but these studies have been limited to bound analysis or analysis considering a few overheads with the others assumed negligible. The models used in these studies have often been constructed directly in terms of a Markov process, making the construction process difficult. This thesis uses stochastic activity networks to construct a model of Time Warp at a higher level, enabling the construction of a more detailed underlying Markov process. The result is an analytic model for N-processor Time Warp that considers the combined effects of limited optimism, cascaded rollback, communication cost, and rollback cost. Given these effects, solutions for performance variables such as speedup, fraction of time blocked, and channel utilization are obtained.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Engineering, Electronics and Electrical.; Computer Science.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College
Degree Grantor:
University of Arizona
Advisor:
Sanders, William H.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titlePerformance evaluation of N-processor Time Warp using stochastic activity networksen_US
dc.creatorMcLeod, Bruce Daniel, 1968-en_US
dc.contributor.authorMcLeod, Bruce Daniel, 1968-en_US
dc.date.issued1993en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThe speedup obtainable with Time Warp parallel discrete-event simulation varies greatly with the characteristics of the simulation and the Time Warp implementation. Analytic studies have been done to determine the expected speedup of Time Warp, but these studies have been limited to bound analysis or analysis considering a few overheads with the others assumed negligible. The models used in these studies have often been constructed directly in terms of a Markov process, making the construction process difficult. This thesis uses stochastic activity networks to construct a model of Time Warp at a higher level, enabling the construction of a more detailed underlying Markov process. The result is an analytic model for N-processor Time Warp that considers the combined effects of limited optimism, cascaded rollback, communication cost, and rollback cost. Given these effects, solutions for performance variables such as speedup, fraction of time blocked, and channel utilization are obtained.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectEngineering, Electronics and Electrical.en_US
dc.subjectComputer Science.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorSanders, William H.en_US
dc.identifier.proquest1352385en_US
dc.identifier.bibrecord.b27056156en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.