All-Pairs Shortest Path Algorithm Based on MPI+CUDA Distributed Parallel Programming Model

Journal of Networks
doi 10.4304/jnw.8.12.2797-2803
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Academy Publisher

Related search

DecGPU: Distributed Error Correction on Massively Parallel Graphics Processing Units Using CUDA and MPI

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2011English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Parallel Programming Design of BPSK Signal Demodulation Based on CUDA

International Journal of Communications, Network and System Sciences
2016English

An Associative Version of the Ramalingam Decremental Algorithm for the Dynamic All-Pairs Shortest-Path Problem

Bulletin of the Novosibirsk Computing Center. Series:Computer Science
2016English

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

1989English

An MPI-CUDA Implementation for Massively Parallel Incompressible Flow Computations on Multi-Gpu Clusters

2010English

An Improving Dynamic Programming Algorithm to Solve the Shortest Path Problem With Time Windows

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy