| dc.contributor.author | Svela, Zawadi Berg | |
| dc.contributor.author | Elster, Anne C. | |
| dc.date.accessioned | 2022-10-24T10:52:12Z | |
| dc.date.available | 2022-10-24T10:52:12Z | |
| dc.date.created | 2021-12-07T23:27:34Z | |
| dc.date.issued | 2021 | |
| dc.identifier.citation | NIKT: Norsk IKT-konferanse for forskning og utdanning. 2021, 1 30-43. | en_US |
| dc.identifier.issn | 1892-0713 | |
| dc.identifier.uri | https://hdl.handle.net/11250/3027862 | |
| dc.description.abstract | Optimizing linear algebra operations has been a research topic for decades. The compact language of mathematics also produce lean, maintainable code. Using linear algebra as a high-level abstraction for graph operations is therefore very attractive. In this work, we will explore the usability of the GraphBLAS framework, currently the leading standard for graph operations that uses linear algebra as an abstraction. We analyze the usability of GraphBLAS by using it to implement the Edmonds-Karp algorithm for s-t maximum-flow/minimum-cut. To our knowledge, this work represents the first published results of Max-Flow in GraphBLAS. The result of our novel implementation was an algorithm that achieved a speedup of up to 11 over its own baseline, and is surprisingly compact and easy to reason about. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Bibsys Open Journal Systems | en_US |
| dc.relation.uri | https://ojs.bibsys.no/index.php/NIK/article/view/914 | |
| dc.title | Multicore Max-Flow using GraphBLAS: A Usability Study | en_US |
| dc.type | Peer reviewed | en_US |
| dc.type | Journal article | en_US |
| dc.description.version | publishedVersion | en_US |
| dc.source.pagenumber | 30-43 | en_US |
| dc.source.volume | 1 | en_US |
| dc.source.journal | NIKT: Norsk IKT-konferanse for forskning og utdanning | en_US |
| dc.identifier.cristin | 1965847 | |
| cristin.ispublished | true | |
| cristin.fulltext | preprint | |
| cristin.qualitycode | 1 | |
