Researcher:
Sipahioğlu, Buğra

Profile Picture
ORCID

Job Title

Undergraduate Student

First Name

Buğra

Last Name

Sipahioğlu

Name

Name Variants

Sipahioğlu, Buğra

Email Address

Birth Date

Filters

20201

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.20940eb8-3234-43f8-9087-0f7b2faea959

Search Results

Now showing 1 - 1 of 1
  • Placeholder
    PublicationMetadata only
    Adaptive level binning: a new algorithm for solving sparse triangular systems
    (Information Processing Society of Japan (IPSJ), 2020) Department of Computer Engineering; Department of Computer Engineering; N/A; Department of Computer Engineering; Erten, Didem Unat; Yılmaz, Buse; Ahmad, Najeeb; Sipahioğlu, Buğra; Faculty Member; Researcher; PhD Student; Undergraduate Student; Department of Computer Engineering; College of Engineering; College of Engineering; Graduate School of Sciences and Engineering; College of Engineering; 219274; N/A; N/A; N/A
    Sparse triangular solve (SpTRSV) is an important scientific kernel used in several applications such as preconditioners for Krylov methods. Parallelizing SpTRSV on multi-core systems is challenging since it exhibits limited parallelism due to computational dependencies and introduces high parallelization overhead due to finegrained and unbalanced nature of workloads. We propose a novel method, named Adaptive Level Binning (ALB), that addresses these challenges by eliminating redundant synchronization points and adapting the work granularity with an efficient load balancing strategy. Similar to the commonly used level-set methods for solving SpTRSV, ALB constructs level-sets of rows, where each level can be computed in parallel. Differently, ALB bins rows to levels adaptively and reduces redundant dependencies between rows. On an Intel® Xeon® Gold 6148 processor and NVIDIA® Tesla V100 GPU, ALB obtains 1.83x speedup on average and up to 5.28x speedup over Intel MKL and, over NVIDIA cuSPARSE, an average speedup of 2.80x and a maximum speedup of 39.40x for 29 matrices selected from Suite Sparse Matrix Collection.