{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:49Z","timestamp":1763468209610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"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-1018188","CCF-1314590","CCF-1314633"],"award-info":[{"award-number":["CCF-1018188","CCF-1314590","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.2612678","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"30-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Experimental analysis of space-bounded schedulers"],"prefix":"10.1145","author":[{"given":"Harsha Vardhan","family":"Simhadri","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Intel Labs Pittsburgh, Pittsburgh, PA, USA"}]},{"given":"Aapo","family":"Kyrola","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The data locality of work stealing. Theory Comp. Sys., 35(3)","author":"Acar U. A.","year":"2002","unstructured":"U. A. Acar , G. E. Blelloch , and R. D. Blumofe . The data locality of work stealing. Theory Comp. Sys., 35(3) , 2002 . U. A. Acar, G. E. Blelloch, and R. D. Blumofe. The data locality of work stealing. Theory Comp. Sys., 35(3), 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/PMMP.1993.315548"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_4_1","volume-title":"SODA","author":"Blelloch G. E.","year":"2008","unstructured":"G. E. Blelloch , R. A. Chowdhury , P. B. Gibbons , V. Ramachandran , S. Chen , and M. Kozuch . Provably good multicore cache performance for divide-and-conquer algorithms . In SODA , 2008 . G. E. Blelloch, R. A. Chowdhury, P. B. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch. Provably good multicore cache performance for divide-and-conquer algorithms. In SODA, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492408.2492417"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301974"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237574"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248392"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378574"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470354"},{"key":"e_1_3_2_1_15_1","volume-title":"Efficient resource oblivious algorithms for multicores. Arxiv preprint arXiv.11034071","author":"Cole R.","year":"2011","unstructured":"R. Cole and V. Ramachandran . Efficient resource oblivious algorithms for multicores. Arxiv preprint arXiv.11034071 , 2011 . R. Cole and V. Ramachandran. Efficient resource oblivious algorithms for multicores. Arxiv preprint arXiv.11034071, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188543"},{"key":"e_1_3_2_1_17_1","unstructured":"Intel. Intel Cilk  Intel. Intel Cilk"},{"key":"e_1_3_2_1_18_1","unstructured":"SDK programmer's guide. https:\/\/www.clear.rice.edu\/comp422\/resources\/Intel_Cilk  SDK programmer's guide. https:\/\/www.clear.rice.edu\/comp422\/resources\/Intel_Cilk"},{"key":"e_1_3_2_1_19_1","unstructured":"SDK programmer's guide.   _Programmers_Guide.pdf 2009."},{"key":"e_1_3_2_1_20_1","unstructured":"Intel. Intel Thread Building Blocks reference manual. http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/tbb_sa\/help\/index.htm\\#reference\/reference.htm 2013. Version 4.1.  Intel. Intel Thread Building Blocks reference manual. http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/tbb_sa\/help\/index.htm\\#reference\/reference.htm 2013. Version 4.1."},{"key":"e_1_3_2_1_21_1","unstructured":"Intel. Performance counter monitor (PCM). http:\/\/www.intel.com\/software\/pcm 2013. Version 2.4.  Intel. Performance counter monitor (PCM). http:\/\/www.intel.com\/software\/pcm 2013. Version 2.4."},{"key":"e_1_3_2_1_22_1","volume-title":"Implementation and usage of a thread pool based on posix threads. www.hlnum.org\/english\/projects\/tools\/threadpool\/doc.html","author":"Kriemann R.","year":"2004","unstructured":"R. Kriemann . Implementation and usage of a thread pool based on posix threads. www.hlnum.org\/english\/projects\/tools\/threadpool\/doc.html , 2004 . R. Kriemann. Implementation and usage of a thread pool based on posix threads. www.hlnum.org\/english\/projects\/tools\/threadpool\/doc.html, 2004."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_3_2_1_24_1","unstructured":"C. Leiserson. The Cilk  C. Leiserson. The Cilk"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"e_1_3_2_1_26_1","unstructured":"Microsoft. Task Parallel Library. http:\/\/msdn.microsoft.com\/en-us\/library\/dd460717.aspx 2013. .NET version 4.5.  Microsoft. Task Parallel Library. http:\/\/msdn.microsoft.com\/en-us\/library\/dd460717.aspx 2013. .NET version 4.5."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/305619.305629"},{"key":"e_1_3_2_1_28_1","volume-title":"May","author":"Architecture Review Board MP","year":"2008","unstructured":"Open MP Architecture Review Board . Open MP API. http:\/\/www.openmp.org\/mp-documents\/spec30.pdf , May 2008 . v 3.0. OpenMP Architecture Review Board. OpenMP API. http:\/\/www.openmp.org\/mp-documents\/spec30.pdf, May 2008. v 3.0."},{"key":"e_1_3_2_1_29_1","unstructured":"Perfmon2. libpfm. http:\/\/perfmon2.sourceforge.net\/ 2012.  Perfmon2. libpfm. http:\/\/perfmon2.sourceforge.net\/ 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887695.1887719"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_1_32_1","volume-title":"Carnegie Mellon University","author":"Simhadri H. V.","year":"2013","unstructured":"H. V. Simhadri . Program-Centric Cost Models for Locality and Parallelism. PhD thesis , Carnegie Mellon University , 2013 . H. V. Simhadri. Program-Centric Cost Models for Locality and Parallelism. PhD thesis, Carnegie Mellon University, 2013."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584019"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_2"}],"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.2612678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612678","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.2612678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":34,"alternative-id":["10.1145\/2612669.2612678","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612678","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"}}]}}