Filters








71 Hits in 3.4 sec

Parallel Delta-Stepping Algorithm for Shared Memory Architectures [article]

M. Kranjčević, D. Palossi, S. Pintarelli
2017 arXiv   pre-print
We present a shared memory implementation of a parallel algorithm, called delta-stepping, for solving the single source shortest path problem for directed and undirected graphs.  ...  When run in sequential mode, our implementation outperforms the implementation of Dijkstra's algorithm from Boost Graph Library on graphs with a small diameter.  ...  INTRODUCTION We consider the single source shortest path (SSSP) problem: in a directed graph with non-negative weights, find the minimal cost path from one chosen node to all other nodes. Motivation.  ... 
arXiv:1604.02113v2 fatcat:rcsgqz75sbgmvpc7hbpb34fq6i

Delta-Stepping SSSP: From Vertices and Edges to GraphBLAS Implementations

Upasana Sridhar, Mark Blanco, Rahul Mayuranath, Daniele G. Spampinato, Tze Meng Low, Scott McMillan
2019 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)  
We illustrate our approach by translating the delta-stepping single source shortest path algorithm from its canonical description to a GraphBLAS implementation, and highlight lessons learned when implementing  ...  This paper investigates a systematic approach for translating a graph algorithm described in the canonical vertex and edge representation into an implementation that leverages the GraphBLAS interface.  ...  [DISTRIBUTION STATEMENT A] This material has been approved for public release and unlimited distribution.  ... 
doi:10.1109/ipdpsw.2019.00047 dblp:conf/ipps/SridharBMSLM19 fatcat:xdh6ymxinzdejo5asnrtikq2cq

Distributed socialite

Jiwon Seo, Jongsoo Park, Jaeho Shin, Monica S. Lam
2013 Proceedings of the VLDB Endowment  
It optimizes the evaluation of recursive monotone aggregate functions using a delta stepping technique.  ...  As a declarative query language, SociaLite, with the help of a compiler that generates efficient parallel and approximate code, can be used easily to create many social apps that operate on large-scale  ...  Parallel recursive aggregate function evaluation with delta stepping. Delta stepping [28] has been shown in the past to be effective for parallelizing the shortest paths algorithm.  ... 
doi:10.14778/2556549.2556572 fatcat:juarojg6cfa4zbtwjc4ugf74ju

Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture

Joseph R. Crobak, Jonathan W. Berry, Kamesh Madduri, David A. Bader
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
We present a study of multithreaded implementations of Thorup's algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs.  ...  Most of the recent progress in shortest path algorithms relies on structure that these networks do not have.  ...  We acknowledge the algorithmic inputs from Bruce Hendrickson of Sandia National Laboratories.  ... 
doi:10.1109/ipdps.2007.370687 dblp:conf/ipps/CrobakBMB07 fatcat:zidlr3xlubc2rhc2zlwdy3t544

Powerful and efficient bulk shortest-path queries

Peter Rutgers, Claudio Martella, Spyros Voulgaris, Peter Boncz
2016 Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems - GRADES '16  
However, current graph-processing platforms tend to offer limited solutions, typically supporting only single-source and all-pairs shortest path algorithms, with poor filtering options.  ...  Second, we provide a scalable algorithm for the parallel implementation of this top-N operator on Giraph, a graph-processing system based on the Bulk Synchronous Parallel (BSP) model.  ...  The Delta-stepping algorithm is designed for parallel computing, running in linear average time for most graphs.  ... 
doi:10.1145/2960414.2960420 dblp:conf/grades/RutgersMVB16 fatcat:3la56oprzfeltl3r7yn4nwl4eu

A Review: Parallel Implementation of Shortest path Algorithm on GPGPU

Avadhoot K. Katkar, Dr. Kulkarni D. B.
2017 IJARCCE  
To find out the shortest paths from a single source to all other vertices's is a common problem in graph analysis.  ...  The Bellman¬Ford's algorithm is solves such a single¬source shortestpath (SSSP) problem and better applies to beparallelized for many¬core architectures.  ...  INTRODUCTION Single source shortest path problem finds application in large domains of the scientific and real world.  ... 
doi:10.17148/ijarcce.2017.65124 fatcat:xgjxmk3a3bfsbha3hdjb3rdisa

SP Async:Single Source Shortest Path in Asynchronous Mode on MPI [article]

Sangeeta Yadav, Asif Khan
2021 arXiv   pre-print
Finding single source shortest path is a very ubiquitous problem.  ...  But with the increasing size of large datasets in important application like social network data-mining, network topology determination-efficient parallelization of these techniques is needed to match  ...  Many parallel algorithms/graph libraries and frameworks have already been proposed for finding single source shortest path to reduce this computation time.  ... 
arXiv:2103.12012v1 fatcat:iax4msqii5b7vclhacpzbzvu5e

Graph Analysis with High-Performance Computing

Bruce Hendrickson, Jonathan W. Berry
2008 Computing in science & engineering (Print)  
To study such data sets, the authors explored the use of highperformance computing (HPC) for graph algorithms.  ...  We consider two fundamental graph algorithms: s − t connectivity and single-source shortest paths (SSSPs).  ...  Calling an algorithm for a single-source shortest path (SSSP). The vertices are labeled with their distance from the single source, and the edges are labeled with their lengths.  ... 
doi:10.1109/mcse.2008.56 fatcat:vucz73s6x5h35ehhikxpbzlynq

Ordered vs. unordered

Muhammad Amber Hassaan, Martin Burtscher, Keshav Pingali
2011 Proceedings of the 16th ACM symposium on Principles and practice of parallel programming - PPoPP '11  
In this paper, we study several algorithms for four such problems: discrete-event simulation, single-source shortest path, breadth-first search, and minimal spanning trees.  ...  We show that these algorithms can be classified into two categories that we call unordered and ordered, and demonstrate experimentally that there is a trade-off between parallelism and work efficiency:  ...  Single-Source Shortest Path The single-source shortest-path problem (SSSP) finds the shortest paths from a given source node to all other nodes in a graph with weighted edges.  ... 
doi:10.1145/1941553.1941557 dblp:conf/ppopp/HassaanBP11 fatcat:kxce4svktffg7c7aafhvhtlc5a

Ordered vs. unordered

Muhammad Amber Hassaan, Martin Burtscher, Keshav Pingali
2011 SIGPLAN notices  
In this paper, we study several algorithms for four such problems: discrete-event simulation, single-source shortest path, breadth-first search, and minimal spanning trees.  ...  We show that these algorithms can be classified into two categories that we call unordered and ordered, and demonstrate experimentally that there is a trade-off between parallelism and work efficiency:  ...  Single-Source Shortest Path The single-source shortest-path problem (SSSP) finds the shortest paths from a given source node to all other nodes in a graph with weighted edges.  ... 
doi:10.1145/2038037.1941557 fatcat:mw3lc4g6ubbopl7roe2qgn2ybm

Parallel Shortest Path Algorithm for Voronoi Diagrams with Generalized Distance Functions

Julio Toss, Joao Luiz Dihl Comba, Bruno Raffin
2014 2014 27th SIBGRAPI Conference on Graphics, Patterns and Images  
In this paper, we tackle this problem by proposing a GPU algorithm of the shortest-path algorithm from multiple sources using generalized distance functions.  ...  The GPU grid-based parallel shortest path algorithm we propose was 27 times faster than the reference sequential CPU implementation.  ...  Current GPU proposals for shortest path algorithms consider the Single-Source-Shortest-Path (SSSP) problem [2] , using classic algorithms such as Dijkstra [3] or Bellmann-Ford.  ... 
doi:10.1109/sibgrapi.2014.1 dblp:conf/sibgrapi/TossCR14 fatcat:ltjj5ucmo5fmtheskbrslrj2hi

Synthesizing concurrent schedulers for irregular algorithms

Donald Nguyen, Keshav Pingali
2011 SIGARCH Computer Architecture News  
In this paper, we present a flexible and efficient approach for specifying and synthesizing scheduling policies for irregular algorithms.  ...  To handle these complexities, implementations of irregular algorithms employ carefully handcrafted, algorithm-specific schedulers but these schedulers are themselves parallel programs, complicating the  ...  Acknowledgements: We thank David August (Princeton) for being a "good shepherd".  ... 
doi:10.1145/1961295.1950404 fatcat:pp7egwsxurd7pivmdmvqdxcb6a

Compilation Techniques for Graph Algorithms on GPUs [article]

Ajay Brahmakshatriya, Yunming Zhang, Changwan Hong, Shoaib Kamil, Julian Shun, Saman Amarasinghe
2021 arXiv   pre-print
No single set of optimizations or one hardware platform works well across all settings.  ...  The GraphIt programming language makes it easy for the programmer to write the algorithm once and optimize it for different inputs using a scheduling language.  ...  Single-Source Shortest Path (SSSP) with Delta- Stepping uses the original graphs (not symmetrized) with edge weights.  ... 
arXiv:2012.07990v2 fatcat:alou6on3ezdqvma5fc4j4paxty

Synthesizing concurrent schedulers for irregular algorithms

Donald Nguyen, Keshav Pingali
2011 SIGPLAN notices  
In this paper, we present a flexible and efficient approach for specifying and synthesizing scheduling policies for irregular algorithms.  ...  To handle these complexities, implementations of irregular algorithms employ carefully handcrafted, algorithm-specific schedulers but these schedulers are themselves parallel programs, complicating the  ...  Acknowledgements: We thank David August (Princeton) for being a "good shepherd".  ... 
doi:10.1145/1961296.1950404 fatcat:evlcssc7ejbgppeutu7iz2l2i4

Synthesizing concurrent schedulers for irregular algorithms

Donald Nguyen, Keshav Pingali
2012 SIGPLAN notices  
In this paper, we present a flexible and efficient approach for specifying and synthesizing scheduling policies for irregular algorithms.  ...  To handle these complexities, implementations of irregular algorithms employ carefully handcrafted, algorithm-specific schedulers but these schedulers are themselves parallel programs, complicating the  ...  Acknowledgements: We thank David August (Princeton) for being a "good shepherd".  ... 
doi:10.1145/2248487.1950404 fatcat:ybqb4hraize5xe2cvbhsavxnfy
« Previous Showing results 1 — 15 out of 71 results