Throughput-dissipation tradeoff in partially reversible nanocomputing: A case study

Partial reversibility is an underexplored avenue for balancing high computational throughput and low power dissipation in nanocomputing systems. In this work we study the throughput-dissipation tradeoff in a partially reversible 32-bit MIPS ALU implemented in quantum cellular automata and clocked via the “pipelined Bennett clocking” strategy recently introduced by Ottavi and co-workers. Fundamental upper bounds on the computational power efficiency (operations per Watt second) - as limited by dissipation from logical irreversibility - are evaluated as a function of the number of pipeline zones used in the ALU clocking, and are compared to corresponding results for pure Bennett clocking (which maximizes reversibility) and standard Landauer clocking (which maximizes throughput). Pipelined Bennett clocking is shown to offer both significant power efficiency advantages over Landauer clocking and throughput advantages over pure Bennett clocking for ALUs with small numbers of pipeline zones. These efficiency advantages are, however, lost for larger numbers of pipeline zones, where Landauer clocking provides superior efficiency and throughput. The observed throughput-dissipation tradeoff is explained in terms of relative communication and computation costs in pipelined Bennett clocking. Implications for partially reversible circuit design are briefly discussed.

[1]  Fabrizio Lombardi,et al.  High throughput and low power dissipation in QCA pipelines using Bennett clocking , 2010, 2010 IEEE/ACM International Symposium on Nanoscale Architectures.

[2]  David A. Patterson,et al.  Computer Organization and Design, Revised Fourth Edition, Fourth Edition: The Hardware/Software Interface , 2011 .

[3]  D. Tougaw,et al.  A Scalable Signal Distribution Network for Quantum-Dot Cellular Automata , 2013, IEEE Transactions on Nanotechnology.

[4]  Wolfgang Porod,et al.  Quantum cellular automata , 1994 .

[5]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[6]  P. D. Tougaw,et al.  Logical devices implemented using quantum cellular automata , 1994 .

[7]  C. Lent,et al.  Clocking of molecular quantum-dot cellular automata , 2001 .

[8]  T.J. Dysart,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2001 .

[9]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[10]  E. Swartzlander,et al.  Adder Designs and Analyses for Quantum-Dot Cellular Automata , 2007, IEEE Transactions on Nanotechnology.

[11]  M. Ottavi,et al.  Partially Reversible Pipelined QCA Circuits: Combining Low Power With High Throughput , 2011, IEEE Transactions on Nanotechnology.

[12]  Neal G. Anderson,et al.  Heat Dissipation in Nanocomputing: Lower Bounds From Physical Information Theory , 2013, IEEE Transactions on Nanotechnology.

[13]  Neal G. Anderson,et al.  Heat dissipation bounds for nanocomputing: Theory and application to QCA , 2011, 2011 11th IEEE International Conference on Nanotechnology.

[14]  Yuhui Lu,et al.  Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling , 2006, Nanotechnology.

[15]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..