A Novel Graph Transformation Strategy for Optimizing Sptrsv on Cpus

dc.contributor.author Yılmaz, Buse
dc.date.accessioned 2023-10-18T12:06:14Z
dc.date.available 2023-10-18T12:06:14Z
dc.date.issued 2023
dc.description.abstract Sparse triangular solve (SpTRSV) is an extensively studied computational kernel. An important obstacle in parallel SpTRSV implementations is that in some parts of a sparse matrix the computation is serial. By transforming the dependency graph, it is possible to increase the parallelism of the parts that lack it. In this work, we present a novel graph transformation strategy to increase the parallelism degree of a sparse matrix and compare it to our previous strategy. It is seen that our transformation strategy can provide a speedup as high as 1.42x$$ 1.42x $$.
dc.identifier.citation Yılmaz, B. A novel graph transformation strategy for optimizing SpTRSV on CPUs. Concurrency and Computation: Practice and Experience, e7761.
dc.identifier.doi 10.1002/cpe.7761
dc.identifier.issn 1532-0626
dc.identifier.issn 1532-0634
dc.identifier.scopus 2-s2.0-85158086996
dc.identifier.uri https://hdl.handle.net/20.500.11779/1987
dc.identifier.uri https://doi.org/10.1002/cpe.7761
dc.language.iso en
dc.publisher Wiley
dc.relation.ispartof Concurrency and Computation: Practice and Experience
dc.rights info:eu-repo/semantics/closedAccess
dc.subject Iccg
dc.subject Graph transformation
dc.subject Sptrsv
dc.subject Parallel computing
dc.subject Sparse matrix
dc.subject Sparse triangle solve
dc.title A Novel Graph Transformation Strategy for Optimizing Sptrsv on Cpus
dc.type Article
dspace.entity.type Publication
gdc.author.institutional Yılmaz, Buse
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C4
gdc.coar.access metadata only access
gdc.coar.type text::journal::journal article
gdc.description.department Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
gdc.description.scopusquality Q2
gdc.description.volume 35
gdc.description.woscitationindex Science Citation Index Expanded
gdc.description.wosquality Q3
gdc.identifier.openalex W4375867225
gdc.identifier.wos WOS:000982366300001
gdc.index.type WoS
gdc.index.type Scopus
gdc.oaire.diamondjournal false
gdc.oaire.impulse 3.0
gdc.oaire.influence 2.8477358E-9
gdc.oaire.isgreen false
gdc.oaire.popularity 4.4392316E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0202 electrical engineering, electronic engineering, information engineering
gdc.oaire.sciencefields 02 engineering and technology
gdc.oaire.sciencefields 0101 mathematics
gdc.oaire.sciencefields 01 natural sciences
gdc.openalex.collaboration National
gdc.openalex.fwci 1.92717245
gdc.openalex.normalizedpercentile 0.77
gdc.opencitations.count 2
gdc.plumx.crossrefcites 2
gdc.plumx.mendeley 3
gdc.plumx.scopuscites 4
gdc.publishedmonth Kasım
gdc.relation.journal Concurrency and Computation-Practice & Experience
gdc.scopus.citedcount 4
gdc.virtual.author Yılmaz, Buse
gdc.wos.citedcount 3
gdc.wos.collaboration Uluslararası işbirliği ile yapılmayan - HAYIR
gdc.wos.documenttype article
gdc.wos.indexdate 2023
gdc.wos.publishedmonth Kasım
gdc.yokperiod YÖK - 2023-24
relation.isAuthorOfPublication 98a01192-0e25-4d52-ab20-befb97cbcd59
relation.isAuthorOfPublication.latestForDiscovery 98a01192-0e25-4d52-ab20-befb97cbcd59
relation.isOrgUnitOfPublication 05ffa8cd-2a88-4676-8d3b-fc30eba0b7f3
relation.isOrgUnitOfPublication 0d54cd31-4133-46d5-b5cc-280b2c077ac3
relation.isOrgUnitOfPublication a6e60d5c-b0c7-474a-b49b-284dc710c078
relation.isOrgUnitOfPublication.latestForDiscovery 05ffa8cd-2a88-4676-8d3b-fc30eba0b7f3

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Concurrency and Computation - 2023 - Y lmaz - A novel graph transformation strategy for optimizing SpTRSV on CPUs.pdf
Size:
3.2 MB
Format:
Adobe Portable Document Format
Description:
Full Text- Article

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
0 B
Format:
Item-specific license agreed upon to submission
Description: