{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:12:23Z","timestamp":1744697543623},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401964"},{"type":"electronic","value":"9783540448631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44863-2_69","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T13:45:55Z","timestamp":1192887955000},"page":"705-714","source":"Crossref","is-referenced-by-count":5,"title":["Memory Hierarchy Optimizations and Performance Bounds for Sparse A T Ax"],"prefix":"10.1007","author":[{"given":"Richard","family":"Vuduc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"Gyulassy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James W.","family":"Demmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine A.","family":"Yelick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"5","key":"69_CR1","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1137\/S009753979529595X","volume":"28","author":"A.J.C. Bik","year":"1999","unstructured":"A.J.C. Bik and H.A.G. Wijsho.. Automatic nonzero structure analysis. SIAM Journal on Computing, 28(5):1576\u20131587, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"J. Bilmes, K. Asanovi\u0107, C. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In Proceedings of the International Conference on Supercomputing, July 1997.","DOI":"10.1145\/263580.263662"},{"key":"69_CR3","unstructured":"S. Blackford et al. Document for the Basic Linear Algebra Subprograms (BLAS) standard: BLAS Technical Forum, 2001. Chapter 3: http:\/\/www.netlib.org\/blast ."},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"S. Browne, J. Dongarra, N. Garner, K. London, and P. Mucci. A scalable crossplatform infrastructure for application performance tuning using hardware counters. In Proceedings of Supercomputing, November 2000.","DOI":"10.1109\/SC.2000.10029"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"J.W. Demmel. Applied Numerical Linear Algebra. SIAM, 1997.","DOI":"10.1137\/1.9781611971446"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"B.B. Fraguela, R. Doallo, and E.L. Zapata. Memory hierarchy performance prediction for sparse blocked algorithms. Parallel Processing Letters, 9(3), 1999.","DOI":"10.1142\/S0129626499000323"},{"key":"69_CR7","doi-asserted-by":"crossref","unstructured":"W.D. Gropp, D.K. Kasushik, D.E. Keyes, and B.F. Smith. Towards realistic bounds for implicit CFD codes. In Proceedings of Parallel Computational Fluid Dynamics, pages 241\u2013248, 1999.","DOI":"10.1016\/B978-044482851-4.50030-X"},{"key":"69_CR8","unstructured":"G. Heber, A.J. Dolgert, M. Alt, K.A. Mazurkiewicz, and L. Stringer. Fracture mechanics on the intel itanium architecture: A case study. In Workshop on EPIC Architectures and Compiler Technology (ACM MICRO 34), Austin, TX, 2001."},{"key":"69_CR9","doi-asserted-by":"crossref","unstructured":"E.-J. Im and K.A. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. In Proceedings of ICCS, pages 127\u2013136, May 2001.","DOI":"10.1007\/3-540-45545-0_22"},{"issue":"5","key":"69_CR10","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"J.M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5): 604\u2013632, 1999.","journal-title":"Journal of the ACM"},{"key":"69_CR11","unstructured":"Y. Saad. SPARSKIT: A basic toolkit for sparse matrix computations, 1994. http:\/\/www.cs.umn.edu\/Research\/arpa\/SPARSKIT\/sparskit.html ."},{"key":"69_CR12","unstructured":"P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997."},{"key":"69_CR13","doi-asserted-by":"crossref","unstructured":"O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. In Proceedings of Supercomputing\u2019 92, 1992.","DOI":"10.1109\/SUPERC.1992.236646"},{"key":"69_CR14","doi-asserted-by":"crossref","unstructured":"R. Vuduc, J.W. Demmel, K.A. Yelick, S. Kamil, R. Nishtala, and B. Lee. Performance optimizations and bounds for sparse matrix-vector multiply. In Proceedings of Supercomputing, Baltimore, MD, USA, November 2002.","DOI":"10.1109\/SC.2002.10025"},{"key":"69_CR15","series-title":"Technical Report","volume-title":"Memory hierarchy optimizations and performance bounds for sparse ATAx","author":"R. Vuduc","year":"2003","unstructured":"R. Vuduc, A. Gyulassy, J.W. Demmel, and K.A. Yelick. Memory hierarchy optimizations and performance bounds for sparse ATAx. Technical Report UCB\/CS-03-1232, University of California, Berkeley, February 2003."},{"key":"69_CR16","unstructured":"R. Vuduc, S. Kamil, J. Hsu, R. Nishtala, J.W. Demmel, and K.A. Yelick. Automatic performance tuning and analysis of sparse triangular solve. In ICS 2002: POHLL Workshop, New York, USA, June 2002."},{"key":"69_CR17","series-title":"Technical Report","volume-title":"Adaptive use of iterative methods in interior point methods for linear programming","author":"W. Wang","year":"1995","unstructured":"W. Wang and D.P. O\u2019Leary. Adaptive use of iterative methods in interior point methods for linear programming. Technical Report UMIACS-95-111, University of Maryland at College Park, College Park, MD, USA, 1995."},{"key":"69_CR18","doi-asserted-by":"crossref","unstructured":"C. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Proc. of Supercomp., Orlando, FL, 1998.","DOI":"10.1109\/SC.1998.10004"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44863-2_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T18:07:18Z","timestamp":1556906838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44863-2_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401964","9783540448631"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44863-2_69","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}