{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T12:45:53Z","timestamp":1751460353569},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422327"},{"type":"electronic","value":"9783540455455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45545-0_23","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T19:01:49Z","timestamp":1195239709000},"page":"137-146","source":"Crossref","is-referenced-by-count":14,"title":["Rescheduling for Locality in Sparse Matrix Computations"],"prefix":"10.1007","author":[{"given":"Michelle Mills","family":"Strout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Carter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeanne","family":"Ferrante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Jeff Bilmes, Krste Asanovi\u0107, Chee whye Chin, and Jim Demmel. Optimizing matrix multiply using PHiPAC: a Portable, High-Performance, ANSI C coding methodology. In Proceedings of International Conference on Supercomputing, Vienna, Austria, July 1997.","DOI":"10.1145\/263580.263662"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0895479895291765","volume":"20","author":"J. W. Demmel","year":"1999","unstructured":"James W. Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, and Joseph W. H. Liu. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20(3):720\u2013755, July 1999.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Chen Ding and Ken Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the ACM SIGPLAN\u2019 99 Conference on Programming Language Design and Implementation, pages 229\u2013241, Atlanta, Georgia, May 1-4, 1999.","DOI":"10.1145\/301618.301670"},{"key":"23_CR4","unstructured":"Craig C. Douglas, Jonathan Hu, Markus Kowarschik, Ulrich R\u00fcde, and Christian Weiss. Cache Optimization for Structured and Unstructured Grid Multigrid. Electronic Transaction on Numerical Analysis, pages 21\u201340, February 2000."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Matteo Frigo and Steven G. Johnson. Fftw: An adaptive software architecture for the fit. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, page 1381, 1998.","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"Michael R. Garey, David S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237\u2013267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"23_CR7","volume-title":"Portable High Performance Programming via Architecture Cognizant Divide-and-Conquer Algorithms","author":"K. S. Gatlin","year":"2000","unstructured":"Kang Su Gatlin. Portable High Performance Programming via Architecture Cognizant Divide-and-Conquer Algorithms. Ph.d. thesis, University of California, San Diego, September 2000."},{"issue":"13-14","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1016\/S0167-8191(00)00062-4","volume":"26","author":"H. Han","year":"2000","unstructured":"Hwansoo Han and Chau-Wen Tseng. Efficient compiler and run-time support for parallel irregular reductions. Parallel Computing, 26(13-14):1861\u20131887, December 2000.","journal-title":"Parallel Computing"},{"key":"23_CR9","unstructured":"Michael Holst. Fetk = the finite element toolkit. http:\/\/www.fetk.org ."},{"key":"23_CR10","volume-title":"Optimizing the Performance of Sparse Matrix-Vector Multiply","author":"E.-J. Im","year":"2000","unstructured":"Eun-Jin Im. Optimizing the Performance of Sparse Matrix-Vector Multiply. Ph.d. thesis, University of California, Berkeley, May 2000."},{"key":"23_CR11","unstructured":"George Karypis and Vipin Kumar. Metis: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and computing Fill-Reducing Orderings of Sparse Matrices Version 4.0, 1998."},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96\u2013129, 10 January 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"John Mellor-Crummey, David Whalley, and Ken Kennedy. Improving memory hierarchy performance for irregular applications. In Proceedings of the 1999 Conference on Supercomputing, ACM SIGARCH, pages 425\u2013433, N.Y., June 20-25 1999. ACM Press.","DOI":"10.1145\/305138.305228"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Nicholas Mitchell, Larry Carter, and Jeanne Ferrante. Localizing non-affine array references. In Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques (PACT\u2019 99), pages 192\u2013202, Newport Beach, California, October 12-16, 1999. IEEE Computer Society Press.","DOI":"10.1109\/PACT.1999.807526"},{"key":"23_CR15","volume-title":"Guiding Program Transformations with Modal Performance Model. Ph.d. thesis","author":"N. Mitchell","year":"2000","unstructured":"Nick Mitchell. Guiding Program Transformations with Modal Performance Model. Ph.d. thesis, University of California, San Diego, August 2000."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"R. Clint Whaley and Jack J. Dongarra. Automatically tuned linear algebra software. In Supercomputer 98, 1998.","DOI":"10.1109\/SC.1998.10004"},{"key":"23_CR17","unstructured":"Michael J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45545-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T15:37:32Z","timestamp":1556984252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45545-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422327","9783540455455"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45545-0_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}