Δ-stepping: a parallelizable shortest path algorithm
نویسندگان
چکیده
منابع مشابه
∆-stepping: a parallelizable shortest path algorithm
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n · logn+ m) operations. However, no work-efficient parallel algorithm is known that runs in sublinear time for arbitrary graphs. In this paper we present a rather simple algorithm for the single source shortest path problem. Our new algorit...
متن کاملDelta-Stepping: A Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کامل-stepping : a Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کاملACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2
As Graphics Processing Units (GPUs) have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from C...
متن کاملChoosing a Shortest Path Algorithm
Computation of shortest paths is an integral component of many applications such as transportation planning and VLSI design. Frequently, a shortest path algorithm is selected for a given application based on the performance of the algorithm for a set of test networks. The performance of this algorithm, however, can be signiicantly diierent for networks not included in the test set. Therefore, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(03)00076-2