{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T08:08:04Z","timestamp":1787645284765,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"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":[[2013,2,23]]},"DOI":"10.1145\/2442516.2442538","type":"proceedings-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T10:23:04Z","timestamp":1361874184000},"page":"219-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Scheduling parallel programs by work stealing with private deques"],"prefix":"10.1145","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arthur","family":"Chargueraud","sequence":"additional","affiliation":[{"name":"Inria Saclay, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mike","family":"Rainey","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Umut A. Acar Arthur Chargu\u00e9raud and Mike Rainey. Technical report associated with the present paper. http:\/\/arthur.chargueraud.org\/research\/2013\/ppopp\/full.pdf  Umut A. Acar Arthur Chargu\u00e9raud and Mike Rainey. Technical report associated with the present paper. http:\/\/arthur.chargueraud.org\/research\/2013\/ppopp\/full.pdf"},{"key":"e_1_3_2_1_2_1","volume-title":"The data locality of work stealing. Theory of Computing Systems (TOCS), 35(3):321--347","author":"Acar Umut A.","year":"2002","unstructured":"Umut A. Acar , Guy E. Blelloch , and Robert D. Blumofe . The data locality of work stealing. Theory of Computing Systems (TOCS), 35(3):321--347 , 2002 . Umut A. Acar, Guy E. Blelloch, and Robert D. Blumofe. The data locality of work stealing. Theory of Computing Systems (TOCS), 35(3):321--347, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701399551"},{"key":"e_1_3_2_1_5_1","first-page":"501","volume-title":"In the Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms","author":"Blelloch Guy E.","year":"2008","unstructured":"Guy E. Blelloch , Rezaul A. Chowdhury , Phillip B. Gibbons , Vijaya Ramachandran , Shimin Chen , and Michael Kozuch . Provably good multicore cache performance for divide-and-conquer algorithms . In In the Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms , pages 501 -- 510 , 2008 . Guy E. Blelloch, Rezaul A. Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch. Provably good multicore cache performance for divide-and-conquer algorithms. In In the Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, pages 501--510, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232650"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365680"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800223.806778"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073974"},{"key":"e_1_3_2_1_13_1","volume-title":"Sun Microsystems","author":"Chase David","year":"2005","unstructured":"David Chase and Yossi Lev . Dynamic circular work-stealing deque. Technical report , Sun Microsystems , 2005 . David Chase and Yossi Lev. Dynamic circular work-stealing deque. Technical report, Sun Microsystems, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.88"},{"key":"e_1_3_2_1_15_1","volume-title":"International Symposium on, 0: 17","author":"Dandamudi Sivarama P.","year":"1997","unstructured":"Sivarama P. Dandamudi . The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems. Modeling, Analysis, and Simulation of Computer Systems , International Symposium on, 0: 17 , 1997 . Sivarama P. Dandamudi. The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems. Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, 0:17, 1997."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370581"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654113"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(86)90008-8"},{"key":"e_1_3_2_1_19_1","first-page":"94","volume-title":"Parallel Symbolic Computing","author":"Feeley Marc","year":"1992","unstructured":"Marc Feeley . A message passing implementation of lazy task creation . In Parallel Symbolic Computing , pages 94 -- 107 , 1992 . Marc Feeley. A message passing implementation of lazy task creation. In Parallel Symbolic Computing, pages 94--107, 1992."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165205"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796810000201"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2212736.2212737"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802017"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0144-5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571876"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564900"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504187"},{"key":"e_1_3_2_1_30_1","unstructured":"Intel. Cilk Plus. http:\/\/software.intel.com\/en-us\/articles\/intel-cilk-plus\/.  Intel. Cilk Plus. http:\/\/software.intel.com\/en-us\/articles\/intel-cilk-plus\/."},{"key":"e_1_3_2_1_31_1","unstructured":"Intel. Intel Xeon Processor X7550. Specifications at http:\/\/ark.intel.com\/products\/46498\/Intel-Xeon-Processor-X7550-(18M-Cache-2_00-GHz-6_40-GTs-Intel-QPI).  Intel. Intel Xeon Processor X7550. Specifications at http:\/\/ark.intel.com\/products\/46498\/Intel-Xeon-Processor-X7550-(18M-Cache-2_00-GHz-6_40-GTs-Intel-QPI)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863582"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273440.1250683"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504186"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.42124"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277687"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113401"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736055"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/45.5.561"},{"key":"e_1_3_2_1_41_1","volume-title":"Intel Software Network","author":"Tannenbaum Barry","year":"2009","unstructured":"Barry Tannenbaum . Miser - a dynamically loadable memory allocator for multi-threaded applications . Intel Software Network , 2009 . Barry Tannenbaum. Miser - a dynamically loadable memory allocator for multi-threaded applications. Intel Software Network, 2009."},{"key":"e_1_3_2_1_42_1","first-page":"291","volume-title":"ISAAC 2010","volume":"6507","author":"Tchiboukdjian Marc","year":"2010","unstructured":"Marc Tchiboukdjian , Nicolas Gast , Denis Trystram , Jean-Louis Roch , and Julien Bernard . A tighter analysis of work stealing. In Algorithms and Computation - 21st International Symposium , ISAAC 2010 , volume 6507 of LNCS, pages 291 -- 302 . Springer , 2010 . Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, Jean-Louis Roch, and Julien Bernard. A tighter analysis of work stealing. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, volume 6507 of LNCS, pages 291--302. Springer, 2010."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39707-6_13"}],"event":{"name":"PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Shenzhen China","acronym":"PPoPP '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442516.2442538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:07Z","timestamp":1750220347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":41,"alternative-id":["10.1145\/2442516.2442538","10.1145\/2442516"],"URL":"https:\/\/doi.org\/10.1145\/2442516.2442538","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2517327.2442538","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,2,23]]},"assertion":[{"value":"2013-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}