Formal verification and empirical analysis of rollback relaxation

Umamageswaran, Kothanda; Subramani, Krishnan; Wilsey, Philip A.; Alexander, Perry

doi:10.1016/s1383-7621(97)80167-1

Cited by 5 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rollback relaxation [48] is an optimization for Time Warp simulators that reduces the cost of state savings and can potentially reduce rollback costs. Two important problems with Time Warp optimistic simulation are the impact of state savings and rollback costs.…”

Section: Rollback Relaxationmentioning

confidence: 99%

Analysis and Simulation of Mixed-Technology VLSI Systems

Martin

Radhakrishnan

Rao

et al. 2002

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

Section: Rollback Relaxationmentioning

confidence: 99%

Analysis and Simulation of Mixed-Technology VLSI Systems

Martin

Radhakrishnan

Rao

et al. 2002

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…Our work starts where Gomes [1996] ends, and is concerned with techniques for minimizing the state size for realizing reversibility, and simultaneously minimizing the runtime execution overheads. Finally, in Umamageswaran et al [1998], a rollback relaxation scheme is presented that automatically identifies certain types of history-independent logical processes, and optimizes the performance of rollback activity for those processes. Our approach is different in that it addresses logical processes which are not necessarily stateless, and seeks to optimize run-time performance and memory utilization by minimizing the essential state required by such processes.…”

Section: Related Workmentioning

confidence: 99%

Efficient optimistic parallel simulations using reverse computation

Carothers

Perumalla

Fujimoto

1999

ACM Trans. Model. Comput. Simul.

175

View full text Add to dashboard Cite

In optimistic parallel simulations, state-saving techniques have traditionally been used to realize rollback. In this article, we propose reverse computation as an alternative approach, and compare its execution performance against that of state-saving. Using compiler techniques, we describe an approach to automatically generate reversible computations, and to optimize them to reap the performance benefits of reverse computation transparently. For certain fine-grain models, such as queuing network models, we show that reverse computation can yield significant improvement in execution speed coupled with significant reduction in memory utilization, as compared to traditional state-saving. On sample models using reverse computation, we observe as much as a six-fold improvement in execution speed over traditional state-saving.

show abstract

“…Our work starts where [7] ends and is concerned with techniques for minimizing the state size for realizing reversibility, and simultaneously minimizing the runtime execution overheads. Finally, in [16], a rollback relaxation scheme is presented that automatically identifies certain types of history-independent logical processes and optimizes the performance of rollback activity for those processes. Our approach is different in that it addresses logical processes which are not necessarily stateless, and seeks to optimize runtime performance and memory utilization by minimizing the essential state required by such processes.…”

Section: Related Workmentioning

confidence: 99%

Efficient optimistic parallel simulations using reverse computation

Carothers¹,

Perumalla²,

Fujimoto³

Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155)

134

View full text Add to dashboard Cite

In optimistic parallel simulations, state-saving techniques have been traditionally used to realize rollback. In this article, we propose reverse computation as an alternative approach, and compare its execution performance against that of state-saving. Using compiler techniques, we describe an approach to automatically generate reversible computations, and to optimize them to transparently reap the performance benefits of reverse computation. For certain fine-grain models, such as queuing network models, we show that reverse computation can yield significant improvement in execution speed coupled with significant reduction in memory utilization, as compared to traditional state-saving. On sample models using reverse computation, we observe as much as three-fold improvement in execution speed over traditional state-saving.

show abstract

Formal verification and empirical analysis of rollback relaxation

Cited by 5 publications

References 5 publications

Analysis and Simulation of Mixed-Technology VLSI Systems

Analysis and Simulation of Mixed-Technology VLSI Systems

Efficient optimistic parallel simulations using reverse computation

Efficient optimistic parallel simulations using reverse computation

Contact Info

Product

Resources

About