Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS

Frank, Michael P.; Brocato, Robert Wesley; Tierney, Brian David; Missert, Nancy A.; Hsia, Alexander H.

doi:10.1109/icrc2020.2020.00014

Cited by 18 publications

(38 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be an appropriate model for certain types of subsystems in a computer-for example, a periodic clock signal, such as a resonant clock-power oscillator for an adiabatic circuit (see §2.3). Further, every digital data signal in a typical reversible logic technology (e.g., [30]) cycles from a standard "neutral" or no-information state to an information-bearing state, and then back to neutral; thus, every node in a typical reversible circuit effectively acts like a catalyst. (This will be discussed in more detail in §3.…”

Section: Catalytic Thermal Operations and Correlated Systemsmentioning

confidence: 99%

“…This assumes that the relaxation occurs on a timescale much faster than the timescale involved in the dynamics of the asymptotic state(s). 30 Thus, implicit in this expression is the notion that t is a parameter that only sees timescales on the order of the relaxation timescale. In other words, the GKSL dynamics is entirely before the dynamics of the asymptotic states, and the limit as t → ∞ is then still before the asymptotic state dynamics.…”

Section: Gksl Dynamics With Multiple Asymptotic Statesmentioning

confidence: 99%

“…Finally, we note that the notation Op(H) is sometimes used for B(H S ), e.g., as in [17][18][19]. 30 In fact, the GKSL equation involves three timescales, not just these two: the Markov assumption also involves an assumption about fluctuations between S and E, corresponding to a statement about the timescale of these fluctuations. This is discussed in more detail in §4.3.…”

Section: Gksl Dynamics With Multiple Asymptotic Statesmentioning

confidence: 99%

“…This class of implementation technologies for reversible computing refers to a logic design discipline based on ordinary CMOS (complementary metal-oxide-semiconductor) field-effect transistors [30,[63][64][65][66][67][68]. To approach physical reversibility in these types of circuits requires several conditions to be met (see Appendix A for some key derivations):…”

Section: Reversible Adiabatic Cmosmentioning

confidence: 99%

“…If either of these rules is ever broken in the design, this can lead to substantial nonadiabatic dissipation, and the physical computational process as a whole no longer qualifies as being asymptotically physically reversible. This is discussed further in [30,65,70].…”

mentioning

confidence: 92%

See 4 more Smart Citations

Quantum Foundations of Classical Reversible Computing

Frank¹,

Shukla²

2021

Preprint

View full text Add to dashboard Cite

The reversible computation paradigm aims to provide a new foundation for general classical digital computing that is capable of circumventing the thermodynamic limits to the energy efficiency of the conventional, non-reversible paradigm. However, to date, the essential rationale for and analysis of classical reversible computing (RC) has not yet been expressed in terms that leverage the modern formal methods of non-equilibrium quantum thermodynamics (NEQT). In this paper, we begin developing an NEQT-based foundation for the physics of reversible computing. We use the framework of Gorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a. Lindbladians) with multiple asymptotic states, incorporating recent results from resource theory, full counting statistics, and stochastic thermodynamics. Important conclusions include that, as expected: (1) Landauer's Principle indeed sets a strict lower bound on entropy generation in traditional non-reversible architectures for deterministic computing machines when we account for the loss of correlations; and (2) implementations of the alternative reversible computation paradigm can potentially avoid such losses, and thereby circumvent the Landauer limit, potentially allowing the efficiency of future digital computing technologies to continue improving indefinitely. We also outline a research plan for identifying the fundamental minimum energy dissipation of reversible computing machines as a function of speed.

show abstract

Section: Catalytic Thermal Operations and Correlated Systemsmentioning

confidence: 99%

Section: Gksl Dynamics With Multiple Asymptotic Statesmentioning

confidence: 99%

Section: Gksl Dynamics With Multiple Asymptotic Statesmentioning

confidence: 99%

Section: Reversible Adiabatic Cmosmentioning

confidence: 99%

mentioning

confidence: 92%

See 3 more Smart Citations

Quantum Foundations of Classical Reversible Computing

Frank¹,

Shukla²

2021

Preprint

View full text Add to dashboard Cite

show abstract

Explicit Identifiers and Contexts in Reversible Concurrent Calculus

Aubert

Medić

2021

Reversible Computation

View full text Add to dashboard Cite

Existing formalisms for the algebraic specification and representation of networks of reversible agents suffer some shortcomings. Despite multiple attempts, reversible declensions of the Calculus of Communicating Systems (CCS) do not offer satisfactory adaptation of notions usual in "forward-only" process algebras, such as replication or context. Existing formalisms disallow the "hot-plugging" of processes during their execution in contexts with their own past. They also assume the existence of "eternally fresh" keys or identifiers that, if implemented poorly, could result in unnecessary bottlenecks and look-ups involving all the threads. In this paper, we begin investigating those issues, by first designing a process algebra endowed with a mechanism to generate identifiers without the need to consult with the other threads. We use this calculus to recast the possible representations of non-determinism in CCS, and as a byproduct establish a simple and straightforward definition of concurrency. Our reversible calculus is then proven to satisfy expected properties. We also observe that none of the reversible bisimulations defined thus far are congruences under our notion of "reversible" contexts.

show abstract

Adiabatic reversible computing

Gloukhovtsev

2024

Making IT Sustainable

View full text Add to dashboard Cite

Reversible Computing with Fast, Fully Static, Fully Adiabatic CMOS

Cited by 18 publications

References 9 publications

Quantum Foundations of Classical Reversible Computing

Quantum Foundations of Classical Reversible Computing

Explicit Identifiers and Contexts in Reversible Concurrent Calculus

Adiabatic reversible computing

Contact Info

Product

Resources

About