
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Krishna V. Palem, "Energy Aware Computing through Probabilistic Switching: A Study of Limits," IEEE Transactions on Computers, vol. 54, no. 9, pp. 11231137, September, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.145, author = {Krishna V. Palem}, title = {Energy Aware Computing through Probabilistic Switching: A Study of Limits}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {9}, issn = {00189340}, year = {2005}, pages = {11231137}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.145}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Energy Aware Computing through Probabilistic Switching: A Study of Limits IS  9 SN  00189340 SP1123 EP1137 EPD  11231137 A1  Krishna V. Palem, PY  2005 KW  Index Terms Energyaware systems KW  lowpower design KW  probabilistic computation. VL  54 JA  IEEE Transactions on Computers ER   
[1] K.V. Palem, “Thermodynamics of Randomized Computing, a Discipline for Energy Aware Algorithm Design and Analysis,” Technical Report GITCC0256, Georgia Inst. of Tech nology, Nov. 2002.
[2] K.V. Palem, “Energy Aware Computation: From Algorithms and Thermodynamics to Randomized (Semiconductor) Devices,” Technical Report GITCC0310, Georgia Inst. of Tech nology, Feb. 2003.
[3] K.V. Palem, “Energy Aware Computing through Randomized Switching,” Technical Report GITCC0316, Georgia Inst. of Tech nology, May 2003.
[4] J.T. Schwartz, “Fast Probabilistic Algorithms for Verification of Polynomial Identities,” J. ACM, vol. 27, pp. 701717, 1980.
[5] M.O. Rabin, “Probabilistic Algorithms,” Algorithms and Complexity, New Directions and Recent Trends, J.F. Traub, ed., pp. 2939, 1976.
[6] G.J. Chaitin and J.T. Schwartz, “A Note on Monte Carlo Primality Tests and Algorithmic Information Theory,” Comm. Pure and Applied Math., vol. 31, pp. 521527, 1978.
[7] R. Balian, From Microphysics to Macrophysics, vols. 1, 2. SpringerVerlag, 1991.
[8] U.V. Vazirani and V.V. Vazirani, “Efficient and Secure PseudoRandom Number Generation (Extended Abstract),” Proc. Ann. Symp. Foundations of Computer Science, pp. 458463, 1984.
[9] L. Szilard, “On the Decrease of Entropy in a Thermodynamic System by the Intervention of Intelligent Beings,” Maxwell's Demon: Why Warmth Disperses and Time Passes, H. Leff and E. Rex, 1998.
[10] N. Pippenger and M.J. Fischer, “Relations among Complexity Measures,” J. ACM, vol. 26, pp. 361381, Apr. 1979.
[11] N. Pippenger, “On Simultaneous Resource Bounds (Preliminary Version),” Proc. 20th Ann. Symp. Foundations of Computer Science, pp. 307311, 1979.
[12] C.H. Papadimitriou, Computational Complexity. AddisonWesley, 1994.
[13] M. Sipser, Introduction to the Theory of Computation. PWS Publishing Company, 1997.
[14] A.A. Razborov, “A Lower Bound on the Monote Complexity of the Logical Permanent,” Mat. Zametki, vol. 37, no. 6,English translation in Math. Notes of the Academy of Sciences of the USSR, 1985.
[15] A.A. Razborov, “Lower Bounds on the Monote Complexity of Some Boolean Functions,” Dokl. Akad. Nauk SSSR, English translation in Soviet Math. Dokl., vol. 31, pp. 798801, 1985.
[16] K. Palem, “Proof as Experiment: Computation from a Thermodynamic Perspective,” Proc. Int'l Symp. Verification: Theory and Practice, June 2003.
[17] S. Carnot, Reflections on the Motive Power of Fire (Reflexions sur la Puissance Motrice du Feu et sur les Machines Propres a Developper Cette Puissance), 1824.
[18] R. Clausius, “Uber die Bewegende Kraft der Warme,” Annalen der Physik, 1850.
[19] J.C. Maxwell, “Illustrations of the Dynamical Theory of Gases,” Phil. Mag., vol. 19, pp. 1932, 1860.
[20] J.C. Maxwell, “On the Dynamical Theory of Gases,” Philosophical Trans. Royal Soc. London, vol. 157, pp. 4988, 1867.
[21] L. Boltzmann and S.G. Brush, Lectures on Gas Theory, English translation by S.G. Brush. Dover Publications, 1995.
[22] J.W. Gibbs, Elementary Principles in Statistical Mechanics. New York: Scribner, 1902.
[23] M. Planck, Treatise on Thermodynamics. Dover Publications, 1922.
[24] J. von Neumann, Fourth University of Illinois Lecture in Theory of SelfReproducing Automata, A. W. Burks, ed. Univ. of Illinois Press, 1966.
[25] R. Landauer, “Irreversibility and Heat Generation in the Computing Process,” IBM J. Research and Development, vol. 3, pp. 183191, July 1961.
[26] C.H. Bennett, “Logical Reversibility of Computation,” IBM J. Research and Development, vol. 17, pp. 525532, Nov. 1973.
[27] E. Fredkin and T. Toffoli, “Conservative Logic,” Proc. Physics of Computation Conf., pp. 219253, 1982.
[28] J.D. Meindl, “Low Power Microelectronics: Retrospect and Prospect,” Proc. IEEE, pp. 619635, Apr. 1995.
[29] J.D. Meindl and J.A. Davis, “The Fundamental Limit on Binary Switching Energy for Terescale Integration (TSI),” IEEE. J. SolidState Circuits, pp. 15151516, Oct. 2000.
[30] K.U. Stein, “NoiseInduced Error Rate as Limiting Factor for Energy per Operation in Digital ICS,” IEEE J. SolidState Circuits, vol. 31, no. 5, 1977.
[31] M.O. Rabin and D.S. Scott, “Finite Automata and Their Decision Problems,” IBM J. Research and Development, vol. 3, no. 2, pp. 115125, 1959.
[32] M.O. Rabin, “Probabilistic Automata,” Information and Control, vol. 6, pp. 230245, 1963.
[33] R.M. Karp, “Probabilistic Analysis of Partitioning Algorithms for the TravelingSalesman Problem in the Plane,” Math. Operations Research, vol. 2, no. 3, pp. 209224, Aug. 1977.
[34] J. Gill, “Computational Complexity of Probabilistic Turing Machines,” SIAM J. Computing, vol. 6, no. 4, pp. 675695, 1977.
[35] R. Feynman, Feynman Lectures on Computation. AddisonWesley, 1996.
[36] Z. Kohavi, Switching and Finite Automata Theory. New York: McGrawHill, 1970.
[37] Z. Manna, Mathematical Theory of Computation. New York: McGrawHill, 1974.
[38] K. Palem, S. Cheemalavagu, and P. Korkmaz, “The Physical Representation of Probabilistic Bits (pbits) and the Energy Consumption of Randomized Switching,” CREST technical report, June 2003.
[39] C. Cheemalavagu, P. Korkmaz, and K. Palem, “Ultra LowEnergy Computing via Probabilistic Algorithms and Devices: CMOS Device Primitives and the EnergyProbability Relationship,” Proc. 2004 Int'l Conf. Solid State Devices and Materials, Sept. 2004.
[40] K.V. Palem, L.N. Chakrapani, B.E.S. Akgul, P. Korkmaz, and B. Seshasayee, “Ultra EnergyPerformance Efficient Embedded SoC Architectures Based on Probabilistic CMOS (PCMOS),” Int'l Conf. Computers, Architectures, and Synthesis for Embedded Systems (CASES) 2005, submitted for publication.
[41] A. Sinha and A. Chandrakasan, “Jouletrack: A Web Based Tool for Software Energy Profiling,” Proc. 38th Conf. Design Automation, 2001.
[42] M.S. Gupta, “Fluctuations and Dissipation in Elementary OneBit Information Storage System,” Int'l J. Theoretical Physics, vol. 21, nos. 3/4, pp. 275282, Apr. 1982.
[43] K. Palem, S. Cheemalavagu, and P. Korkmaz, “Introverted Switches as a Basis for Minimizing Leakage in CMOS,” US patent invention disclosure, in preparation.
[44] V. Tiwari, S. Malik, and P. Ashar, “Guarded Evaluation: Pushing Power Management in Logic Synthesis/Design,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 17, Oct. 1998.
[45] A.J. Martin, M. Nystrom, and C.G. Wong, “Tutorial: Asynchronous Microprocessor Design,” Proc. 35th Int'l Symp. Microarchitecture, Nov. 2003.
[46] B. Kish, “End of Moore's Law: Thermal (Noise) Death of Integration in Micro and Nano Electronics,” Physics Letters A, vol. 305, 2002.
[47] K.V. Palem, S. Cheemalavagu, P. Korkmaz, and B.E.S. Akgul, “Probabilistic and Introverted Switching to Conserve Energy in a Digital System,” US Patent application, 27 Apr. 2005.