{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:02:35Z","timestamp":1772866955134,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/ipdps.2008.4536305","type":"proceedings-article","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T12:44:52Z","timestamp":1212756292000},"page":"1-12","source":"Crossref","is-referenced-by-count":76,"title":["Avoiding communication in sparse matrix computations"],"prefix":"10.1109","author":[{"given":"James","family":"Demmel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Hoemmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marghoob","family":"Mohiyuddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine","family":"Yelick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/0906059"},{"key":"17","first-page":"365","article-title":"data flow and storage allocation for the pdq-5 program on the philco-2000","volume":"6","author":"pfeifer","year":"1963","journal-title":"Communications of the ACM"},{"key":"18","author":"rosser","year":"1998","journal-title":"Fine-grained analysis of array computations"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1022594.1022596"},{"key":"16","author":"peir","year":"1986","journal-title":"Program partitioning and synchronization on multiprocessor systems"},{"key":"13","first-page":"704","article-title":"efficient out-of-core algorithms for linear relaxation using blocking covers (extended abstract)","author":"leiserson","year":"1993","journal-title":"IEEE Symp on Foundations of Computer Science"},{"key":"14","article-title":"time skewing: a value-based approach to optimizing for memory locality","author":"mccalpin","year":"1999"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1178597.1178605"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1111583.1111589"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301668"},{"key":"20","year":"2004","journal-title":"Getting Up to Speed The Future of Supercomputing"},{"key":"22","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45545-0_23","article-title":"rescheduling for locality in sparse matrix computations","author":"strout","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"23","author":"toledo","year":"1995","journal-title":"Quantitative performance modeling of scientific computations and creating locality in numerical algorithms"},{"key":"24","article-title":"minimizing inner product data dependence in conjugate gradient iteration","author":"van rosendale","year":"1983","journal-title":"Proc IEEE Internat Confer Parallel Processing"},{"key":"25","author":"vuduc","year":"2003","journal-title":"Automatic performance tuning of sparse matrix kernels"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362674"},{"key":"28","author":"wolf","year":"1992","journal-title":"Improving Locality and Parallelism in Nested Loops"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.845979"},{"key":"3","article-title":"a parallel variant of gmres(m)","author":"de sturler","year":"1991","journal-title":"Proc of the 13th IMACS World Congress on Computation and Applied Mathematics"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(89)90045-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73588"},{"key":"1","year":"0"},{"key":"30","article-title":"scaling the teragrid by latency tolerant application design","author":"woodward","year":"2002","journal-title":"Proc of NSF \/ Department of Energy Scaling Workshop"},{"key":"7","first-page":"21","article-title":"cache optimization for structured and unstructured grid multigrid","volume":"10","author":"douglas","year":"2000","journal-title":"Electronic Transaction on Numerical Analysis"},{"key":"6","article-title":"a ghost cell expansion method for reducing communications in solving pde problems","author":"ding","year":"2001","journal-title":"Proc of SC01"},{"key":"5","year":"0"},{"key":"4","year":"0"},{"key":"9","first-page":"326","article-title":"i\/o complexity: the red-blue pebble game","author":"hong","year":"1981","journal-title":"Proc 13th Ann ACM Symp on Theory of Computing (May 11-13 1981)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/0471478369"}],"event":{"name":"Distributed Processing Symposium (IPDPS)","location":"Miami, FL, USA","start":{"date-parts":[[2008,4,14]]},"end":{"date-parts":[[2008,4,18]]}},"container-title":["2008 IEEE International Symposium on Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4519061\/4536075\/04536305.pdf?arnumber=4536305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T04:55:11Z","timestamp":1497761711000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4536305\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2008.4536305","relation":{},"ISSN":["1530-2075"],"issn-type":[{"value":"1530-2075","type":"print"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}