Performance analysis of automatic lookahead generation by control flow graph: Some experiments

DOI10.1016/S0928-4869(01)00031-3MaRDI QIDQ2744882zbMATH OpenFDO

Authors Behrouz Zarei, Mike Pidd

Publication date 19 November 2001

Published in Simulation Practice and Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0928-4869(01)00031-3

zbMATH Keywords

automatic lookahead generationcontrol flow graphlookaheadparallel simulationperformance analysisqueueing network

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Recommendations

• Parallelism in sequential multiprocessor simulation models
• A performance and scalability analysis framework for parallel discrete event simulators
• The cost of conservative synchronization in parallel discrete event simulations
• Local versus global lookahead in conservative parallel simulations
• Performance bounds on parallel self-initiating discrete-event simulations

This page was built for publication: Performance analysis of automatic lookahead generation by control flow graph: Some experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744882)