{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:03Z","timestamp":1750306083647,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217989, CCF-1320675, CCF-1527568"],"award-info":[{"award-number":["CCF-1217989, CCF-1320675, CCF-1527568"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087572","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"351-362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1057-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15781-3_7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378573"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2812804"},{"volume-title":"Proc. ACM-SIAM SODA. 501--510","author":"Blelloch G.","key":"e_1_3_2_1_6_1","unstructured":"G. Blelloch , R. A. Chowdhury , P. Gibbons , V. Ramachandran , S. Chen , and M. Kozuch . 2008. Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms . In Proc. ACM-SIAM SODA. 501--510 . G. Blelloch, R. A. Chowdhury, P. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch. 2008. Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms. In Proc. ACM-SIAM SODA. 501--510."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.94"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9273-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378574"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.04.008"},{"key":"e_1_3_2_1_13_1","unstructured":"R. Cole and V. Ramachandran. 2011. Efficient Resource Oblivious Algorithms for Multicores. CoRR arXiv:1103.4071 [cs.DC] (2011).  R. Cole and V. Ramachandran. 2011. Efficient Resource Oblivious Algorithms for Multicores. CoRR arXiv:1103.4071 [cs.DC] (2011)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.28"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R. Cole and V. Ramachandran. 2017a. Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR arXiv:1705.08350 [cs.DC] (2017).  R. Cole and V. Ramachandran. 2017a. Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR arXiv:1705.08350 [cs.DC] (2017).","DOI":"10.1145\/3087556.3087572"},{"key":"e_1_3_2_1_17_1","volume-title":"Resource Oblivious Sorting on Multicores. ACM Trans. on Parallel Computing (TOPC) 3","author":"Cole Richard","year":"2017","unstructured":"Richard Cole and Vijaya Ramachandran . 2017b. Resource Oblivious Sorting on Multicores. ACM Trans. on Parallel Computing (TOPC) 3 ( 2017 ). Article 23. Richard Cole and Vijaya Ramachandran. 2017b. Resource Oblivious Sorting on Multicores. ACM Trans. on Parallel Computing (TOPC) 3 (2017). Article 23."},{"key":"e_1_3_2_1_18_1","unstructured":"T. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms Third Edition. MIT Press.  T. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms Third Edition. MIT Press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9098-2"},{"key":"e_1_3_2_1_21_1","unstructured":"Y. Gao I. Zhao R. Barik R. Raman and V. Sarkar. 2009. Work-first and help-first scheduling policies for async-finish task parallelism. In IEEE IPDPS.  Y. Gao I. Zhao R. Barik R. Raman and V. Sarkar. 2009. Work-first and help-first scheduling policies for async-finish task parallelism. In IEEE IPDPS."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"N. Sitchinava and N. Zeh. 2012. A parallel buffer heap. In ACM SPAA. 214--223.  N. Sitchinava and N. Zeh. 2012. A parallel buffer heap. In ACM SPAA. 214--223.","DOI":"10.1145\/2312005.2312046"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_2"}],"event":{"name":"SPAA '17: 29th 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","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087572","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:13Z","timestamp":1750217413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087572"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":23,"alternative-id":["10.1145\/3087556.3087572","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087572","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}