{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:12Z","timestamp":1763467992545,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,3]],"date-time":"2010-07-03T00:00:00Z","timestamp":1278115200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10766-010-0145-2","type":"journal-article","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T12:05:33Z","timestamp":1278072333000},"page":"62-87","source":"Crossref","is-referenced-by-count":8,"title":["A Library for Pattern-based Sparse Matrix Vector Multiply"],"prefix":"10.1007","volume":"39","author":[{"given":"Mehmet","family":"Belgin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Godmar","family":"Back","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Calvin J.","family":"Ribbens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,3]]},"reference":[{"key":"145_CR1","unstructured":"BOOST C++ Libraries. URL http:\/\/www.boost.org"},{"key":"145_CR2","unstructured":"Standard Template Library Programmer\u2019s Guide. URL http:\/\/www.sgi.com\/tech\/stl\/"},{"key":"145_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, R.C., Gustavson, F.G., Zubair, M.: A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In: Supercomputing \u201992: Proceedings of the 1992 ACM\/IEEE conference on Supercomputing, pp. 32\u201341. IEEE Computer Society Press, Los Alamitos, CA, USA (1992)","DOI":"10.1109\/SUPERC.1992.236712"},{"key":"145_CR4","doi-asserted-by":"crossref","unstructured":"Antoulas, A., Sorensen, D., Gugercin, S.: A survey of model reduction methods for large-scale systems. In: Structured Matrices in Operator Theory, Numerical Analysis, Control, Signal and Image Processing, Contemporary Mathematics, 280, pp. 193\u2013219. AMS Publications (2001)","DOI":"10.1090\/conm\/280\/04630"},{"key":"145_CR5","unstructured":"Belgin, M., Back, G., Ribbens, C.J.: Pattern-based sparse matrix representation for memory-efficient SMVM kernels. In: Gschwind, M., Nicolau, A., Salapura, V., Moreira, J. (eds.) ICS\u201909: Proceedings of the 23rd International Conference on Supercomputing, Yorktown Heights, NY, USA, June 8\u201312, 2009, pp. 100\u2013109. ACM (2009). URL http:\/\/doi.acm.org\/10.1145\/1542275.1542294"},{"key":"145_CR6","doi-asserted-by":"crossref","unstructured":"Bik, A.J.C., Wijshoff, H.A.G.: Compilation techniques for sparse matrix computations. In: Proceedings of the 1993 International Conference on Supercomputing, pp. 416\u2013424. ACM Press (1993)","DOI":"10.1145\/165939.166023"},{"key":"145_CR7","unstructured":"Blelloch, G.E., Heroux, M.A., Zagha, M.: Segmented operations for sparse matrix computation on vector multiprocessors. Tech. rep., Carnegie-Mellon University (1993)"},{"key":"145_CR8","unstructured":"Davis, T.: The University of Florida sparse matrix collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"key":"145_CR9","doi-asserted-by":"crossref","unstructured":"D\u2019Azevedo, E.F., Fahey, M.R., Mills, R.T.: Vectorized sparse matrix multiply for compressed row storage format. In: International Conference on Computational Science (2005)","DOI":"10.1007\/11428831_13"},{"key":"145_CR10","doi-asserted-by":"crossref","unstructured":"Fukui, Y., Yoshida, H., Higono, S.: Supercomputing of circuits simulation. In: Supercomputing \u201989: Proceedings of the 1989 ACM\/IEEE Conference on Supercomputing, pp. 81\u201385. ACM, New York, NY, USA (1989). doi: 10.1145\/76263.76272","DOI":"10.1145\/76263.76272"},{"key":"145_CR11","unstructured":"Geus, R., R\u00f6llin, S.: Towards a fast parallel sparse symmetric matrix-vector multiplication. Parallel Computing 27(7), 883\u2013896 (2001). doi: 10.1016\/S0167-8191(01)00073-4 . URL http:\/\/www.sciencedirect.com\/science\/article\/B6V12-430G3NG-3\/2\/f5bd2afe4dc99c1e7dca40af04255712"},{"issue":"5746","key":"145_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1126\/science.1115255","volume":"310","author":"T. Gneiting","year":"2005","unstructured":"Gneiting T., Raftery A.E.: Weather forecasting with ensemble methods. Science (Washington, DC) 310(5746), 248 (2005)","journal-title":"Science (Washington, DC)"},{"key":"145_CR13","doi-asserted-by":"crossref","unstructured":"Goumas, G., Kourtis, K., Anastopoulos, N., Karakasis, V., Koziris, N.: Understanding the performance of sparse matrix-vector multiplication. In: PDP \u201908: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), pp. 283\u2013292. IEEE Computer Society, Washington, DC, USA (2008). doi: 10.1109\/PDP.2008.41","DOI":"10.1109\/PDP.2008.41"},{"key":"145_CR14","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Shipman, G.M., Barrett, B.W., Castain, R.H., Bosilca, G., Lumsdaine, A.: Open MPI: A high-performance, heterogeneous MPI. In: Proceedings, Fifth International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks. Barcelona, Spain (2006)","DOI":"10.1109\/CLUSTR.2006.311904"},{"key":"145_CR15","doi-asserted-by":"crossref","unstructured":"Gugercin, S., Antoulas, A.C., Beattie, C.: $${\\mathcal{H}_2}$$ model reduction for large-scale linear dynamical systems. SIAM J. Matrix Anal. Appl. 30(2), 609\u2013638 (2008). doi: 10.1137\/060666123 . URL http:\/\/link.aip.org\/link\/?SML\/30\/609\/1","DOI":"10.1137\/060666123"},{"issue":"1","key":"145_CR16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/321556.321565","volume":"17","author":"F.G. Gustavson","year":"1970","unstructured":"Gustavson F.G., Liniger W., Willoughby R.: Symbolic generation of an optimal crout algorithm for sparse systems of linear equations. J. ACM 17(1), 87\u2013109 (1970). doi: 10.1145\/321556.321565","journal-title":"J. ACM"},{"key":"145_CR17","doi-asserted-by":"crossref","unstructured":"Im, E.J., Yelick, K.A.: Optimizing sparse matrix computations for register reuse in sparsity. In: ICCS \u201901: Proceedings of the International Conference on Computational Sciences-Part I, pp. 127\u2013136. Springer, London, UK (2001)","DOI":"10.1007\/3-540-45545-0_22"},{"issue":"1","key":"145_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1177\/1094342004041296","volume":"18","author":"E.J. Im","year":"2004","unstructured":"Im E.J., Yelick K.A., Vuduc R.: SPARSITY: Framework for optimizing sparse matrix-vectormultiply. Int. J. High Perform. Comput. Appl. 18(1), 135\u2013158 (2004)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"145_CR19","doi-asserted-by":"crossref","unstructured":"James B. White, I., Sadayappan, P.: On improving the performance of sparse matrix-vector multiplication. In: HIPC \u201997: Proceedings of the Fourth International Conference on High-Performance Computing, p. 66. IEEE Computer Society, Washington, DC, USA (1997)","DOI":"10.1109\/HIPC.1997.634472"},{"key":"145_CR20","doi-asserted-by":"crossref","unstructured":"Kourtis, K., Goumas, G., Koziris, N.: Optimizing sparse matrix-vector multiplication using index and value compression. In: CF \u201908: Proceedings of the 2008 conference on computing frontiers, pp. 87\u201396. ACM, New York, NY, USA (2008). doi: 10.1145\/1366230.1366244","DOI":"10.1145\/1366230.1366244"},{"key":"145_CR21","unstructured":"Lee, B.C., Vuduc, R.W., Demmel, J.W., Yelick, K.A.: Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply. In: ICPP \u201904: Proceedings of the 2004 International Conference on Parallel Processing, pp. 169\u2013176. IEEE Computer Society, Washington, DC, USA (2004). doi: 10.1109\/ICPP.2004.58"},{"issue":"2","key":"145_CR22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1177\/1094342004038951","volume":"18","author":"J. Mellor-Crummey","year":"2004","unstructured":"Mellor-Crummey J., Garvin J.: Optimizing sparse matrix-vector product computations using unroll and jam. Int. J. High Perform. Comput. Appl. 18(2), 225\u2013236 (2004). doi: 10.1177\/1094342004038951","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"13","key":"145_CR23","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1002\/jcc.20081","volume":"25","author":"H. Merlitz","year":"2004","unstructured":"Merlitz H., Herges T., Wenzel W.: Fluctuation analysis and accuracy of a large-scale in silico screen. J. Comput. Chem. 25(13), 1568 (2004)","journal-title":"J. Comput. Chem."},{"key":"145_CR24","unstructured":"Meuer, H., Strohmaier, E., Dongarra, J., Simon, H.: Top500 supercomputing sites (2010). http:\/\/www.top500.org\/"},{"key":"145_CR25","unstructured":"Nishtala, R., Vuduc, R., Demmel, J., Yelick, K.: Performance modeling and analysis of cache blocking in sparse matrix vector multiply. Tech. rep., Berkeley, EECS Dept. (2004). URL citeseer.ist.psu.edu\/article\/nishtala04performance.html"},{"key":"145_CR26","unstructured":"Nishtala, R., Vuduc, R., Demmel, J.W., Yelick, K.A.: When cache blocking sparse matrix vector multiply works and why. In: Proceedings of the PARA\u201904: Workshop on the State-of-the-art in Scientific Computing (2004)"},{"key":"145_CR27","doi-asserted-by":"crossref","unstructured":"Park, S.C., Draayer, J.P., Zheng, S.Q.: An efficient algorithm for sparse matrix computations. In: SAC \u201992: Proceedings of the 1992 ACM\/SIGAPP symposium on Applied computing, pp. 919\u2013926. ACM, New York, NY, USA (1992). doi: 10.1145\/130069.130108","DOI":"10.1145\/130069.130108"},{"key":"145_CR28","doi-asserted-by":"crossref","unstructured":"Pinar, A., Heath, M.T.: Improving performance of sparse matrix-vector multiplication. In: Proceedings of Supercomputing\u201999 (CD-ROM). ACM SIGARCH and IEEE, Portland, OR (1999)","DOI":"10.1145\/331532.331562"},{"key":"145_CR29","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. Graph Theory Comput., pp. 183\u2013217 (1973)","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"145_CR30","doi-asserted-by":"crossref","unstructured":"Temam, O., Jalby, W.: Characterizing the behavior of sparse algorithms on caches. In: In Proceedings of Supercomputing 92, pp. 578\u2013587 (1992)","DOI":"10.1109\/SUPERC.1992.236646"},{"key":"145_CR31","unstructured":"Toledo, S.: Improving the memory-system performance of sparse-matrix vector multiplication. IBM J. Res. Dev. 41(6), 711\u2013725 (1997). URL http:\/\/citeseer.ist.psu.edu\/toledo97improving.html"},{"key":"145_CR32","unstructured":"Vuduc, R.: Automatic performance tuning of sparse matrix kernels. Ph.D. thesis, Univerity of California, Berkeley (2003). URL citeseer.ist.psu.edu\/vuduc03automatic.html"},{"key":"145_CR33","doi-asserted-by":"crossref","unstructured":"Vuduc, R., Demmel, J.W., Yelick, K.A.: OSKI: A library of automatically tuned sparse matrix kernels. In: Proceedings of SciDAC 2005, J. Phys.: Conference Series. Institute of Physics Publishing, San Francisco, CA, USA (2005)","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"145_CR34","unstructured":"Vuduc, R., Kamil, S., Hsu, J., Nishtala, R., Demmel, J.W., Yelick, K.A.: Automatic performance tuning and analysis of sparse triangular solve. In: ICS 2002: Workshop on Performance Optimization via High-Level Languages and Libraries (2002)"},{"key":"145_CR35","unstructured":"Vuduc, R.W., Moon, H.J.: Fast sparse matrix-vector multiplication by exploiting variable block structure. In: High Performance Computing and Communcations, Lecture Notes Comput. Sci., 3726, 807\u2013816. Springer (2005). URL http:\/\/dx.doi.org\/10.1007\/11557654_91 . Editors: Laurence Tianruo Yang and Omer F. Rana and Beniamino Di Martino and Jack Dongarra"},{"key":"145_CR36","doi-asserted-by":"crossref","unstructured":"Willcock, J., Lumsdaine, A.: Accelerating sparse matrix computations via data compression. In: ICS \u201906: Proceedings of the 20th annual international conference on Supercomputing, pp. 307\u2013316. ACM Press, New York, NY, USA (2006). doi: 10.1145\/1183401.1183444","DOI":"10.1145\/1183401.1183444"},{"key":"145_CR37","doi-asserted-by":"crossref","unstructured":"Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., Demmel, J.: Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In: SC \u201907: Proceedings of the 2007 ACM\/IEEE conference on Supercomputing, pp. 1\u201312. ACM, New York, NY, USA (2007). doi: 10.1145\/1362622.1362674","DOI":"10.1145\/1362622.1362674"},{"key":"145_CR38","unstructured":"Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., Demmel, J.: Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Comput. 35(3), 178\u2013194 (2009). doi: 10.1016\/j.parco.2008.12.006 . URL http:\/\/www.sciencedirect.com\/science\/article\/B6V12-4V7643Y-1\/2\/1abb45bf37ef1e2c25765dc0fc6b45a3 . Revolutionary Technologies for Acceleration of Emerging Petascale Applications"},{"issue":"1","key":"145_CR39","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"W.A. Wul","year":"1995","unstructured":"Wul W.A., McKee S.A.: Hitting the memory wall: implications of the obvious. SIGARCH Comput. Archit. News 23(1), 20\u201324 (1995). doi: 10.1145\/216585.216588","journal-title":"SIGARCH Comput. Archit. News"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-010-0145-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-010-0145-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-010-0145-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T14:20:09Z","timestamp":1740234009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-010-0145-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,3]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s10766-010-0145-2","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2010,7,3]]}}}