Rescue to the Curse of universality
Lists
Only you see this
Abstract
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 Ω(n log2n). 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.
BibTeX
@article{zhao2023rescue,
author = {Yongwei Zhao and Zidong Du and Qi Guo and Zhiwei Xu and Yunji Chen},
title = {{Rescue to the Curse of universality}},
journal = {Science China Information Sciences},
year = {2023},
url = {https://openreview.net/forum?id=4gB4iegEcs},
}Loading related content...