{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:24:30Z","timestamp":1740097470545,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448800"},{"type":"electronic","value":"9783319448817"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44881-7_17","type":"book-chapter","created":{"date-parts":[[2016,10,27]],"date-time":"2016-10-27T03:11:13Z","timestamp":1477537873000},"page":"367-382","source":"Crossref","is-referenced-by-count":0,"title":["Parallelization of Sparse Matrix Kernels for Big Data Applications"],"prefix":"10.1007","author":[{"given":"Oguz","family":"Selvitopi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kadir","family":"Akbudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,28]]},"reference":[{"key":"17_CR1","unstructured":"Intel math kernel library (2015). https:\/\/software.intel.com\/en-us\/intel-mkl"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable graph exploration on multicore processors. In: Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201910, pp. 1\u201311. IEEE Computer Society, Washington, DC, USA (2010). doi: 10.1109\/SC.2010.46","DOI":"10.1109\/SC.2010.46"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Akbudak, K., Aykanat, C.: Simultaneous input and output matrix partitioning for outer-product\u2013parallel sparse matrix-matrix multiplication. SIAM J. Sci. Comput. 36(5), C568\u2013C590 (2014). doi: 10.1137\/13092589X","DOI":"10.1137\/13092589X"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan S., Ramamritham K., Kumar A., Ravindra M.P., Bertino E., Kumar R. (eds.) Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596. ACM Press (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595\u2013601. ACM Press, Manhattan (2004)","DOI":"10.1145\/988672.988752"},{"key":"17_CR6","unstructured":"Boman, E., Devine, K., Heaphy, R., Hendrickson, B., Heroux, M., Preis, R.: LDRD report: Parallel repartitioning for optimal solver performance. Tech. Rep. SAND2004\u20130365, Sandia National Laboratories, Albuquerque, NM (2004)"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Parallel sparse matrix-matrix multiplication and indexing: implementation and experiments. SIAM J. Sci. Comput. (SISC) 34(4), 170\u2013191 (2012). doi: 10.1137\/110848244 ; http:\/\/gauss.cs.ucsb.edu\/~aydin\/spgemm_sisc12.pdf","DOI":"10.1137\/110848244"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Bulu\u00e7, A., Madduri, K.: Parallel breadth-first search on distributed memory systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201911, pp. 65:1\u201365:12. ACM, New York, NY, USA (2011). doi: 10.1145\/2063384.2063471 ; http:\/\/doi.acm.org\/10.1145\/2063384.2063471","DOI":"10.1145\/2063384.2063471"},{"issue":"7","key":"17_CR9","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"UV Catalyurek","year":"1999","unstructured":"Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7), 673\u2013693 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"17_CR10","unstructured":"CP2K: CP2K home page (Accessed at 2015). http:\/\/www.cp2k.org\/"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"D\u2019Alberto, P., Nicolau, A.: R-kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica 47(2), 203\u2013213 (2007). doi: 10.1007\/s00453-006-1224-z","DOI":"10.1007\/s00453-006-1224-z"},{"issue":"1","key":"17_CR12","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"12","key":"17_CR13","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1002\/cnm.881","volume":"22","author":"Z Dost\u00e1l","year":"2006","unstructured":"Dost\u00e1l, Z., Hor\u00e1k, D., Ku\u010dera, R.: Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE. Commun. Numer. Meth. Eng. 22(12), 1155\u20131162 (2006)","journal-title":"Commun. Numer. Meth. Eng."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Feng, Y., Owen, D., Peri, D.: A block conjugate gradient method applied to linear systems with multiple right-hand sides. Comput. Meth. Appl. Mech. Eng. 127(14), 203\u2013215 (1995). http:\/\/dx.doi.org\/10.1016\/0045-7825(95)00832-2 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/0045782595008322","DOI":"10.1016\/0045-7825(95)00832-2"},{"issue":"3","key":"17_CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/1089014.1089021","volume":"31","author":"MA Heroux","year":"2005","unstructured":"Heroux, M.A., Bartlett, R.A., Howle, V.E., Hoekstra, R.J., Hu, J.J., Kolda, T.G., Lehoucq, R.B., Long, K.R., Pawlowski, R.P., Phipps, E.T., et al.: An overview of the Trilinos project. ACM Trans. Math. Softw. (TOMS) 31(3), 397\u2013423 (2005)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"17_CR16","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press (1978)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: A peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM \u201909, pp. 229\u2013238. IEEE Computer Society, Washington, DC, USA (2009). doi: 10.1109\/ICDM.2009.14","DOI":"10.1109\/ICDM.2009.14"},{"key":"17_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Marion-Poty, V., Lefer, W.: A wavelet decomposition scheme and compression method for streamline-based vector field visualizations. Comput. Graphics 26(6), 899\u2013906 (2002). doi: 10.1016\/S0097-8493(02)00178-4 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0097849302001784","DOI":"10.1016\/S0097-8493(02)00178-4"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Mattson, T., Bader, D., Berry, J., Buluc, A., Dongarra, J., Faloutsos, C., Feo, J., Gilbert, J., Gonzalez, J., Hendrickson, B., Kepner, J., Leiserson, C., Lumsdaine, A., Padua, D., Poole, S., Reinhardt, S., Stonebraker, M., Wallach, S., Yoo, A.: Standards for Graph Algorithm Primitives. ArXiv e-prints (2014)","DOI":"10.1109\/HPEC.2013.6670338"},{"key":"17_CR21","unstructured":"NVIDIA Corporation: CUSPARSE library (2010)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"O\u2019Leary, D.P.: The block conjugate gradient algorithm and related methods. Linear Algebra Appl. 29(0), 293\u2013322 (1980). http:\/\/dx.doi.org\/10.1016\/0024-3795(80)90247-5 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/0024379580902475 . Special Volume Dedicated to Alson S. Householder","DOI":"10.1016\/0024-3795(80)90247-5"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"O\u2019Leary, D.P.: Parallel implementation of the block conjugate gradient algorithm. Parallel Comput. 5(12), 127\u2013139 (1987). http:\/\/dx.doi.org\/10.1016\/0167-8191(87)90013-5 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/0167819187900135 . Proceedings of the International Conference on Vector and Parallel Computing-Issues in Applied Research and Development","DOI":"10.1016\/0167-8191(87)90013-5"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sar\u0131yuce, A.E., Saule, E., Kaya, K., \u00c7atalyurek, U.V.: Regularizing graph centrality computations. J. Parallel Distrib. Comput. 76(0), 106\u2013119 (2015). http:\/\/dx.doi.org\/10.1016\/j.jpdc.2014.07.006 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731514001282 . Special Issue on Architecture and Algorithms for Irregular Applications","DOI":"10.1016\/j.jpdc.2014.07.006"},{"key":"17_CR25","unstructured":"Sawyer, W., Messmer, P.: Parallel grid manipulations for general circulation models. In: Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science, vol. 2328, pp. 605\u2013608. Springer, Berlin (2006)"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Selvitopi, O., Aykanat, C.: Reducing latency cost in 2D sparse matrix partitioning models. Parallel Comput. 57, 1\u201324 (2016). http:\/\/dx.doi.org\/10.1016\/j.parco.2016.04.004 ; http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167819116300138","DOI":"10.1016\/j.parco.2016.04.004"},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/TPDS.2014.2311804","volume":"26","author":"RO Selvitopi","year":"2015","unstructured":"Selvitopi, R.O., Ozdal, M.M., Aykanat, C.: A novel method for scaling iterative solvers: avoiding latency overhead of parallel sparse-matrix vector multiplies. IEEE Trans. Parallel Distrib. Syst. 26(3), 632\u2013645 (2015). doi: 10.1109\/TPDS.2014.2311804","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Shi, Z., Zhang, B.: Fast network centrality analysis using gpus. BMC Bioinf. 12(1), 149 (2011). doi: 10.1186\/1471-2105-12-149","DOI":"10.1186\/1471-2105-12-149"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"U\u00e7ar, B., Aykanat, C.: Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. SIAM J. Sci. Comput. 25(6), 1837\u20131859 (2004). doi: 10.1137\/S1064827502410463","DOI":"10.1137\/S1064827502410463"},{"issue":"4","key":"17_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"RA Geijn Van De","year":"1997","unstructured":"Van De Geijn, R.A., Watts, J.: Summa: scalable universal matrix multiplication algorithm. Concurrency-Pract. Experience 9(4), 255\u2013274 (1997)","journal-title":"Concurrency-Pract. Experience"}],"container-title":["Computer Communications and Networks","Resource Management for Big Data Platforms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44881-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T22:39:02Z","timestamp":1568500742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44881-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448800","9783319448817"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44881-7_17","relation":{},"ISSN":["1617-7975","2197-8433"],"issn-type":[{"type":"print","value":"1617-7975"},{"type":"electronic","value":"2197-8433"}],"subject":[],"published":{"date-parts":[[2016]]}}}