Name
Abstract | ||
|---|---|---|
A major challenge in processing real-world graphs stems from poor locality of memory accesses and vertex reordering algorithms (RAs) have been proposed to improve locality by changing the order of memory accesses. While state-of-the-art RAs like SlashBurn, GOrder, and Rabbit-Order effectively speed up graph algorithms, their capabilities and disadvantages are not fully understood, mainly, for thre... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/IISWC53511.2021.00020 | 2021 IEEE International Symposium on Workload Characterization (IISWC) |
Keywords | DocType | ISBN |
Social networking (online),Terminology,Size measurement,Classification algorithms | Conference | 978-1-6654-4173-5 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohsen Koohi Esfahani | 1 | 1 | 0.35 |
| Peter Kilpatrick | 2 | 333 | 31.29 |
| Hans Vandierendonck | 3 | 1 | 0.35 |