{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:46Z","timestamp":1772164066896,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2012-StG-308246"],"award-info":[{"award-number":["ERC-2012-StG-308246"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3192366.3192391","type":"proceedings-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:16:01Z","timestamp":1528791361000},"page":"769-782","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Heartbeat scheduling: provable efficiency for nested parallelism"],"prefix":"10.1145","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Arthur","family":"Chargu\u00e9raud","sequence":"additional","affiliation":[{"name":"University of Strasbourg, France \/ Inria, France"}]},{"given":"Adrien","family":"Guatto","sequence":"additional","affiliation":[{"name":"Inria, France"}]},{"given":"Mike","family":"Rainey","sequence":"additional","affiliation":[{"name":"Inria, France \/ CREST, USA"}]},{"given":"Filip","family":"Sieczkowski","sequence":"additional","affiliation":[{"name":"Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Mullerand Ram Raghunathan","author":"Acar Umut A.","year":"2015","unstructured":"Umut A. Acar , Guy Blelloch , Matthew Fluet , and Stefan K . Mullerand Ram Raghunathan . 2015 . Coupling Memory and Computation for Locality Management. In Summit on Advances in Programming Languages (SNAPL) . Umut A. Acar, Guy Blelloch, Matthew Fluet, and Stefan K. Mullerand Ram Raghunathan. 2015. Coupling Memory and Computation for Locality Management. In Summit on Advances in Programming Languages (SNAPL)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1057-3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000101"},{"key":"e_1_3_2_2_5_1","first-page":"229","volume-title":"SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"Agarwal Shivali","year":"2007","unstructured":"Shivali Agarwal , Rajkishore Barik , Dan Bonachea , Vivek Sarkar , R. K. Shyamasundar , and Katherine A. Yelick . 2007. Deadlock-free scheduling of X10 computations with bounded resources . In SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures , San Diego, California, USA , June 9-11, 2007 . 229 - 240 . Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, and Katherine A. Yelick. 2007. Deadlock-free scheduling of X10 computations with bounded resources. In SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. 229-240."},{"key":"e_1_3_2_2_6_1","first-page":"119","volume-title":"Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures (SPAA '98)","author":"Arora Nimar S.","unstructured":"Nimar S. Arora , Robert D. Blumofe , and C. Greg Plaxton . 1998. Thread scheduling for multiprogrammed multiprocessors . In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures (SPAA '98) . ACM Press , 119 - 129 . Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. 1998. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures (SPAA '98). ACM Press, 119-129."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-0004-z"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_2_10_1","volume-title":"Gibbons","author":"Blelloch Guy E.","year":"2004","unstructured":"Guy E. Blelloch and Phillip B . Gibbons . 2004 . Effectively sharing a cache among threads. In SPAA. Guy E. Blelloch and Phillip B. Gibbons. 2004. Effectively sharing a cache among threads. In SPAA."},{"key":"e_1_3_2_2_11_1","volume-title":"Provably efficient scheduling for languages with fine-grained parallelism. J. ACM 46 (March","author":"Blelloch Guy E.","year":"1999","unstructured":"Guy E. Blelloch , Phillip B. Gibbons , and Yossi Matias . 1999. Provably efficient scheduling for languages with fine-grained parallelism. J. ACM 46 (March 1999 ), 281-321. Issue 2. Guy E. Blelloch, Phillip B. Gibbons, and Yossi Matias. 1999. Provably efficient scheduling for languages with fine-grained parallelism. J. ACM 46 (March 1999), 281-321. Issue 2."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_2_13_1","volume-title":"Leiserson","author":"Blumofe Robert D.","year":"1999","unstructured":"Robert D. Blumofe and Charles E . Leiserson . 1999 . Scheduling multithreaded computations by work stealing. J. ACM 46 (Sept. 1999), 720-748. Issue 5. Robert D. Blumofe and Charles E. Leiserson. 1999. Scheduling multithreaded computations by work stealing. J. ACM 46 (Sept. 1999), 720-748. Issue 5."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_2_15_1","volume-title":"Functional Programming Languages and Computer Architecture (FPCA '81)","author":"Warren Burton F.","unstructured":"F. Warren Burton and M. Ronan Sleep . 1981. Executing functional programs on a virtual tree of processors . In Functional Programming Languages and Computer Architecture (FPCA '81) . ACM Press , 187-194. F. Warren Burton and M. Ronan Sleep. 1981. Executing functional programs on a virtual tree of processors. In Functional Programming Languages and Computer Architecture (FPCA '81). ACM Press, 187-194."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073974"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378574"},{"key":"e_1_3_2_2_19_1","volume-title":"2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis. 1-11","author":"Duran A.","unstructured":"A. Duran , J. Corbalan , and E. Ayguade . 2008. An adaptive cut-off for task parallelism . In 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis. 1-11 . A. Duran, J. Corbalan, and E. Ayguade. 2008. An adaptive cut-off for task parallelism. In 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis. 1-11."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21127"},{"key":"e_1_3_2_2_21_1","first-page":"94","article-title":"A Message Passing Implementation of Lazy Task Creation","author":"Feeley Marc","year":"1992","unstructured":"Marc Feeley . 1992 . A Message Passing Implementation of Lazy Task Creation . In Parallel Symbolic Computing. 94 - 107 . Marc Feeley. 1992. A Message Passing Implementation of Lazy Task Creation. In Parallel Symbolic Computing. 94-107.","journal-title":"Parallel Symbolic Computing."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165205"},{"key":"e_1_3_2_2_23_1","volume-title":"Friedman","author":"Felleisen Matthias","year":"1987","unstructured":"Matthias Felleisen and Daniel P . Friedman . 1987 . Control Operators, the SECD-Machine, and the Lambda-Calculus. In Formal Description of Programming Concepts - III, M. Wirsing (Ed.). Elsevier Science Publisher B.V. (North-Holland) , 193-219. Matthias Felleisen and Daniel P. Friedman. 1987. Control Operators, the SECD-Machine, and the Lambda-Calculus. In Formal Description of Programming Concepts - III, M. Wirsing (Ed.). Elsevier Science Publisher B.V. (North-Holland), 193-219."},{"key":"e_1_3_2_2_24_1","first-page":"5","article-title":"Implicitly threaded parallelism in Manticore","volume":"20","author":"Fluet Matthew","year":"2011","unstructured":"Matthew Fluet , Mike Rainey , John Reppy , and Adam Shaw . 2011 . Implicitly threaded parallelism in Manticore . Journal of Functional Programming 20 , 5 - 6 (2011), 1-40. Matthew Fluet, Mike Rainey, John Reppy, and Adam Shaw. 2011. Implicitly threaded parallelism in Manticore. Journal of Functional Programming 20, 5-6 (2011), 1-40.","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411224"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_2_27_1","volume-title":"Enabling Primitives for Compiling Parallel Languages. In Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers","author":"Goldstein Seth Copen","year":"1995","unstructured":"Seth Copen Goldstein , Klaus Erik Schauser , and David Culler . 1995 . Enabling Primitives for Compiling Parallel Languages. In Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers . Troy, New York. Seth Copen Goldstein, Klaus Erik Schauser, and David Culler. 1995. Enabling Primitives for Compiling Parallel Languages. In Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers. Troy, New York."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0104"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316690"},{"key":"e_1_3_2_2_30_1","volume-title":"Acarand Matthew Fluet","author":"Guatto Adrien","year":"2018","unstructured":"Adrien Guatto , Sam Westrick , Ram Raghunathan , and Umut A . Acarand Matthew Fluet . 2018 . Hierarchical Memory Management for Mutable State. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP). ACM Press . Adrien Guatto, Sam Westrick, Ram Raghunathan, and Umut A. Acarand Matthew Fluet. 2018. Hierarchical Memory Management for Mutable State. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP). ACM Press."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802017"},{"key":"e_1_3_2_2_32_1","first-page":"245","volume-title":"Proceedings of the","author":"Hauck E. A.","year":"1968","unstructured":"E. A. Hauck and B. A. Dent . 1968. Burroughs' B6500\/B7500 Stack Mechanism . In Proceedings of the April 30-May 2, 1968 , Spring Joint Computer Conference (AFIPS '68 (Spring)). ACM, New York, NY, USA , 245 - 251 . E. A. Hauck and B. A. Dent. 1968. Burroughs' B6500\/B7500 Stack Mechanism. In Proceedings of the April 30-May 2, 1968, Spring Joint Computer Conference (AFIPS '68 (Spring)). ACM, New York, NY, USA, 245-251."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504187"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182442"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2647508.2647514"},{"key":"e_1_3_2_2_36_1","unstructured":"Intel. 2011. Intel Threading Building Blocks. https:\/\/www.threadingbuildingblocks.org\/.  Intel. 2011. Intel Threading Building Blocks. https:\/\/www.threadingbuildingblocks.org\/."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967968"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_3_2_2_39_1","volume-title":"On-the-Fly Pipeline Parallelism. TOPC 2, 3","author":"Lee Ting Angelina","year":"2015","unstructured":"I- Ting Angelina Lee , Charles E. Leiserson , Tao B. Schardl , Zhunping Zhang , and Jim Sukha . 2015. On-the-Fly Pipeline Parallelism. TOPC 2, 3 ( 2015 ), 17:1-17:42. I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Zhunping Zhang, and Jim Sukha. 2015. On-the-Fly Pipeline Parallelism. TOPC 2, 3 (2015), 17:1-17:42."},{"key":"e_1_3_2_2_40_1","first-page":"411","volume-title":"Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques (PACT '10)","author":"Lee Ting Angelina","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 Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques (PACT '10) . ACM, New York, NY, USA , 411 - 420 . 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 Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques (PACT '10). ACM, New York, NY, USA, 411-420."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640106"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0038"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Simon Marlow. 2013. Parallel and Concurrent Programming in Haskell. O'Reilly.  Simon Marlow. 2013. Parallel and Concurrent Programming in Haskell . O'Reilly.","DOI":"10.1007\/978-3-642-32096-5_7"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.86103"},{"key":"e_1_3_2_2_45_1","volume-title":"Blelloch","author":"Narlikar Girija J.","year":"1999","unstructured":"Girija J. Narlikar and Guy E . Blelloch . 1999 . Space-Efficient Scheduling of Nested Parallelism. ACM Transactions on Programming Languages and Systems 21 (1999). Girija J. Narlikar and Guy E. Blelloch. 1999. Space-Efficient Scheduling of Nested Parallelism. ACM Transactions on Programming Languages and Systems 21 (1999)."},{"key":"e_1_3_2_2_46_1","unstructured":"OpenMP Architecture Review Board. [n. d.]. OpenMP Application Program Interface. http:\/\/www.openmp.org\/  OpenMP Architecture Review Board. [n. d.]. OpenMP Application Program Interface. http:\/\/www.openmp.org\/"},{"key":"e_1_3_2_2_47_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Lisp: Languages and Systems, Takayasu Ito and Robert Halstead (Eds.)","author":"Pehoushek Joseph","unstructured":"Joseph Pehoushek and Joseph Weening . 1990. Low-cost process creation and dynamic partitioning in Qlisp . In Parallel Lisp: Languages and Systems, Takayasu Ito and Robert Halstead (Eds.) . Lecture Notes in Computer Science , Vol. 441 . Springer Berlin \/ Heidelberg , 182-199. Joseph Pehoushek and Joseph Weening. 1990. Low-cost process creation and dynamic partitioning in Qlisp. In Parallel Lisp: Languages and Systems, Takayasu Ito and Robert Halstead (Eds.). Lecture Notes in Computer Science, Vol. 441. Springer Berlin \/ Heidelberg, 182-199."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951935"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736055"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_2_51_1","volume-title":"MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming FirstView (6","author":"Sivaramakrishnan K. C.","year":"2014","unstructured":"K. C. Sivaramakrishnan , Lukasz Ziarek , and Suresh Jagannathan . 2014. MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming FirstView (6 2014 ), 1-62. K. C. Sivaramakrishnan, Lukasz Ziarek, and Suresh Jagannathan. 2014. MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming FirstView (6 2014), 1-62."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584019"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693479"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693479"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629643"},{"key":"e_1_3_2_2_56_1","volume-title":"A bridging model for parallel computation. CACM 33 (Aug","author":"Valiant Leslie G.","year":"1990","unstructured":"Leslie G. Valiant . 1990. A bridging model for parallel computation. CACM 33 (Aug . 1990 ), 103-111. Issue 8. Leslie G. Valiant. 1990. A bridging model for parallel computation. CACM 33 (Aug. 1990), 103-111. Issue 8."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935787"}],"event":{"name":"PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Philadelphia PA USA","acronym":"PLDI '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3192366.3192391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:07:53Z","timestamp":1750198073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":57,"alternative-id":["10.1145\/3192366.3192391","10.1145\/3192366"],"URL":"https:\/\/doi.org\/10.1145\/3192366.3192391","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3296979.3192391","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}