Fast Minimum Spanning Tree Computation

Harish, Pawan; Narayanan, P. J.; Vineet, Vibhav; Patidar, Suryakant

doi:10.1016/b978-0-12-385963-1.00007-1

Cited by 3 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, we modified Harish's original parallel shortest path algorithm for GPGPU [9,10] (named as "Harish") to include the early termination condition (named Harish with Early Termination or HET). The original Harish algorithm is targeted for the single source, multiple targets shortest path problem.…”

Section: Resultsmentioning

confidence: 99%

“…Dijkstra's algorithm can also be used to find the shortest path between a source and a target by stopping the algorithm when the target is reached. A parallel implementation of Dijkstra's algorithm for graphics processing units (GPUs) targeted for the single source, multiple targets shortest path problem was proposed by Harish, Vineet, and Narayanan [9,10]. The idea is to take advantage of the hundreds or thousands of graphics cores on the GPU to parallelize the solution space exploration and consequently speed up the search for the optimal solution.…”

Section: Introductionmentioning

confidence: 99%

“…The parallel implementation of Dijkstra's algorithm proposed by Harish, Vineet, and Narayanan [9,10] is targeted for the single source, multiple targets shortest path problem. In this paper, a parallel version of Dijkstra's algorithm for the single-pair shortest path non-negative weight problem is proposed and deployed on a graphics processing unit (GPU).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast bidirectional shortest path on GPU

Tangjittaweechai

Ekpanyapong

Watewai

et al. 2016

IEICE Electron. Express

View full text Add to dashboard Cite

The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra's classic approach modified with pruning and early termination. We achieve substantial speedup over a parallel method that performs a single parallel search on the GPGPU from the source to all other nodes but early terminates when the shortest path to the specified target node is found. Experimental results demonstrate a speedup of nearly 2Â over the parallel method that performs a parallel search from the source with early termination on the GPGPU.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast bidirectional shortest path on GPU

Tangjittaweechai

Ekpanyapong

Watewai

et al. 2016

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…Within the discrete mathematics literature, graph compression has been studied with focus on ensuring low distortion (or stretch) of inter-node distances. For example, spanning trees and Steiner trees are the smallest subgraphs maintaining connectivity in undirected graphs [20], [21]. Graph spanners remove a subset of edges while allowing for a user-defined maximum distortion of shortest paths [22]- [24].…”

Section: Introductionmentioning

confidence: 99%

D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration

Chang,

Ballotta,

Carlone

2023

IEEE Robot. Autom. Lett.

View full text Add to dashboard Cite

For a multi-robot team that collaboratively explores an unknown environment, it is of vital importance that the collected information is efficiently shared among robots in order to support exploration and navigation tasks. Practical constraints of wireless channels, such as limited bandwidth, urge robots to carefully select information to be transmitted. In this letter, we consider the case where environmental information is modeled using a 3D Scene Graph, a hierarchical map representation that describes both geometric and semantic aspects of the environment. Then, we leverage graph-theoretic tools, namely graph spanners, to design greedy algorithms that efficiently compress 3D Scene Graphs with the aim of enabling communication between robots under bandwidth constraints. Our compression algorithms are navigation-oriented in that they are designed to approximately preserve shortest paths between locations of interest while meeting a user-specified communication budget constraint. The effectiveness of the proposed algorithms is demonstrated in robot navigation experiments in a realistic simulator.

show abstract

SIMD ²

Zhang

Tsai

Tseng

2022

Proceedings of the 49th Annual International Symposium on Computer Architecture

View full text Add to dashboard Cite

Matrix-multiplication units (MXUs) are now prevalent in every computing platform. The key attribute that makes MXUs so successful is the semiring structure, which allows tiling for both parallelism and data reuse. Nonetheless, matrix-multiplication is not the only algorithm with such attributes. We find that many algorithms share the same structure and differ in only the core operation; for example, using add-minimum instead of multiply-add. Algorithms with a semiring-like structure therefore have potential to be accelerated by a general-purpose matrix operation architecture, instead of common MXUs.In this paper, we propose SIMD 2 , a new programming paradigm to support generalized matrix operations with a semiring-like structure. SIMD 2 instructions accelerate eight more types of matrix operations, in addition to matrix multiplications. Since SIMD 2 instructions resemble a matrix-multiplication instruction, we are able to build SIMD 2 architecture on top of any MXU architecture with minimal modifications. We developed a framework that emulates and validates SIMD 2 using NVIDIA GPUs with Tensor Cores. Across 8 applications, SIMD 2 provides up to 38.59× speedup and more than 6.94× on average over optimized CUDA programs, with only 5% of full-chip area overhead.

show abstract

Fast Minimum Spanning Tree Computation

Cited by 3 publications

References 8 publications

Fast bidirectional shortest path on GPU

Fast bidirectional shortest path on GPU

D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration

SIMD ²

Contact Info

Product

Resources

About