Abstract
Relabeling algorithms aim to improve the poor memory locality of graph processing by changing the order of vertices. This paper analyses the functionality of three state-of-the-art relabeling algorithms: SlashBurn, GOrder, and Rabbit-Order for real-world graphs.
Original language | English |
---|---|
Title of host publication | Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2021 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 84-86 |
Number of pages | 3 |
ISBN (Electronic) | 9781728186436 |
ISBN (Print) | 9781728186443 |
DOIs | |
Publication status | Published - 28 Apr 2021 |
Event | IEEE International Symposium on Performance Analysis of Systems and Software - Virtual, Stony Brook, United States Duration: 28 Mar 2021 → 30 Mar 2021 |
Publication series
Name | IEEE International Symposium on Performance Analysis of Systems and Software: Proceedings |
---|
Conference
Conference | IEEE International Symposium on Performance Analysis of Systems and Software |
---|---|
Abbreviated title | ISPASS |
Country/Territory | United States |
City | Stony Brook |
Period | 28/03/2021 → 30/03/2021 |
Keywords
- Data analysis
- Graph processing
- Graph reordering
- Graph traversal
- High performance computing
- Memory locality
- Relabeling algorithm
ASJC Scopus subject areas
- Hardware and Architecture
- Information Systems
- Software
- Safety, Risk, Reliability and Quality
- Artificial Intelligence
- Computer Science Applications
Fingerprint
Dive into the research topics of 'How do graph relabeling algorithms improve memory locality?'. Together they form a unique fingerprint.Student theses
-
On designing structure-aware high-performance graph algorithms
Koohi Esfahani, M. (Author), Vandierendonck, H. (Supervisor) & Kilpatrick, P. (Supervisor), Jul 2023Student thesis: Doctoral Thesis › Doctor of Philosophy
File