The Community for Technology Leaders
2013 International Conference on Computing, Networking and Communications (ICNC) (2012)
Okinawa, Japan Japan
Dec. 5, 2012 to Dec. 7, 2012
ISBN: 978-1-4673-4624-5
pp: 379-387
R. Gluck , Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
H.B. Axelsen , Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
T. Yokoyama , Dept. of Software Eng., Nanzan Univ., Seto, Japan
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.
INDEX TERMS
Computational modeling, Sorting, Syntactics, Semantics, Encoding
CITATION
R. Gluck, H.B. Axelsen, T. Yokoyama, "Minimizing garbage size by generating reversible simulations", 2013 International Conference on Computing, Networking and Communications (ICNC), vol. 00, no. , pp. 379-387, 2012, doi:10.1109/ICNC.2012.73
82 ms
(Ver 3.3 (11022016))