Minimizing Garbage Size by Generating Reversible Simulations

Abstract

Reversible simulations can realize any irreversible computation on any r-Turing complete reversible computation model at the expense of additional garbage output. The problem of minimizing the garbage size is an important issue in reversible simulations. We discuss the notion of the minimal garbage size of reversible simulations. Then, we propose a three-stage reversible simulation for minimizing garbage size; the first stage generates specialized irreversible programs, the second translates them into reversible simulations, and the third performs reversible simulation using the generated reversible programs. Two case studies on sorting algorithms suggest that the proposed method generates solutions with minimal garbage size.

Designing Garbage-Free Reversible Implementations of the Integer Cosine Transform

“…The design of garbage-free reversible algorithms is a major research challenge in the area of reversible computing, as it often requires a fundamental rethinking of familiar but irreversible algorithms, regardless of whether they are to be realized in hardware or in software [Axelsen et al 2007;Yokoyama et al 2008Yokoyama et al , 2012.…”