{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:50Z","timestamp":1777954610707,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DENA0003965"],"award-info":[{"award-number":["DENA0003965"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"DOD U.S. Department of Defense","doi-asserted-by":"publisher","award":["FA87501921000"],"award-info":[{"award-number":["FA87501921000"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1910568,CCF-1943456"],"award-info":[{"award-number":["CCF-1910568,CCF-1943456"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743349","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"75-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Zero Spawn Overhead: Work Stealing Without Deques"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5183-6937","authenticated-orcid":false,"given":"Aaron","family":"Handleman","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, Missouri, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3588-2215","authenticated-orcid":false,"given":"Kyle","family":"Singer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology CSAIL, Cambridge, Massachusetts, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0198-3283","authenticated-orcid":false,"given":"Tao B.","family":"Schardl","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology CSAIL, Cambridge, Massachusetts, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0687-5508","authenticated-orcid":false,"given":"I-Ting Angelina","family":"Lee","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, Missouri, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"New calling convention preserve_none. https:\/\/github.com\/llvm\/llvm-project\/pull\/76868. Accessed","year":"2025","unstructured":"2024. New calling convention preserve_none. https:\/\/github.com\/llvm\/llvm-project\/pull\/76868. Accessed in February 2025."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295725"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192391"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000101"},{"key":"e_1_3_2_1_6_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (second ed.). Addison-Wesley."},{"key":"e_1_3_2_1_7_1","volume-title":"Thread Scheduling for Multiprogrammed Multiprocessors. In 10th Annual ACM Symposium on Parallel Algorithms and Architectures. 119--129","author":"Arora Nimar S.","unstructured":"Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. 1998. Thread Scheduling for Multiprogrammed Multiprocessors. In 10th Annual ACM Symposium on Parallel Algorithms and Architectures. 119--129."},{"key":"e_1_3_2_1_8_1","volume-title":"Thread Scheduling for Multiprogrammed Multiprocessors. Theory of Computing Systems","author":"Arora Nimar S.","year":"2001","unstructured":"Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. 2001. Thread Scheduling for Multiprogrammed Multiprocessors. Theory of Computing Systems (2001), 115--144."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science","author":"Robert","unstructured":"Robert D. Blumofe and Charles E. Leiserson. 1994. Scheduling Multithreaded Computations by Work Stealing. In Proceedings of the IEEE Symposium on Foundations of Computer Science (Santa Fe, New Mexico). 356--368."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"F. Warren Burton and M. Ronan Sleep. 1981. Executing Functional Programs on a Virtual Tree of Processors. In FPCA. ACM 187--194.","DOI":"10.1145\/800223.806778"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413407"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation. ACM, 212--223","author":"Frigo Matteo","unstructured":"Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. 1998. The Implementation of the Cilk-5 Multithreaded Language. In Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation. ACM, 212--223."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the AFIPS Spring Joint Computer Conference","author":"Hauck E. A.","year":"1968","unstructured":"E. A. Hauck and B. A. Dent. 1968. Burroughs' B6500\/B7500 stack mechanism. Proceedings of the AFIPS Spring Joint Computer Conference (1968), 245--251."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504187"},{"key":"e_1_3_2_1_19_1","volume-title":"opencilk.org. Accessed","author":"Hub Cilk","year":"2025","unstructured":"Cilk Hub. 2025. OpenCilk. opencilk.org. Accessed in February 2025."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/182590.182442"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967968"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"David A. Kranz Robert H. Halstead Jr. and Eric Mohr. 1989. Mul-T: A High-Performance Parallel Lisp. In PLDI. ACM 81--90.","DOI":"10.1145\/73141.74825"},{"key":"e_1_3_2_1_23_1","volume-title":"LLVM: An Infrastructure for Multi-Stage Optimization. Master's thesis. Computer Science Dept.","author":"Lattner Chris","year":"2002","unstructured":"Chris Lattner. 2002. LLVM: An Infrastructure for Multi-Stage Optimization. Master's thesis. Computer Science Dept., University of Illinois at Urbana-Champaign, Urbana, IL."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_25_1","volume-title":"Leiserson","author":"Lee Ting Angelina","year":"2010","unstructured":"I-Ting Angelina Lee, Silas Boyd-Wickizer, Zhiyi Huang, and Charles E. Leiserson. 2010. Using Memory Mapping to Support Cactus Stacks in Work-Stealing Runtime Systems. In PACT. ACM, 411--420."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_1_27_1","volume-title":"Calling Conventions. https:\/\/llvm.org\/docs\/LangRef.html#calling-conventions. Accessed in February","author":"Project LLVM","year":"2003","unstructured":"LLVM Project. 2003. LLVM Language Reference Manual, Calling Conventions. https:\/\/llvm.org\/docs\/LangRef.html#calling-conventions. Accessed in February 2025."},{"key":"e_1_3_2_1_28_1","volume-title":"Instruction Reference. https:\/\/llvm.org\/docs\/LangRef.html#calling-conventions. Accessed in February","author":"Project LLVM","year":"2025","unstructured":"LLVM Project. 2003. LLVM Language Reference Manual, Instruction Reference. https:\/\/llvm.org\/docs\/LangRef.html#calling-conventions. Accessed in February 2025."},{"key":"e_1_3_2_1_29_1","unstructured":"Michael Matz Jan Hubi\u010dka Andreas Jaeger and Mark Mitchell. 2012. System V Application Binary Interface AMD64 Architecture Processor Supplement Draft Version 0.99. Available at https:\/\/refspecs.linuxbase.org\/elf\/x86_64-abi-0.99.pdf."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.86103"},{"key":"e_1_3_2_1_31_1","volume-title":"The OpenCilk Project codebase.","year":"2025","unstructured":"OpenCilk. 2025. The OpenCilk Project codebase. Available at https:\/\/github.com\/opencilk\/opencilk-project\/tree\/dev\/18.x. Accessed in February 2025."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3460969"},{"key":"e_1_3_2_1_33_1","volume-title":"Schardl and I-Ting Angelina Lee","author":"Tao","year":"2023","unstructured":"Tao B. Schardl and I-Ting Angelina Lee. 2023. OpenCilk: A Modular and Extensible Software Infrastructure for Fast Task-Parallel Code. In Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (Montreal, QC, Canada). Association for Computing Machinery, 189--203."},{"key":"e_1_3_2_1_34_1","volume-title":"Leiserson","author":"Schardl Tao B.","year":"2019","unstructured":"Tao B. Schardl, William S. Moses, and Charles E. Leiserson. 2019. Tapir: Embedding Recursive Fork-Join Parallelism into LLVM's Intermediate Representation. ACM TOPC 6, 4, Article 19 (Dec. 2019), 33 pages."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916312"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Alexandros Tzannes George C. Caragea Rajeev Barua and Uzi Vishkin. 2010. Lazy Binary-Splitting: A Run-Time Adaptive Work-Stealing Scheduler. In PPoPP. 179--190.","DOI":"10.1145\/1693453.1693479"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629643"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407910"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632880"},{"key":"e_1_3_2_1_40_1","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities based on Ground-truth. arXiv:cs.SI\/1205.6233 https:\/\/arxiv.org\/abs\/1205.6233"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:20:18Z","timestamp":1777922418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":40,"alternative-id":["10.1145\/3694906.3743349","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743349","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}