中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 计算技术研究所
  3. 中国科学院计算技术研究所
  4. 中国科学院计算技术研究所期刊论文
  5. 英文
Rescue to the Curse of universality

文献类型：期刊论文

作者Zhao, Yongwei1; Du, Zidong1,3; Guo, Qi1; Xu, Zhiwei1,2; Chen, Yunji1,2
刊名SCIENCE CHINA-INFORMATION SCIENCES
出版日期2023-09-01
卷号66期号:9页码:17
ISSN号1674-733X
关键词universality general-purpose architecture specialized architecture deep learning processor universal circuit
DOI10.1007/s11432-021-3596-x
英文摘要From the very beginning of computers, universality has been the core focus in the building of computing machines, such as the universal Turing machine, von Neumann architecture, random-access machines, and universal circuits. Academia has taken universality as the primary principle ever since. However, the Curse of universality, implied from L. G. Valiant's Universal Circuit, states that computers based on logic circuits cannot be both universal and efficient, as the cost of universality is & omega;(n log(2)n). Though the Curse has been hidden by the rapid advancement of semiconductor technologies, it has been wielding its effects noticeably in recent years. Due to the ending of Dennard scaling and Moore's law, general-purpose processors leave less room for improvement. Therefore, domain-specific architectures (DSAs), such as deep learning processors, have been exploding, leading to the new golden age of computer architectures. For DSAs, universality is traded off for optimal efficiency. However, we predict that universality will once again be a major concern for post-golden-age computers. In this paper, we discuss how much universality could an efficient computer keep. As a rescue to the Curse, we define and discuss quasi-universal architectures. Quasi-universal architectures can solve any computable problem and are efficient for a wide range of problems. The proposed Recursive-Encapsulated (RENC) architecture achieves maximal universality while keeping optimal efficiency as found in specialized architectures. The discovery of RENC suggests that current golden-age architectures are not Pareto optimal.
资助项目National Key Research and Development Program of China[2018AAA0103300] ; National Natural Science Foundation of China[61925208] ; National Natural Science Foundation of China[62102398] ; National Natural Science Foundation of China[U19B2019] ; Strategic Priority Research Program of Chinese Academy of Science[XDB32050200] ; Beijing Academy of Artificial Intelligence (BAAI) ; Beijing Nova Program of Science and Technology[Z191100001119093] ; CAS Project for Young Scientists in Basic Research[YSBR-029] ; Youth Innovation Promotion Association CAS and Xplore Prize
WOS研究方向Computer Science ; Engineering
语种英语
出版者SCIENCE PRESS
WOS记录号WOS:001042755300001
源URL[http://119.78.100.204/handle/2XEOYT63/21331]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Chen, Yunji
作者单位1.Chinese Acad Sci, Inst Comp Technol, State Key Lab Processors, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
3.Beijing Acad Artificial Intelligence, Beijing 100084, Peoples R China
推荐引用方式
GB/T 7714		 Zhao, Yongwei,Du, Zidong,Guo, Qi,et al. Rescue to the Curse of universality[J]. SCIENCE CHINA-INFORMATION SCIENCES,2023,66(9):17.
APA Zhao, Yongwei,Du, Zidong,Guo, Qi,Xu, Zhiwei,&Chen, Yunji.(2023).Rescue to the Curse of universality.SCIENCE CHINA-INFORMATION SCIENCES,66(9),17.
MLA Zhao, Yongwei,et al."Rescue to the Curse of universality".SCIENCE CHINA-INFORMATION SCIENCES 66.9(2023):17.

入库方式： OAI收割

来源：计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。