2012 Third International Conference on Networking and Computing (2012)
Okinawa, Japan Japan
Dec. 5, 2012 to Dec. 7, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNC.2012.73
T. Yokoyama , Dept. of Software Eng., Nanzan Univ., Seto, Japan
H.B. Axelsen , Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
R. Gluck , Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
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.
Computational modeling, Sorting, Syntactics, Semantics, Encoding
R. Gluck, H. Axelsen and T. Yokoyama, "Minimizing garbage size by generating reversible simulations," 2012 Third International Conference on Networking and Computing(ICNC), Okinawa, Japan Japan, 2012, pp. 379-387.