Skip to main contentSkip to search
Episciences
Open Access Journals
|Sign in(new window)
Revue Africaine de Recherche en Informatique et Mathématiques Appliquées logo
Revue Africaine de Recherche en Informatique et Mathématiques Appliquées
Revue Africaine de Recherche en Informatique et Mathématiques Appliquées logo
Revue Africaine de Recherche en Informatique et Mathématiques Appliquées
|Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSpecial issuesAuthors
About
The journalIndexingNewsStatistics
Boards
Publish
For authorsEthical charterFor reviewersProposing special issues
Submit
Revue Africaine de Recherche en Informatique et Mathématiques Appliquées logo
Contact
|
Credits
eISSN 1638-5713
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Clustering-based Gra ...
Article

Clustering-based Graph Numbering using Execution Traces for Cache Misses Reduction in Graph Analysis Applications

Régis Audran Mogo Wafo (1), Thomas Messi Nguelé (1), Armel Jacques Nzekon Nzeko'o ORCID (1), Djam Youh Xaviera
(1) Université de Yaoundé I
Download article
Open on HAL
Submitted on
May 3, 2024
Accepted on
February 24, 2025
Published on
March 8, 2025
Last modified on
April 1, 2025
Volume 43
Volume 43 - 2025
DOI
10.46298/arima.13538
License
https://about.hal.science/hal-authorisation-v1
Indicators
625
Views
420
Downloads

Clustering-based Graph Numbering using Execution Traces for Cache Misses Reduction in Graph Analysis Applications

Régis Audran Mogo Wafo (1), Thomas Messi Nguelé (1), Armel Jacques Nzekon Nzeko'o ORCID (1), Djam Youh Xaviera
(1) Université de Yaoundé I
Abstract
Social graph analysis is generally based on a local exploration of the underlying graph. That is, the analysis of a node of the graph is often done after having analyzed nodes located in its vicinity. However, over the time, networks are bound to grow with the addition of new members, which inevitably leads to the enlargement of the corresponding graphs. At this level we therefore have a problem because more the size of the graph increases, more the execution time of graph analysis applications too. This is due to the very large number of nodes that will need to be treated. Some recent work in-faces this problem by exploiting the properties of social networks such as the community structure to renumber the nodes of the graph in order to reduce cache misses. Reducing cache misses in an application allows to reduce the execution time of this application. In this paper, we argue that combining existing graph ordering with a new numbering that exploit execution traces analysis can allow to improve cache misses reduction and hence execution time reduction. The idea is to build graph numbering using execution traces of graph analysis applications and then combine it with an existing graph numbering (such as cn-order). To build this new ordering, we define a new distance and then used it to analyse execution traces with well known clustering algorithms K-means (for Kmeans-order) and hierarchical clustering (for cl-hier-order). Experiments on a user machine (dual-core) and four cores of Grid'5000 node (Neowise) show that this combination improves slightly existing graph ordering (cn-order, numbaco, rabbit and gorder) in almost all the cases (the two cores of dual-core, all the four cores of neowise), with PageRank graph application and astro-ph dataset. For example, on neowise with one thread and Astro-ph dataset, the best performance is given with the combination kmeans-order_cn-order which allows to reduce by 42.59% the cache misses (compared to the second numbaco with 40.79%) and therefore by 7.27 % the time of execution (compared to 6.89% for the second numbaco).
Keywords
  • [INFO]Computer Science [cs]
  • [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
  • Graph analysis
  • Execution trace
  • Machine learning
  • Cache misses reduction
Preview
Loading PDF preview...