PASGAL: Parallel And Scalable Graph Algorithm Library (2404.17101v1)
Abstract: In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a parallel graph library that scales to a variety of graph types, many processors, and large graph sizes. One special focus of PASGAL is the efficiency on \textit{large-diameter graphs}, which is a common challenge for many existing parallel graph processing systems: many existing graph processing systems can be even slower than the standard sequential algorithm on large-diameter graphs due to the lack of parallelism. Such performance degeneration is caused by the high overhead in scheduling and synchronizing threads when traversing the graph in the breadth-first order. The core technique in PASGAL to achieve high parallelism is a technique called \textit{vertical granularity control (VGC)} to hide synchronization overhead, as well as careful redesign of parallel graph algorithms and data structures. In our experiments, we compare PASGAL with state-of-the-art parallel implementations on BFS, SCC, BCC, and SSSP. PASGAL achieves competitive performance on small-diameter graphs compared to the parallel baselines, and is significantly faster on large-diameter graphs.
- 2010. OpenStreetMap © OpenStreetMap contributors. https://www.openstreetmap.org/.
- The problem-based benchmark suite (PBBS), V2. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 445–447.
- Group formation in large social networks: membership, growth, and evolution. In ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). 44–54.
- Direction-optimizing breadth-first search. In International Conference for High Performance Computing, Networking, Storage, and Analysis (SC). 1–10.
- The GAP benchmark suite. arXiv preprint arXiv:1508.03619 (2015).
- ParlayLib — a toolkit for parallel algorithms on shared-memory multicore machines. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 507–509.
- Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In www. 587–596.
- Paolo Boldi and Sebastiano Vigna. 2004. The WebGraph Framework I: Compression Techniques. In www. ACM Press, Manhattan, USA, 595–601.
- Theoretically efficient parallel graph algorithms can be fast and scalable. ACM Transactions on Parallel Computing (TOPC) 8, 1 (2021), 1–70.
- PASGAL: Parallel And Scalable Graph Algorithm Library. https://github.com/ucrparlay/PASGAL.
- Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 184–197.
- Provably Fast and Space-Efficient Parallel Biconnectivity. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 52–65.
- Reservoir computing compensates slow response of chemosensor arrays exposed to fast varying gas concentrations in continuous monitoring. Sensors and Actuators B: Chemical 215 (2015), 618–629.
- John Hopcroft and Robert Tarjan. 1973. Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16, 6 (1973), 372–378.
- What is Twitter, a social network or a news media?. In International World Wide Web Conference (WWW). 591–600.
- Scalable clustering algorithm for N-body simulations in a shared-nothing cluster. In International Conference on Scientific and Statistical Database Management. Springer, 132–150.
- Web Data Commons — Hyperlink Graphs. http://webdatacommons.org/hyperlinkgraph.
- Comparing community structure to characteristics in online collegiate social networks. SIAM review 53, 3 (2011), 526–543.
- Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In aaai. https://networkrepository.com
- BFS and coloring-based parallel algorithms for strongly connected components and related problems. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 550–559.
- Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM J. on Computing 1, 2 (1972), 146–160.
- Robert E Tarjan and Uzi Vishkin. 1985. An efficient parallel biconnectivity algorithm. SIAM J. on Computing 14, 4 (1985), 862–874.
- Social structure of facebook networks. sma 391, 16 (2012), 4165–4180.
- Parallel Strong Connectivity Based on Faster Reachability. In ACM SIGMOD International Conference on Management of Data (SIGMOD).
- GeoGraph: A Framework for Graph Processing on Geometric Data. ACM SIGOPS Operating Systems Review 55, 1 (2021), 38–46.
- Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems 42, 1 (2015), 181–213.
- Learning transportation mode from raw gps data for geographic applications on the web. In International World Wide Web Conference (WWW). 247–256.