Title :
Breadth-first rollback in spatially explicit simulations
Author :
Deelman, Ewa ; Szymanski, Boleslaw K.
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
The efficiency of parallel discrete event simulations that use the optimistic protocol is strongly dependent on the overhead incurred by rollbacks. The paper introduces a novel approach to rollback processing which limits the number of events rolled back as a result of a straggler or antimessage. The method, called breadth-first rollback (BFR), is suitable for spatially explicit problems where the space is discretized and distributed among processes and simulation objects move freely in the space. BFR uses incremental state saving, allowing the recovery of causal relationships between events during rollback. These relationships are then used to determine which events need to be rolled back. The results demonstrate an almost linear speedup-a dramatic improvement over the traditional approach to rollback processing
Keywords :
discrete event simulation; parallel processing; protocols; system recovery; antimessage; breadth-first rollback; causal relationship recovery; incremental state saving; optimistic protocol; parallel discrete event simulations; rollback overhead; rollback processing; simulation objects; spatially explicit simulations; speedup; straggler; Computational modeling; Computer errors; Computer science; Computer simulation; Constraint optimization; Discrete event simulation; Lattices; Mice; Object oriented modeling; Protocols;
Conference_Titel :
Parallel and Distributed Simulation, 1997., Proceedings., 11th Workshop on
Conference_Location :
Lockenhaus
Print_ISBN :
0-8186-7964-6
DOI :
10.1109/PADS.1997.594595