A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
All-Pairs Shortest-Paths for Large Graphs on the GPU
[article]
2008
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware - HWWS '04
Preserved Fulltext
The all-pairs shortest-path problem is an intricate part in numerous practical applications. ...
We describe a shared memory cache efficient GPU implementation to solve transitive closure and the all-pairs shortest-path problem on directed graphs for large datasets. ...
The authors would like to thank Norm Badler, Alla Safonova, and Amy Calhoon for all their insightful help. ...
doi:10.2312/eggh/eggh08/047-055
fatcat:2g54edmqqrfdbmwtsqsbjvac6u
Cache Friendly Bellman-Ford algorithm using OpenCL
2016
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper a cache friendly implementation for Bellman Ford algorithm to solve single source shortest path and all pair shortest path algorithm is proposed. ...
Shortest path algorithms play a vital role in real world applications. ...
All pair shortest path using bellman ford algorithm could also be calculated if above algorithm for all the vertices in the graph is called. ...
doi:10.5120/ijca2016909305
fatcat:irrkgr4xtjaf3lmsn4h7vjgsie
Estimating graph distance and centrality on shared nothing architectures
2014
Concurrency and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Given'as the source (landmark), the traditional definition of this problem asks for finding the shortest path .'; v/ for all v 2 V . ...
We first describe an efficient parallel method to solve the single source shortest path problem on commodity hardware with no shared memory. ...
We described methods for optimizing the single source shortest path and APSP problems in MapReduce and proposed a novel parallel algorithm for estimating shortest paths in shared nothing architectures. ...
doi:10.1002/cpe.3354
fatcat:boqyj6pnibeb5frkqgc5sizqay
All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model
2013
Journal of Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GPU cluster ...
In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand ...
Floyd-Warshall Shortest Path Algorithm The Floyd-Warshall algorithm is an all-pair shortest paths algorithm, let ( , ) G V E be a directed graph with V vertices, then we can solve all-pair shortest path ...
doi:10.4304/jnw.8.12.2797-2803
fatcat:det4bxhfqrbnlcelefbqb4i34y
Performance Improvement in Large Graph Algorithms on GPU using CUDA: an Overview
2010
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We studied different parallel algorithms for Breadth first search, all pairs shortest path that are carried out on GPU using CUDA and make their comparative study with respect to execution time, data structure ...
In the paper, we presented overview of various parallel methods carried out on GPU using its multithreaded architecture for BFS, APSP by various authors. ...
PARALLEL ALL PAIRS SHORTEST PATH In all pairs shortest path problem (APSP), given an weighted graph G(V, E, W) with positive weights, aim is to find out least weighted path from every vertex to every other ...
doi:10.5120/1520-1992
fatcat:wzmmbirqonhxni5z2t35jksg5e
A Task Parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-Compatible GPU
2008
2008 IEEE International Symposium on Parallel and Distributed Processing with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a fast method for computing the costs of all-pairs shortest paths (APSPs) on the graphics processing unit (GPU). ...
Our method is based on Harish's iterative algorithm that computes the cost of the single-source shortest path (SSSP) for every source vertex. ...
Acknowledgments This work was partly supported by JSPS Grant-in-Aid for Scientific Research (A)(2)(20240002), Young Researchers (B)(19700061), and the Global COE Program "in silico medicine" at Osaka University ...
doi:10.1109/ispa.2008.40
dblp:conf/ispa/OkuyamaIH08
fatcat:gbckj7rivnhlpk3wsvycydue7a
CHALLENGES IN PARALLEL GRAPH PROCESSING
2007
Parallel Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
As these problems grow in scale, parallel computing resources are required to meet their computational and memory requirements. ...
Unfortunately, the algorithms, software, and hardware that have worked well for developing mainstream parallel scientific applications are not necessarily effective for large-scale graph problems. ...
Figure 1 : 1 Performance of the s − t shortest paths implementations for distributed memory and the MTA-2 on random graphs. ...
doi:10.1142/s0129626407002843
fatcat:samtlwojnjccfg7fhvzvjh6xmq
Pannotia: Understanding irregular GPGPU graph applications
2013
2013 IEEE International Symposium on Workload Characterization (IISWC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, implementing and optimizing these graph algorithms on SIMD architectures is challenging because their data-dependent behavior results in significant branch and memory divergence. ...
We also use clustering analysis to illustrate the similarities and differences of the applications in the suite. ...
ACKNOWLEDGMENTS We would like to thank the reviewers for their constructive comments and suggestions. ...
doi:10.1109/iiswc.2013.6704684
dblp:conf/iiswc/CheBRS13
fatcat:aarxg4r625cdlg634zyuiopx2q
Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study
[chapter]
2018
Communications in Computer and Information Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work, we selected the Floyd-Warshall algorithm as a representative case study of graph and memory-bound applications. ...
Knights Landing is the recently released second generation of Intel Xeon Phi architecture. ...
Acknowledgments The authors thank the ArTeCS Group from Universidad Complutense de Madrid for letting use their Xeon Phi KNL system. ...
doi:10.1007/978-3-319-75214-3_5
fatcat:oj6fqtz5azco5fnp2zqbj7ud4m
A task parallel algorithm for finding all-pairs shortest paths using the GPU
2012
International Journal of High Performance Computing and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes an acceleration method for finding the all-pairs shortest paths (APSPs) using the graphics processing unit (GPU). ...
Our method is based on Harish's iterative algorithm that computes the cost of the single-source shortest path (SSSP) in parallel on the GPU. ...
ACKNOWLEDGMENT This work was partly supported by JSPS Grant-in-Aid for Scientific Research (A)(20240002), Young Researchers (B) (19700061), and the Global COE Program "in silico medicine" at Osaka University ...
doi:10.1504/ijhpcn.2012.046384
fatcat:bto2bjexpneevcbod3qh6qu6wa
The parallel approach
2013
Nature Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1211.4487v1 fatcat:g6jygbaimbhqpd6ncjd6prxlneOther Versions
All these features are tantalizingly similar to those encountered in the biological realm, thus offering new opportunities for biologically-inspired computation. ...
We will discuss the various possibilities offered by memcomputing, discuss the criteria that need to be satisfied to realize this paradigm, and provide an example showing the solution of the shortest-path ...
Distributions of electron current corresponding to (a) and (b) are shown in (c) and (d), respectively. See Methods for details of all calculations. ...
doi:10.1038/nphys2566
fatcat:xncuaazz45fdtaperw5julge4u
Comparative Analysis of Algorithms to Discover Shortest Path in Social Networks
2016
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The solution depends on efficient discovery of geodesic distance between any two random nodes. To this end, two algorithms are studied and parallelized for comparative performance analysis. ...
Finding the affiliation networks and shared interest of user groups within the social network are important and well-studied problems. ...
Which can produce shortest paths for single source shortest paths in O (n log n + m) time, and shortest-paths for all pairs of nodes in Θ (n 3 ). ...
doi:10.5120/ijca2016912435
fatcat:4wjlrues2fd5favltitinsaz6i
Preprocessing Parallelization for the ALT-Algorithm
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we improve the preprocessing phase of the ALT algorithm through parallelization. ...
ALT is a preprocessing-based, goal-directed speed-up technique that uses A* (A star), Landmarks and Triangle inequality which allows fast computations of shortest paths (SP) in large-scale networks. ...
The traffic simulator is implemented in parallel using a distributed memory architecture. ...
doi:10.1007/978-3-319-93713-7_7
fatcat:wcan4rrzlbf47pqrdsfgfadadi
CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores
2015
2015 IEEE International Symposium on Workload Characterization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our characterization reveals that these challenges remain in state-of-the-art graph algorithms, and in this context CRONO can be used to identify, analyze and develop novel architectural methods to mitigate ...
However, these suites lack graph applications that must be evaluated in the context of architectural design space exploration for futuristic multicores. ...
This is done by computing all the shortest paths in a graph between all the pairs of vertices, and then identifying the number of shortest paths passing through each given vertex. ...
doi:10.1109/iiswc.2015.11
dblp:conf/iiswc/AhmadHSK15
fatcat:eiyrn2a725h5lnc26redgboq6u
Evaluation of Spatial Parallel Genetic Algorithms for Real Time Routing in Geographic Information System
2009
Journal of Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this study, two developed shortest path algorithms that run fast on the real large volume road networks have been identified. ...
Continually, in this effort genetic algorithm is used to solve the shortest path problem, because the limitation of traditional optimization methods. ...
The parallel algorithm used in this work is designed for a distributed memory architecture and decomposition of genetic algorithm for maximizing the utilization of the processors. ...
doi:10.3923/jas.2009.4179.4182
fatcat:43x6zzm5ofgrpizhc5fqvy43bq
« Previous
Showing results 1 — 15 out of 11,035 results