In this paper, we present a new method for implementing the parallel BFS algorithm on multi-core CPUs which exploits a fundamental property of randomly shaped real-world graph instances.

We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem.

Apr 22, 2021 · We give implementations of theoretically-efficient parallel algorithms for 20 important graph problems. We also present the interfaces, optimizations, and graph processing techniques that we used in our implementations, which were crucial in enabling us to process these large graphs quickly.

Apr 14, 2018 · We investigate methods for parallel algorithm design with emphasis on graph algorithms in this chapter. Shared memory and distributed memory parallel processing are the two fundamental models at hardware, operating system, programming, and algorithmic levels of parallel computation.

May 9, 2020 · In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to...

Oct 1, 2012 · We describe our implementation, with virtual processing, of several parallel graph algorithms on a 16,384-processor MasPar MP-1. We present extensive test data on our code.

May 9, 2020 · In this study, we reviewed research by S Hong et al [1] that proposed a hybrid approach including the state of the art parallel graph exploration algorithm inspired by Agarwal et al [8] and a...

Apr 24, 2025 · The family of parallel algorithms consists of a set of algorithms exhibiting various degrees of parallelism determined by the number of pairs that are connected in parallel in each iteration of the algorithms. We implement and run the algorithms on a multi-core system and perform an extensive experimental analysis.

1 day ago · With increasingly complex functionalities being implemented in emerging applications, multicores are widely adopted with a layered cache hierarchy, and Directed Acyclic Graphs (DAGs) are commonly employed to model the execution dependencies between tasks.

Oct 1, 2012 · We presented a heuristic multithreaded algorithm for graph coloring that is suitable for any shared-memory system, including multi-core platforms. The key ideas in the design of the algorithm are speculation and iteration.