{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:37Z","timestamp":1772164057351,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,2,6]],"date-time":"2014-02-06T00:00:00Z","timestamp":1391644800000},"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":[[2014,2,6]]},"DOI":"10.1145\/2555243.2555277","type":"proceedings-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T09:23:08Z","timestamp":1391764988000},"page":"377-378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Task mapping stencil computations for non-contiguous allocations"],"prefix":"10.1145","author":[{"given":"Vitus J.","family":"Leung","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[{"name":"Knox College, Galesburg, IL, USA"}]},{"given":"Jonathan","family":"Ebbers","sequence":"additional","affiliation":[{"name":"Knox College, Galesburg, IL, USA"}]},{"given":"Stefan P.","family":"Feer","sequence":"additional","affiliation":[{"name":"3M Health Information Systems, Inc., Wallingford, CT, USA"}]},{"given":"Nickolas W.","family":"Price","sequence":"additional","affiliation":[{"name":"Knox College, Galesburg, IL, USA"}]},{"given":"Zachary D.","family":"Rhodes","sequence":"additional","affiliation":[{"name":"Allstate Corporation, Northbrook, IL, USA"}]},{"given":"Matthew","family":"Swank","sequence":"additional","affiliation":[{"name":"Knox College, Galesburg, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,2,6]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.Companion.2012.55"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713190"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. IPDPS","author":"Deveci M.","unstructured":"M. Deveci et al. Exploiting geometric partitioning in task mapping for parallel computers. In Proc. IPDPS, to appear."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188502"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995909"}],"event":{"name":"PPoPP '14: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Orlando Florida USA","acronym":"PPoPP '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2555243.2555277","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2555243.2555277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:35:04Z","timestamp":1750217704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2555243.2555277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,6]]},"references-count":5,"alternative-id":["10.1145\/2555243.2555277","10.1145\/2555243"],"URL":"https:\/\/doi.org\/10.1145\/2555243.2555277","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2692916.2555277","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,2,6]]},"assertion":[{"value":"2014-02-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}