{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:14:56Z","timestamp":1754108096318,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030848248"},{"type":"electronic","value":"9783030848255"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-84825-5_9","type":"book-chapter","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T20:02:35Z","timestamp":1629057755000},"page":"121-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimizing Sparse Matrix Storage for the Big Data Era"],"prefix":"10.1007","author":[{"given":"Ra\u00fal","family":"Marichal","sequence":"first","affiliation":[]},{"given":"Ernesto","family":"Dufrechou","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Ezzatti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"issue":"01","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.21917\/ijsc.2015.0150","volume":"06","author":"AJ Umbarkar","year":"2015","unstructured":"Umbarkar, A.J., Sheth, P.D.: Crossover operators in genetic algorithms: a review. ICTACT J. Soft Comput. 06(01), 1083\u20131092 (2015)","journal-title":"ICTACT J. Soft Comput."},{"key":"9_CR2","unstructured":"Anzt, H., Tomov, S., Dongarra, J.: Implementing a sparse matrix vector product for the SELL-C\/SELL-C-$$\\sigma $$ formats on Nvidia GPUs (2014)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barreto, J.A., de Oliveira, S.L.G.: A systematic review of heuristics for profile reduction of symmetric matrices. In: Proceedings of the International Conference on Computational Science, ICCS 2015, Reykjav\u00edk, Iceland. Procedia Computer Science, vol. 51, pp. 221\u2013230. Elsevier (2015)","DOI":"10.1016\/j.procs.2015.05.231"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.procs.2010.04.023","volume":"1","author":"M Belgin","year":"2010","unstructured":"Belgin, M., Back, G., Ribbens, C.J.: Applicability of pattern-based sparse matrix representation for real applications. Procedia Comput. Sci. 1(1), 203\u2013211 (2010)","journal-title":"Procedia Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chagas, G.O., de Oliveira, S.L.G.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. In: Proceedings of the International Conference on Computational Science, ICCS 2015, Reykjav\u00edk, Iceland, vol. 51, pp. 211\u2013220. Elsevier (2015)","DOI":"10.1016\/j.procs.2015.05.229"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1837853.1693471","volume":"45","author":"JW Choi","year":"2010","unstructured":"Choi, J.W., Singh, A., Vuduc, R.: Model-driven autotuning of sparse matrix-vector multiply on GPUs. ACM SIGPLAN Not. 45(5), 115\u2013126 (2010)","journal-title":"ACM SIGPLAN Not."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of 1969 24 National Conference, pp. 157\u2013172. ACM Press (1969)","DOI":"10.1145\/800195.805928"},{"key":"9_CR8","unstructured":"Davis, T.: Suitesparse matrix collection web page. https:\/\/people.engr.tamu.edu\/davis\/research.html. Accessed 14 Feb 2020"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"de Oliveira, S.L.G., Silva, L.M.: An ant colony hyperheuristic approach for matrix bandwidth reduction. Appl. Soft Comput. 94, 106434 (2020)","DOI":"10.1016\/j.asoc.2020.106434"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"de Oliveira, S.L.G., Bernardes, J.A.B., Chagas, G.O.: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method. Comput. Appl. Math. 37(3), 7 (2018)","DOI":"10.1007\/s40314-017-0490-5"},{"key":"9_CR11","unstructured":"Guo, D., Gropp, W., Olson, L.N.: A hybrid format for better performance of sparse matrix-vector multiplication on a GPU. Int. J. High Perform. Comput. Appl. 30, 103\u2013120 (2016)"},{"issue":"12","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.14778\/3229863.3236239","volume":"11","author":"FT Jamour","year":"2018","unstructured":"Jamour, F.T., Abdelaziz, I., Kalnis, P.: A demonstration of magiq: matrix algebra approach for solving RDF graph queries. Proc. VLDB Endow. 11(12), 1978\u20131981 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kepner, J., Gilbert, J.: Graph Algorithms in the Language of Linear Algebra. Society for Industrial and Applied Mathematics, USA (2011)","DOI":"10.1137\/1.9780898719918"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-15871-1_49","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B Koohestani","year":"2010","unstructured":"Koohestani, B., Poli, R.: A genetic programming approach to the matrix bandwidth-minimization problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 482\u2013491. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15871-1_49"},{"key":"9_CR15","unstructured":"Kreutzer, M., Hager, G., Wellein, G., Fehske, H., Bishop, A.R.: A unified sparse matrix data format for modern processors with wide SIMD units. arXiv, abs\/1307.6209 (2013)"},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"C643","DOI":"10.1137\/14097135X","volume":"37","author":"P Mironowicz","year":"2015","unstructured":"Mironowicz, P., Dziekonski, A., Mrozowski, M.: A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU. SIAM J. Sci. Comput. 37(6), C643\u2013C666 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-11515-8_10","volume-title":"High Performance Embedded Architectures and Compilers","author":"A Monakov","year":"2010","unstructured":"Monakov, A., Lokhmotov, A., Avetisyan, A.: Automatically tuning sparse matrix-vector multiplication for GPU architectures. In: Patt, Y.N., Foglia, P., Duesterwald, E., Faraboschi, P., Martorell, X. (eds.) HiPEAC 2010. LNCS, vol. 5952, pp. 111\u2013125. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11515-8_10"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The $$\\cal{NP}$$-completeness of the bandwidth minimization problem. Computing 16(3), 263\u2013270 (1976)","journal-title":"Computing"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Pichel, J.C., Singh, D.E., Carretero, J.: Reordering algorithms for increasing locality on multicore processors. In: 2008 10th IEEE International Conference on High Performance Computing and Communications, pp. 123\u2013130 (2008)","DOI":"10.1109\/HPCC.2008.96"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.micpro.2011.05.005","volume":"36","author":"JC Pichel","year":"2012","unstructured":"Pichel, J.C., Rivera, F.F., Fernndez, M., Rodrguez, A.: Optimization of sparse matrixvector multiplication using reordering techniques on GPUs. Microprocess. Microsyst. 36(2), 65\u201377 (2012)","journal-title":"Microprocess. Microsyst."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Pinar, A., Heath, M.T.: Improving performance of sparse matrix-vector multiplication. In: Proceedings of the 1999 ACM\/IEEE Conference on Supercomputing, SC 1999, p. 30es. ACM, New York (1999)","DOI":"10.1145\/331532.331562"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1080\/02331934.2013.830120","volume":"63","author":"P Pop","year":"2014","unstructured":"Pop, P., Matei, O., Calin-Adrian, C.: Reducing the bandwidth of a sparse matrix with a genetic algorithm. Optimization 63, 12 (2014)","journal-title":"Optimization"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-030-58799-4_23","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"PHG Silva","year":"2020","unstructured":"Silva, P.H.G., Brand\u00e3o, D.N., Morais, I.S., de Oliveira, S.L.G.: A biased random-key genetic algorithm for bandwidth reduction. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12249, pp. 312\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58799-4_23"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/nme.1620230208","volume":"23","author":"SW Sloan","year":"1986","unstructured":"Sloan, S.W.: An algorithm for profile and wavefront reduction of sparse matrices. Int. J. Numer. Meth. Eng. 23(2), 239\u2013251 (1986)","journal-title":"Int. J. Numer. Meth. Eng."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Xu, S., Lin, H.X., Xue, W.: Sparse matrix-vector multiplication optimizations based on matrix bandwidth reduction using Nvidia CUDA. In: 2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science, pp. 609\u2013614 (2010)","DOI":"10.1109\/DCABES.2010.162"}],"container-title":["Communications in Computer and Information Science","Cloud Computing, Big Data & Emerging Topics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84825-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T11:44:53Z","timestamp":1673091893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84825-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030848248","9783030848255"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84825-5_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCC-BD&ET","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Cloud Computing, Big Data & Emerging Topics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Plata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcc&bd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/jcc.info.unlp.edu.ar","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OJS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.19","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}