How do graph relabeling algorithms improve memory locality?

Mohsen Koohi Esfahani, Peter Kilpatrick*, Hans Vandierendonck

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)
153 Downloads (Pure)

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 languageEnglish
Title of host publicationProceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages84-86
Number of pages3
ISBN (Electronic)9781728186436
ISBN (Print)9781728186443
DOIs
Publication statusPublished - 28 Apr 2021
EventIEEE International Symposium on Performance Analysis of Systems and Software - Virtual, Stony Brook, United States
Duration: 28 Mar 202130 Mar 2021

Publication series

NameIEEE International Symposium on Performance Analysis of Systems and Software: Proceedings

Conference

ConferenceIEEE International Symposium on Performance Analysis of Systems and Software
Abbreviated titleISPASS
Country/TerritoryUnited States
CityStony Brook
Period28/03/202130/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.

Cite this