{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:40Z","timestamp":1763468020368,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989553","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"355-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Scheduling irregular parallel computations on hierarchical caches"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Intel Labs Pittsburgh, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harsha Vardhan","family":"Simhadri","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/341800.341801"},{"key":"e_1_3_2_1_2_1","volume-title":"The uniform memory hierarchy model of computation. Algorithmica, 12","author":"Alpern B.","year":"1994","unstructured":"B. Alpern , L. Carter , E. Feig , and T. Selker . The uniform memory hierarchy model of computation. Algorithmica, 12 , 1994 . B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12, 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/PMMP.1993.315548"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378573"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074009"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370243"},{"key":"e_1_3_2_1_7_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_8_1","volume-title":"A cache-oblivious model for parallel memory hierarchies","author":"Blelloch G. E.","year":"2010","unstructured":"G. E. Blelloch , J. T. Fineman , P. B. Gibbons , and H. V. Simhadri . A cache-oblivious model for parallel memory hierarchies . Technical Report Carnegie Mellon University-CS-10--154, Computer Science Department, Carnegie Mellon University , 2010 . G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and H. V. Simhadri. A cache-oblivious model for parallel memory hierarchies. Technical Report Carnegie Mellon University-CS-10--154, Computer Science Department, Carnegie Mellon University, 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007948"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.661333"},{"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 scheduling of multicore algorithms. manuscript","author":"Cole R.","year":"2010","unstructured":"R. Cole and V. Ramachandran . Efficient resource oblivious scheduling of multicore algorithms. manuscript , 2010 . R. Cole and V. Ramachandran. Efficient resource oblivious scheduling of multicore algorithms. manuscript, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880944"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , 2 nd Edition. MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition. MIT Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/173284.155333"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646669.701085"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148157"},{"key":"e_1_3_2_1_22_1","volume-title":"Algorithms for Memory Hierarchies","author":"Kumar P.","year":"2003","unstructured":"P. Kumar . Cache oblivious algorithms. In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies . Springer , 2003 . P. Kumar. Cache oblivious algorithms. In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies. Springer, 2003."},{"key":"e_1_3_2_1_23_1","author":"Leiserson C. E.","year":"1985","unstructured":"C. E. Leiserson . Fat-Trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C--34(10) , 1985 . C. E. Leiserson. Fat-Trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C--34(10), 1985.","journal-title":"IEEE Transactions on Computers, C--34(10)"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_2"}],"event":{"name":"SPAA '11: 23rd 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":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989553","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:54Z","timestamp":1750244754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":25,"alternative-id":["10.1145\/1989493.1989553","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989553","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}