SAGE: A Storage-Based Approach for Scalable and Efficient Sparse Generalized Matrix-Matrix Multiplication
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jang, Myung-Hwan | - |
dc.contributor.author | Ko, Yunyong | - |
dc.contributor.author | Gwon, Hyuck-Moo | - |
dc.contributor.author | Jo, Ikhyeon | - |
dc.contributor.author | Park, Yongjun | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.date.accessioned | 2023-12-11T07:30:37Z | - |
dc.date.available | 2023-12-11T07:30:37Z | - |
dc.date.issued | 2023-10 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/193215 | - |
dc.description.abstract | Sparse generalized matrix-matrix multiplication (SpGEMM) is a fundamental operation for real-world network analysis. With the increasing size of real-world networks, the single-machine-based SpGEMM approach cannot perform SpGEMM on large-scale networks, exceeding the size of main memory (i.e., not scalable). Although the distributed-system-based approach could handle large-scale SpGEMM based on multiple machines, it suffers from severe inter-machine communication overhead to aggregate results of multiple machines (i.e., not efficient). To address this dilemma, in this paper, we propose a novel storage-based SpGEMM approach (SAGE) that stores given networks in storage (e.g., SSD) and loads only the necessary parts of the networks into main memory when they are required for processing via a 3-layer architecture. Furthermore, we point out three challenges that could degrade the overall performance of SAGE and propose three effective strategies to address them: (1) block-based workload allocation for balancing workloads across threads, (2) in-memory partial aggregation for reducing the amount of unnecessarily generated storage-memory I/Os, and (3) distribution-aware memory allocation for preventing unexpected buffer overflows in main memory. Via extensive evaluation, we verify the superiority of SAGE over existing SpGEMM methods in terms of scalability and efficiency. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | SAGE: A Storage-Based Approach for Scalable and Efficient Sparse Generalized Matrix-Matrix Multiplication | - |
dc.type | Article | - |
dc.identifier.doi | 10.1145/3583780.3615044 | - |
dc.identifier.scopusid | 2-s2.0-85178147397 | - |
dc.identifier.bibliographicCitation | International Conference on Information and Knowledge Management, Proceedings, pp 923 - 933 | - |
dc.citation.title | International Conference on Information and Knowledge Management, Proceedings | - |
dc.citation.startPage | 923 | - |
dc.citation.endPage | 933 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Balancing | - |
dc.subject.keywordPlus | Buffer storage | - |
dc.subject.keywordPlus | Memory architecture | - |
dc.subject.keywordPlus | Scheduling algorithms | - |
dc.subject.keywordAuthor | network analysis | - |
dc.subject.keywordAuthor | real-world graphs | - |
dc.subject.keywordAuthor | sparse matrix multiplication | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3583780.3615044 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.