Limits on fundamental limits to computation

被引:0
作者
Igor L. Markov
机构
[1] The University of Michigan,EECS Department
[2] Ann Arbor,undefined
[3] Michigan 48109-2121,undefined
[4] USA,undefined
[5] Present address: Google Inc.,undefined
[6] 1600 Amphitheatre Parkway,undefined
[7] Mountain View,undefined
[8] California 94043,undefined
[9] USA.,undefined
来源
Nature | 2014年 / 512卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
To evaluate the promise of potential computing technologies, this review examines a wide range of fundamental limits, such as to performance, power consumption, size and cost, from the device level to the system level.
引用
收藏
页码:147 / 154
页数:7
相关论文
共 116 条
  • [1] Cavin RK(2012)Science and engineering beyond Moore’s law Proc. IEEE 100 1720-1749
  • [2] Lugli P(2013)Moore’s law: the first ending and a new beginning IEEE Computer 46 48-53
  • [3] Zhirnov VV(2011)Understanding sources of inefficiency in general-purpose chips Commun. ACM 54 85-93
  • [4] Chien AA(2011)Customizable domain-specific computing IEEE Des. Test Comput. 28 6-15
  • [5] Karamcheti V(2005)When and how to develop domain-specific languages ACM Comput. Surv. 37 316-344
  • [6] Hameed R(2004)Quantum lower bounds for the collision and the element distinctness problems J. ACM 51 595-605
  • [7] Cong J(2010)QIP = PSPACE Commun. ACM 53 102-109
  • [8] Reinman G(2000)A global wiring paradigm for deep submicron design IEEE Trans. CAD 19 242-252
  • [9] Bui AT(1995)Low power microelectronics: retrospective and prospect Proc. IEEE 83 619-635
  • [10] Sarkar V(2001)Interconnect limits on gigascale integration (GSI) in the 21st Century Proc. IEEE 89 305-324