{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:51Z","timestamp":1750219851788,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591321","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"285-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6305-4290","authenticated-orcid":false,"given":"Bradley C.","family":"Kuszmaul","sequence":"first","affiliation":[{"name":"Independent Consultant, Lexington, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6386-5552","authenticated-orcid":false,"given":"Charles E.","family":"Leiserson","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","key":"e_1_3_2_1_2_1","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2022. Introduction to Algorithms fourth ed.). The MIT Press."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155333"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/7902.7903"},{"key":"e_1_3_2_1_5_1","volume-title":"Fat-trees: universal networks for hardware-efficient supercomputing","author":"Leiserson Charles E.","year":"1985","unstructured":"Charles E. Leiserson. 1985. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput., Vol. C-34, 10 (October 1985), 892--901."},{"key":"e_1_3_2_1_6_1","volume-title":"Fourth Annual ACM Symposium on Parallel Algorithms and Architectures. Association for Computing Machinery","author":"Leiserson Charles E.","year":"1992","unstructured":"Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, and Robert Zak. 1992. The Network Architecture of the Connection Machine CM-nobreak 5. In Fourth Annual ACM Symposium on Parallel Algorithms and Architectures. Association for Computing Machinery, San Diego, California, 272--285. A later version was published in Journal of Parallel and Distributed Computing, 33, 2 (1996), 145--158."},{"key":"e_1_3_2_1_7_1","volume-title":"Schardl","author":"Leiserson Charles E.","year":"2020","unstructured":"Charles E. Leiserson, Neil C. Thompson, Joel S. Emer, Bradley C. Kuszmaul, Butler W. Lampson, Daniel Sanchez, and Tao B. Schardl. 2020. There's plenty of room at the Top: What will drive computer performance after Moore's law? Science, Vol. 368, 6495 (2020)."},{"key":"e_1_3_2_1_8_1","volume-title":"Electronics","volume":"38","author":"Moore Gordon E.","year":"1965","unstructured":"Gordon E. Moore. 1965. Cramming more components onto integrated circuits. Electronics, Vol. 38, 8 (1965)."},{"key":"e_1_3_2_1_9_1","volume-title":"International Electron Devices Meeting Technical Digest. IEEE, 11--13","author":"Moore Gordon E.","year":"1975","unstructured":"Gordon E. Moore. 1975. Progress in digital integrated electronics. In International Electron Devices Meeting Technical Digest. IEEE, 11--13."},{"volume-title":"TOP500 List: Top 10 Sites for","year":"1993","key":"e_1_3_2_1_10_1","unstructured":"TOP500.org. 2023. TOP500 List: Top 10 Sites for June 1993. Available at https:\/\/www.top500.org\/lists\/top500\/1993\/06\/."}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591321","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:07Z","timestamp":1750178827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":10,"alternative-id":["10.1145\/3558481.3591321","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591321","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}