{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:45Z","timestamp":1750307385275,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,2]],"date-time":"2010-06-02T00:00:00Z","timestamp":1275436800000},"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":["ST-HEC-0444285CPA-0702245CPA-0811587CNS-0915414"],"award-info":[{"award-number":["ST-HEC-0444285CPA-0702245CPA-0811587CNS-0915414"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["ST-HEC-0444285CPA-0702245CPA-0811587CNS-0915414"],"award-info":[{"award-number":["ST-HEC-0444285CPA-0702245CPA-0811587CNS-0915414"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,2]]},"DOI":"10.1145\/1810085.1810124","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"285-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A compiler-automated array compression scheme for optimizing memory intensive programs"],"prefix":"10.1145","author":[{"given":"Lixia","family":"Liu","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}]},{"given":"Zhiyuan","family":"Li","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}]}],"member":"320","published-online":{"date-parts":[[2010,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362674"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366230.1366244"},{"volume-title":"NASA Ames Research Center","year":"1999","author":"Jin H.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","volume-title":"NA Digest","volume":"97","author":"Davis","year":"1997"},{"key":"e_1_3_2_1_5_1","first-page":"214","volume-title":"Proceedings of the Second Object Oriented Numerics Conference","author":"Jack Dongarra","year":"1994"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183444"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375579"},{"volume-title":"International Symposium on Code Generation and Optimization (CGO)","year":"2007","author":"Open","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","unstructured":"Youcef Saad. SPARSKIT: a basic tool-kit for sparse matrix computations. Technique report Computer Science Department University of Minnesota Minneapolis MN 55455 June 1994. Version 2  Youcef Saad. SPARSKIT: a basic tool-kit for sparse matrix computations. Technique report Computer Science Department University of Minnesota Minneapolis MN 55455 June 1994. Version 2"},{"volume-title":"Vetter. Characterization of Scientific Workloads on Systems with Multi-Core Processors. In International Symposium on Workload Characterization. IISWC'06 225--236","author":"Sadaf R.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2007.119"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237727"},{"key":"e_1_3_2_1_13_1","unstructured":"Lili Ju. MGMRES: Restarted GMRES solver for sparse linear systems. http:\/\/people.sc.fsu.edu\/~burkardt\/c_src\/mgmres\/mgmres.html.  Lili Ju. MGMRES: Restarted GMRES solver for sparse linear systems. http:\/\/people.sc.fsu.edu\/~burkardt\/c_src\/mgmres\/mgmres.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.07.005"},{"key":"e_1_3_2_1_15_1","unstructured":"Jack Dongarra Victor Eijkhout. SparseBench: a sparse iterative benchmark. http:\/\/www.netlib.org\/benchmark\/sparsebench\/  Jack Dongarra Victor Eijkhout. SparseBench: a sparse iterative benchmark. http:\/\/www.netlib.org\/benchmark\/sparsebench\/"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231133"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.150"},{"key":"e_1_3_2_1_19_1","unstructured":"Zukowski M. 2009. Balancing vectorized query execution with bandwidth-optimized storage. Ph.D thesis University of Amsterdam.  Zukowski M. 2009. Balancing vectorized query execution with bandwidth-optimized storage. Ph.D thesis University of Amsterdam."}],"event":{"name":"ICS'10: International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Tsukuba Ibaraki Japan","acronym":"ICS'10"},"container-title":["Proceedings of the 24th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810085.1810124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810085.1810124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:24Z","timestamp":1750245804000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810085.1810124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,2]]},"references-count":18,"alternative-id":["10.1145\/1810085.1810124","10.1145\/1810085"],"URL":"https:\/\/doi.org\/10.1145\/1810085.1810124","relation":{},"subject":[],"published":{"date-parts":[[2010,6,2]]},"assertion":[{"value":"2010-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}