{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:39Z","timestamp":1763468199393,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1340571","CCF-1218188","CCF-1150036","CCF-1218017","CCF-1314633"],"award-info":[{"award-number":["CCF-1340571","CCF-1218188","CCF-1150036","CCF-1218017","CCF-1314633"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612688","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"84-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Provably good scheduling for parallel programs that use data structures through implicit batching"],"prefix":"10.1145","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, USA"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"Kefu","family":"Lu","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, USA"}]},{"given":"Brendan","family":"Sheridan","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"Jim","family":"Sukha","sequence":"additional","affiliation":[{"name":"Intel Corporation, , USA"}]},{"given":"Robert","family":"Utterback","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693487"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007933"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_7_1","unstructured":"A. Braginsky and E. Petrank. A lock-free B  A. Braginsky and E. Petrank. A lock-free B"},{"key":"e_1_3_2_1_8_1","first-page":"58","volume-title":"Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","year":"2012","unstructured":"tree. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) , pages 58 -- 67 , 2012 . tree. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 58--67, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810538"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880944"},{"key":"e_1_3_2_1_12_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , third edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645727.667677"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/50087.50096"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_10"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_17_1","first-page":"49","volume-title":"Euro-Par Workshops","volume":"4854","author":"Frias L.","year":"2007","unstructured":"L. Frias and J. Singler . Parallelization of bulk operations for STL dictionaries . In Euro-Par Workshops , volume 4854 of LNCS, pages 49 -- 58 . Springer , 2007 . L. Frias and J. Singler. Parallelization of bulk operations for STL dictionaries. In Euro-Par Workshops, volume 4854 of LNCS, pages 49--58. Springer, 2007."},{"key":"e_1_3_2_1_18_1","unstructured":"M. Frigo P. Halpern C. E. Leiserson and S. Lewin-Berlin. Reducers and other Cilk  M. Frigo P. Halpern C. E. Leiserson and S. Lewin-Berlin. Reducers and other Cilk"},{"key":"e_1_3_2_1_19_1","first-page":"79","volume-title":"Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","year":"2009","unstructured":"hyperobjects. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) , pages 79 -- 90 , Aug. 2009 . hyperobjects. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 79--90, Aug. 2009."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/70082.68188"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161469"},{"key":"e_1_3_2_1_26_1","volume-title":"Morgan Kaufmann","author":"Herlihy M.","year":"2008","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming . Morgan Kaufmann , 2008 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_28_1","first-page":"324396","article-title":"Intel Cilk Plus Language Extension Specification","volume":"1","author":"Intel Corporation","year":"2013","unstructured":"Intel Corporation . Intel Cilk Plus Language Extension Specification , Version 1 . 1 , 2013 . Document 324396 - 324002 US. Available from http:\/\/cilkplus.org\/sites\/default\/files\/open_specifications\/Intel_Cilk_plus_lang_spec_2.htm. Intel Corporation. Intel Cilk Plus Language Extension Specification, Version 1.1, 2013. Document 324396-002US. Available from http:\/\/cilkplus.org\/sites\/default\/files\/open_specifications\/Intel_Cilk_plus_lang_spec_2.htm.","journal-title":"Version 1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/151284.151286"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125861"},{"key":"e_1_3_2_1_32_1","unstructured":"OpenMP Architecture Review Board. OpenMP specification and features. http:\/\/openmp.org\/wp\/ May 2008.  OpenMP Architecture Review Board. OpenMP specification and features. http:\/\/openmp.org\/wp\/ May 2008."},{"key":"e_1_3_2_1_33_1","first-page":"182","volume-title":"Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA)","author":"Oyama Y.","year":"1999","unstructured":"Y. Oyama , K. Taura , and A. Yonezawa . Executing parallel programs with synchronization bottlenecks efficiently . In Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA) , pages 182 -- 204 , 1999 . Y. Oyama, K. Taura, and A. Yonezawa. Executing parallel programs with synchronization bottlenecks efficiently. In Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA), pages 182--204, 1999."},{"key":"e_1_3_2_1_34_1","first-page":"14","volume-title":"Int. Conference on Parallel Processing","author":"Paige R. C.","year":"1985","unstructured":"R. C. Paige and C. P. Kruskal . Parallel algorithms for shortest path problems . In Int. Conference on Parallel Processing , pages 14 -- 20 , 1985 . R. C. Paige and C. P. Kruskal. Parallel algorithms for shortest path problems. In Int. Conference on Parallel Processing, pages 14--20, 1985."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/646237.683018"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254127"},{"key":"e_1_3_2_1_37_1","unstructured":"J. Reinders. Intel Threading Building Blocks: Outfitting C   J. Reinders. Intel Threading Building Blocks: Outfitting C"},{"key":"e_1_3_2_1_38_1","unstructured":"for Multi-Core Processor Parallelism. O'Reilly 2007.  for Multi-Core Processor Parallelism. O'Reilly 2007."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1429"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/235543.235546"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1621"},{"key":"e_1_3_2_1_42_1","volume-title":"Oct.","author":"Parallel Library The Task","year":"2007","unstructured":"The Task Parallel Library . http:\/\/msdn.microsoft.com\/en-us\/magazine\/cc163340.aspx , Oct. 2007 . The Task Parallel Library. http:\/\/msdn.microsoft.com\/en-us\/magazine\/cc163340.aspx, Oct. 2007."}],"event":{"name":"SPAA '14: 26th 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"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":42,"alternative-id":["10.1145\/2612669.2612688","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612688","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}