{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:53:33Z","timestamp":1773194013483,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11432-021-3596-x","type":"journal-article","created":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T07:03:11Z","timestamp":1691218991000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rescue to the Curse of universality"],"prefix":"10.1007","volume":"66","author":[{"given":"Yongwei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zidong","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunji","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,2]]},"reference":[{"key":"3596_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/3282307","volume":"62","author":"J L Hennessy","year":"2019","unstructured":"Hennessy J L, Patterson D A. A new golden age for computer architecture. Commun ACM, 2019, 62: 48\u201360","journal-title":"Commun ACM"},{"key":"3596_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"s2\u201342","author":"A M Turing","year":"1937","unstructured":"Turing A M. On computable numbers, with an application to the entscheidungsproblem. Proc London Math Soc, 1937, s2\u201342: 230\u2013265","journal-title":"Proc London Math Soc"},{"key":"3596_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/85.238389","volume":"15","author":"J von Neumann","year":"1993","unstructured":"von Neumann J. First draft of a report on the EDVAC. IEEE Ann Hist Comput, 1993, 15: 27\u201375","journal-title":"IEEE Ann Hist Comput"},{"key":"3596_CR4","doi-asserted-by":"crossref","unstructured":"Valiant L G. Universal circuits (preliminary report). In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, Hershey, 1976. 196\u2013203","DOI":"10.1145\/800113.803649"},{"key":"3596_CR5","doi-asserted-by":"crossref","unstructured":"Esmaeilzadeh H, Blem E, Amant R S, et al. Dark silicon and the end of multicore scaling. In: Proceedings of the 38th Annual International Symposium on Computer Architecture (ISCA), 2011. 365\u2013376","DOI":"10.1145\/2000064.2000108"},{"key":"3596_CR6","doi-asserted-by":"crossref","unstructured":"Chen T, Du Z, Sun N, et al. DianNao: a small-footprint high-throughput accelerator for ubiquitous machine-learning. In: Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2014. 269\u2013284","DOI":"10.1145\/2541940.2541967"},{"key":"3596_CR7","volume-title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"D E Knuth","year":"1997","unstructured":"Knuth D E. The Art of Computer Programming, Volume 1: Fundamental Algorithms. 3rd ed. Redwood City: Addison Wesley Longman Publishing Co., Inc., 1997","edition":"3rd ed"},{"key":"3596_CR8","volume-title":"Models of Computation: Exploring the Power of Computing","author":"J E Savage","year":"1997","unstructured":"Savage J E. Models of Computation: Exploring the Power of Computing. Redwood City: Addison-Wesley Longman Publishing Co., Inc., 1997"},{"key":"3596_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora S, Barak B. Computational Complexity: A Modern Approach. Cambridge: Cambridge University Press, 2009"},{"key":"3596_CR10","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1007\/s00145-020-09346-z","volume":"33","author":"M Y Alhassan","year":"2020","unstructured":"Alhassan M Y, G\u00fcnther D, Kiss \u00c1, et al. Efficient and scalable universal circuits. J Cryptol, 2020, 33: 1216\u20131271","journal-title":"J Cryptol"},{"key":"3596_CR11","unstructured":"Zhao S, Yu Y, Zhang J, et al. Valiant\u2019s Universal Circuits Revisited: An Overall Improvement and a Lower Bound. Technical Report 943, 2018"},{"key":"3596_CR12","doi-asserted-by":"crossref","unstructured":"Liu H, Yu Y, Zhao S, et al. Pushing the limits of valiant\u2019s universal circuits: simpler, tighter and more compact. In: Proceedings of Annual International Cryptology Conference, 2021. 365\u2013394","DOI":"10.1007\/978-3-030-84245-1_13"},{"key":"3596_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J Backus","year":"1978","unstructured":"Backus J. Can programming be liberated from the von Neumann style? Commun ACM, 1978, 21: 613\u2013641","journal-title":"Commun ACM"},{"key":"3596_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H T Kung","year":"1982","unstructured":"Kung H T. Why systolic architectures? Computer, 1982, 15: 37\u201346","journal-title":"Computer"},{"key":"3596_CR15","first-page":"699","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"\u00c1 Kiss","year":"2016","unstructured":"Kiss \u00c1, Schneider T. Valiant\u2019s universal circuit is practical. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2016. 699\u2013728"},{"key":"3596_CR16","doi-asserted-by":"crossref","unstructured":"Lipmaa H, Mohassel P, Sadeghian S. Valiant\u2019s universal circuit: improvements, implementation, and applications. Cryptology ePrint Archive, Report 2016\/017, 2016. https:\/\/ia.cr\/2016\/017","DOI":"10.1088\/1475-7516\/2016\/09\/017"},{"key":"3596_CR17","doi-asserted-by":"crossref","unstructured":"Neary T, Woods D. The complexity of small universal Turing machines: a survey. In: Proceedings of Theory and Practice of Computer Science, 2012. 385\u2013405","DOI":"10.1007\/978-3-642-27660-6_32"},{"key":"3596_CR18","unstructured":"Kelly P H J. Advanced Computer Architecture, Chapter 1.3: the stored program concept and the Turing Tax. 2020. https:\/\/www.doc.ic.ac.uk\/~phjk\/AdvancedCompArchitecture\/Lectures\/pdfs\/Ch01-part4-uringTaxDiscussion.pdf"},{"key":"3596_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/3440992","volume":"64","author":"C Edwards","year":"2021","unstructured":"Edwards C. Moore\u2019s law: what comes next? Commun ACM, 2021, 64: 12\u201314","journal-title":"Commun ACM"},{"key":"3596_CR20","doi-asserted-by":"crossref","unstructured":"Chen Y, Luo T, Liu S, et al. DaDianNao: a machine-learning supercomputer. In: Proceedings of the 47th Annual IEEE\/ACM International Symposium on Microarchitecture, 2014. 609\u2013622","DOI":"10.1109\/MICRO.2014.58"},{"key":"3596_CR21","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/TC.2020.2982159","volume":"69","author":"Y Zhao","year":"2020","unstructured":"Zhao Y, Fan Z, Du Z, et al. Machine learning computers with fractal von Neumann architecture. IEEE Trans Comput, 2020, 69: 998\u20131014","journal-title":"IEEE Trans Comput"},{"key":"3596_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.7155\/jgaa.00391","volume":"20","author":"E M Kornaropoulos","year":"2016","unstructured":"Kornaropoulos E M, Tollis I G. Algorithms and bounds for overloaded orthogonal drawings. J Graph Algorithms Appl, 2016, 20: 217\u2013246","journal-title":"J Graph Algorithms Appl"},{"key":"3596_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L G Valiant","year":"1981","unstructured":"Valiant L G. Universality considerations in VLSI circuits. IEEE Trans Comput, 1981, C-30: 135\u2013140","journal-title":"IEEE Trans Comput"},{"key":"3596_CR24","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1147\/rd.494.0777","volume":"49","author":"M Y Lanzerotti","year":"2005","unstructured":"Lanzerotti M Y, Fiorenza G, Rand R A. Microminiature packaging and integrated circuitry: the work of E. F. Rent, with an application to on-chip interconnection requirements. IBM J Res Dev, 2005, 49: 777\u2013803","journal-title":"IBM J Res Dev"},{"key":"3596_CR25","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/12.53587","volume":"39","author":"R Beigel","year":"1990","unstructured":"Beigel R, Gill J. Sorting n objects with a k-sorter. IEEE Trans Comput, 1990, 39: 714\u2013716","journal-title":"IEEE Trans Comput"},{"key":"3596_CR26","doi-asserted-by":"crossref","unstructured":"Ajtai M, Koml\u00f3s J, Szemer\u00e9di E. An O(n log n) sorting network. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983. 1\u20139","DOI":"10.1145\/800061.808726"},{"key":"3596_CR27","doi-asserted-by":"crossref","unstructured":"Zhao Y, Du Z, Guo Q, et al. Cambricon-F: machine learning computers with fractal von Neumann architecture. In: Proceedings of ACM\/IEEE 46th Annual International Symposium on Computer Architecture (ISCA), 2019. 788\u2013801","DOI":"10.1145\/3307650.3322226"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3596-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T20:34:42Z","timestamp":1729370082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3596-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,2]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["3596"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3596-x","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,2]]},"assertion":[{"value":"21 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192102"}}