Results 1  10
of
11
Introduction to reversible computing: motivation, progress, and challenges
 Proceedings of the 2nd Conference on Computing Frontiers, 2005
"... ..."
(Show Context)
The physical limits of computing
 Computing in Science and Engg
, 2002
"... Many of the fundamental limits on information processing from thermodynamics, relativity, and quantum mechanics are only a few decades away. Novel physically motivated computing paradigms such as reversible computing and quantum computing may help in certain ways, but even they remain subject to som ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Many of the fundamental limits on information processing from thermodynamics, relativity, and quantum mechanics are only a few decades away. Novel physically motivated computing paradigms such as reversible computing and quantum computing may help in certain ways, but even they remain subject to some basic limits.
Relativized Separation of Reversible and Irreversible SpaceTime Complexity Classes
, 2001
"... Within 35 years, the trend of exponentially decreasing bit energies that has been maintained throughout the 20th century must come to a halt due to fundmantal thermodynamic limits, if nothing else. If the trend of decreasing bitdevice cost continues longer, while the cost of energy and cooling tech ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Within 35 years, the trend of exponentially decreasing bit energies that has been maintained throughout the 20th century must come to a halt due to fundmantal thermodynamic limits, if nothing else. If the trend of decreasing bitdevice cost continues longer, while the cost of energy and cooling technologies remains high, the overall cost of computation will become overwhelmingly dominated by energy costs rather than circuit costs, unless bitenergies can be recycled. Reversible circuits offer a means to trade off energy cost for increased space and time complexity, and thereby minimizing total cost in such energydominated scenarios. The question of how much this approach can benefit future computing depends critically on the relative complexity of reversible and irreversible algorithms. Timecomplexity and spacecomplexity classes for reversible machines have been shown to be equivalent to their conventional analogs, but we conjecture that the joint spacetime complexity cla...
To be published in the IEEE Computing in Science & Engineering magazine, May/June 2002. Draft of Mar. 6. Version before cuts. 10,200 words. Physical Limits of Computing
, 2002
"... and longstanding relation. Scientific and engineering problems tend to place some of the most demanding requirements on computational power, thereby driving the engineering of new bitdevice technologies and circuit architectures, as well as the scientific & mathematical study of better algorit ..."
Abstract
 Add to MetaCart
and longstanding relation. Scientific and engineering problems tend to place some of the most demanding requirements on computational power, thereby driving the engineering of new bitdevice technologies and circuit architectures, as well as the scientific & mathematical study of better algorithms and more sophisticated computing theory. The need for finitedifference artillery ballistics simulations during World War II motivated the ENIAC, and massive calculations in every area of science & engineering motivate the PetaFLOPSscale * supercomputers on today’s drawing boards (cf. IBM’s Blue Gene [1]). Meanwhile, computational methods themselves help us to build more efficient computing systems. Computational modeling and simulation of manufacturing processes, logic device physics, circuits, CPU architectures, communications networks, and distributed systems all further the advancement of computing technology, together achieving everhigher densities of useful computational work that can be performed using a given quantity of time, material, space, energy, and cost. Furthermore, the longterm economic growth enabled by scientific & engineering advances across many fields helps
The Technology Lane on the Road to a Zettaflops
 SUBMISSION TO SC’06
, 2006
"... Given that viable petaflopslevel machines are now within sight, the time has come to begin considering how we can reach the next performance milestones. This work spells out the upper limits of performance that currently understood technology might achieve. Our “design target ” is a zettaflops or ..."
Abstract
 Add to MetaCart
Given that viable petaflopslevel machines are now within sight, the time has come to begin considering how we can reach the next performance milestones. This work spells out the upper limits of performance that currently understood technology might achieve. Our “design target ” is a zettaflops or 10 1.
EFFICIENT LARGESCALE COMPUTER AND NETWORK MODELS USING OPTIMISTIC PARALLEL SIMULATION Examining Committee: By
, 2005
"... ..."
(Show Context)
Document Type: Preliminary Proposal Title: Adiabatic Logic for HighBandwidth Networking Equipment: A Proposed Feasibility Study Sponsoring organization: Nortel Networks
"... Due to the approach of various fundamental limiting factors to logic technology scaling, future generations of digital semiconductor technology are anticipated to eventually offer greater potential improvements in raw performance per unit circuit size (and cost) than in performance per unit power, m ..."
Abstract
 Add to MetaCart
Due to the approach of various fundamental limiting factors to logic technology scaling, future generations of digital semiconductor technology are anticipated to eventually offer greater potential improvements in raw performance per unit circuit size (and cost) than in performance per unit power, meaning that the performance of many future digital systems, including networking equipment, may become heavily powerand coolinglimited, rather than circuitsize or circuitcost limited, if, that is, the logic circuits continue to be based on traditional, irreversible logic styles. Adiabatic, reversible logic techniques offer a new dimension of scalability in energy efficiency, which can reduce a system’s power requirement per unit throughput to almost arbitrarily low levels, perhaps thousands of times lower than with conventional irreversible logic. The primary drawback of adiabatic techniques is that they require increasing the minimum number, and therefore cost, of a system’s logic elements in order to maintain or improve performance, as individual devices are slowed down in order to operate them in an adiabatic mode which reduces the energy dissipated per operation. Therefore, the degree to which adiabatic techniques can be costeffective within the context of a specific application depends not only on the raw characteristics of the underlying semiconductor technology, but
Architecture of a Quantum Multicomputer Optimized for Shor’s Factoring Algorithm
, 2006
"... ii Quantum computers exist, and offer tantalizing possibilities of dramatic increases in computational power, but scaling them up to solve problems that are classically intractable offers enormous technical challenges. Distributed quantum computation offers a way to surpass the limitations of an i ..."
Abstract
 Add to MetaCart
(Show Context)
ii Quantum computers exist, and offer tantalizing possibilities of dramatic increases in computational power, but scaling them up to solve problems that are classically intractable offers enormous technical challenges. Distributed quantum computation offers a way to surpass the limitations of an individual quantum computer. I propose a quantum multicomputer as a form of distributed quantum computer. The quantum multicomputer consists of a large number of small nodes and a qubus interconnect for creating entangled state between the nodes. The primary metric chosen is the performance of such a system on Shor’s algorithm for factoring large numbers: specifically, the quantum modular exponentiation step that is the computational bottleneck. This dissertation introduces a number of optimizations for the modular exponentiation, including quantum versions of the classical carryselect and conditionalsum adders, improvements in the modular arithmetic, and a means for reducing the amount of expensive, errorprone quantum computation by increasing the amount of cheaper,