Scheduling or distributing the computational workload over multiple threads is a critical and repeatedly performed activity in graph processing workloads. In a recent paper “Reducing the burden of parallel loop schedulers for many‐core processors” published in Concurrency & Computation: Practice & Experience, we investigated the overhead introduced by scheduling. This […]
Yearly archives: 2021
15 posts
Relabeling (reordering) 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. We use a number of techniques to explain how locality is affected by relabeling algorithms and how locality of different datasets (like social networks, web graphs) is enhanced by relabeling algorithms. This paper also investigates why different push and pull traversal of different datasets show different behaviours by introducing push locality and pull locality.
Dr Jeremy Singer, University of Glasgow25 February 2021 Abstract:Love ’em or hate ’em, interactive computational notebooks are here to stay as a mainstream code development medium. In particular, the Jupyter system is widely used by the data science community. This presentation explores some use cases for programmatic introspection of a Jupyter notebook […]
Dr Giorgis Georgakoudis, Lawrence Livermore National Laboratory18 February 2021 Abstract: This talk will present an overview of research on different areas of open problems in HPC. On fault tolerance, Giorgis will present the Reinit solution for fault tolerance in large scale MPI applications. Reinit improves the recovery time of checkpointed […]
Dr Julian Shun, Massachusetts Institute of Technology 14 January 2021 Abstract: This talk presents new parallel algorithms for density-basedspatial clustering (DBSCAN) on point sets and structural clustering(SCAN) on graphs, two problems that have received significantattention due to their applicability in a variety of data analysistasks. Existing parallel algorithms for DBSCAN […]