{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T23:00:24Z","timestamp":1777676424612,"version":"3.51.4"},"reference-count":25,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T00:00:00Z","timestamp":1245110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2010,5]]},"abstract":"<jats:p>Irregular codes are present in many scientific applications, such as finite element simulations. In these simulations the solution of large sparse linear equation systems is required, which are often solved using iterative methods. The main kernel of the iterative methods is the sparse matrix\u2014vector multiplication which frequently demands irregular data accesses. Therefore, techniques that increase the performance of this operation will have a great impact on the global performance of the iterative method and, as a consequence, on the simulations. In this paper a technique for improving the locality of sparse matrix codes is presented. The technique consists of reorganizing the data guided by a locality model instead of restructuring the code or changing the sparse matrix storage format. We have applied our proposal to different iterative methods provided by two standard numerical libraries. Results show an impact on the overall performance of the considered iterative method due to the increase in the locality of the sparse matrix\u2014vector product. Noticeable reductions in the execution time have been achieved both in sequential and in parallel executions. This positive behavior allows the reordering technique to be successfully applied to real problems. We have focused on the simulation of semiconductor devices and in particular on the BIPS3D simulator. The technique was integrated into the simulator. Both sequential and parallel executions have been analyzed extensively in this paper. Noticeable reductions in the execution time required by the simulations are observed when using our reordered matrices in comparison with the original simulator.<\/jats:p>","DOI":"10.1177\/1094342009106416","type":"journal-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T20:26:16Z","timestamp":1245183976000},"page":"136-153","source":"Crossref","is-referenced-by-count":3,"title":["Increasing the Locality of Iterative Methods and Its Application to the Simulation of Semiconductor Devices"],"prefix":"10.1177","volume":"24","author":[{"given":"J.C.","family":"Pichel","sequence":"first","affiliation":[{"name":"GALICIA SUPERCOMPUTING CENTER (CESGA), AVENIDA DE VIGO, S\/N CAMPUS SUR, 15705 SANTIAGO DE COMPOSTELA, A CORU\u00d1A, SPAIN,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.B.","family":"Heras","sequence":"additional","affiliation":[{"name":"ELECTRONICS AND COMPUTING DEPARTMENT, UNIVERSIDADE DE SANTIAGO DE COMPOSTELA, RUA CONGA 1, 15704 SANTIAGO DE COMPOSTELA, SPAIN,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.C.","family":"Cabaleiro","sequence":"additional","affiliation":[{"name":"ELECTRONICS AND COMPUTING DEPARTMENT, UNIVERSIDADE DE SANTIAGO DE COMPOSTELA, RUA CONGA 1, 15704 SANTIAGO DE COMPOSTELA, SPAIN,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Garc\u00eda-Loureiro","sequence":"additional","affiliation":[{"name":"ELECTRONICS AND COMPUTING DEPARTMENT, UNIVERSIDADE DE SANTIAGO DE COMPOSTELA, RUA CONGA 1, 15704 SANTIAGO DE COMPOSTELA, SPAIN,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.F.","family":"Rivera","sequence":"additional","affiliation":[{"name":"ELECTRONICS AND COMPUTING DEPARTMENT, UNIVERSIDADE DE SANTIAGO DE COMPOSTELA, RUA CONGA 1, 15704 SANTIAGO DE COMPOSTELA, SPAIN,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,6,16]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894278952"},{"key":"atypb2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate, D.","year":"2006"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1177\/1094342007083801"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1557"},{"key":"atypb5","volume-title":"Several Strategies for Reducing the Bandwidth of Matrices, Rose and Willoughby","author":"Cuthill, E.","year":"1972"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000323"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0207(20001020)49:5<639::AID-NME968>3.0.CO;2-P"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00089-8"},{"key":"atypb9","volume-title":"Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing","author":"Im, E.J."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"atypb12","volume-title":"Proceedings of the Conference on Computing Frontiers","author":"Kourtis, K."},{"key":"atypb13","volume-title":"Proceedings IEEE International Conference on Supercomputing (ICS\u201996)","author":"Navarro, J.J."},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/S00361445003820"},{"key":"atypb15","volume-title":"Proceedings of the 12th Euromicro Conference on Parallel, Distributed and Network-based Processing, A Coruna, Spain, 11-13 February 2004","author":"Pichel, J.C."},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.04.012"},{"key":"atypb17","volume-title":"10th IEEE International Conference on High Performance Computing and Communications","author":"Pichel, J.C."},{"key":"atypb18","volume-title":"Proceedings of the ACM\/ IEEE Supercomputing","author":"Pinar, A."},{"key":"atypb19","volume-title":"SPARSKIT: a basis toolkit for sparse matrix computations. Technical report","author":"Saad, Y.","year":"1994"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"atypb21","volume-title":"PSPARSLIB users manual: a portable library of parallel sparse iterative solvers. Technical Report, University of Minnesota","author":"Saad, Y.","year":"1998"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041294"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0711"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"Vuduc, R. and Moon, H. 2005. Fast sparse matrix-vector multiplication by exploiting variable block structure. High Performance Computing and Communications, Lecture Notes in Computer Science, Vol. 3726, Springer, Berlin, pp. 807-816.","DOI":"10.1007\/11557654_91"},{"key":"atypb25","volume-title":"Proceedings of Supercomputing 2007","author":"Williams, S."}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342009106416","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342009106416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:18:51Z","timestamp":1777450731000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342009106416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,16]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["10.1177\/1094342009106416"],"URL":"https:\/\/doi.org\/10.1177\/1094342009106416","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,16]]}}}