Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort

Early, Diarmuid; Gao, Ang; Schellekens, Michel

doi:10.1007/978-3-642-36315-3_7

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, for some particular reversible algorithms, we can obtain the tight asymptotic upper bound of the garbage size. An optimal reversible insertion sort for a reversible ISA was introduced [15] and an optimal reversible quicksort was constructed and analyzed in the ℳ language [7].…”

Section: Related Workmentioning

confidence: 99%

“…1 The garbage size minimization problem aims at minimizing the size of garbage of reversible simulation ′ for given . The optimization problem has been studied for a few decades [5], [6], [7] and has been recently intensively studied in reversible logic design [8, Chapter 6.2], [9], [10]. There exist general reversible simulations such as Landauer's simulation [5], Bennett's simulation [3] and its extension [6].…”

Section: Introduction -An Outlinementioning

confidence: 99%

See 1 more Smart Citation

Minimizing Garbage Size by Generating Reversible Simulations

Yokoyama

Axelsen

Glück

2012

2012 Third International Conference on Networking and Computing

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%