Researcher: Torun, Tuğba
Name Variants
Torun, Tuğba
Email Address
Birth Date
2 results
Search Results
Now showing 1 - 2 of 2
Publication Open Access Bringing order to sparsity: a sparse matrix reordering study on multicore CPUs(Association for Computing Machinery, Inc, 2023) Trotter, James D.; Ekmekçibaşı, Sinan; Langguth, Johannes; Ilic, Aleksandar; Department of Computer Engineering; Department of Computer Engineering; Torun, Tuğba; Düzakın, Emre; Erten, Didem Unat; College of Engineering; Graduate School of Sciences and EngineeringMany real-world computations involve sparse data structures in the form of sparse matrices. A common strategy for optimizing sparse matrix operations is to reorder a matrix to improve data locality. However, it's not always clear whether reordering will provide benefits over the unordered matrix, as its effectiveness depends on several factors, such as structural features of the matrix, the reordering algorithm and the hardware that is used. This paper aims to establish the relationship between matrix reordering algorithms and the performance of sparse matrix operations. We thoroughly evaluate six different matrix reordering algorithms on 490 matrices across eight multicore architectures, focusing on the commonly used sparse matrix-vector multiplication (SpMV) kernel. We find that reordering based on graph partitioning provides better SpMV performance than the alternatives for a large majority of matrices, and that the resulting performance is explained through a combination of data locality and load balancing concerns. © 2023 Owner/Author(s).Publication Metadata only Mixed and multi-precision SpMV for GPUs with row-wise precision selection(IEEE Computer Society, 2022) Kaya, Kamer; N/A; N/A; N/A; Department of Computer Engineering; Department of Computer Engineering; Tezcan, Erhan; Torun, Tuğba; Koşar, Fahrican; Erten, Didem Unat; Master Student; Researcher; Master Student; Faculty Member; Graduate School of Sciences and Engineering; N/A; Graduate School of Sciences and Engineering; College of Engineering; N/A; N/A; N/A; 219274Sparse Matrix-Vector Multiplication (SpMV) is one of the key memory-bound kernels commonly used in industrial and scientific applications. To improve its data movement and benefit from higher compute rates, there are several efforts to utilize mixed precision on SpMV. Most of the prior-art focus on performing the entire SpMV in single-precision within a bigger context of an iterative solver (e.g., CG, GMRES). In this work, we are interested in a more fine-grained mixed-precision SpMV, where the level of precision is decided for each element in the matrix to be used in a single operation. We extend an existing entry-wise precision based approach by deciding precisions per row, motivated by the granularity of parallelism on a GPU where groups of threads process rows in CSR-based matrices. We propose mixed-precision CSR storage methods with row permutations and describe their greater efficiency and load-balancing compared to the existing method. We also consider a multi-precision case where single and double precision copies of the matrix are stored priorly and further extend our mixed-precision SpMV approach to comply with it. As such, we leverage a mixed-precision SpMV to obtain a multi-precision Jacobi method which is faster than yet almost as accurate as double-precision Jacobi implementation, and further evaluate a multi-precision Cardiac modeling algorithm. We demonstrate the effectiveness of the proposed SpMV methods on an extensive dataset of real-valued large sparse matrices from the SuiteSparse Matrix Collection using an NVIDIA V100 GPU.