Filters








7 Hits in 4.7 sec

DSMR

Saeed Maleki, Donald Nguyen, Andrew Lenharth, María Garzarán, David Padua, Keshav Pingali
2016 Proceedings of the 2016 International Conference on Supercomputing - ICS '16  
In this paper, we introduce the Dijkstra Strip Mined Relaxation (DSMR) algorithm, an efficient parallel SSSP algorithm for shared and distributed-memory systems.  ...  The Single Source Shortest Path (SSSP) problem consists in finding the shortest paths from a vertex (the source vertex) to all other vertices in a graph. SSSP has numerous applications.  ...  The authors thank the Argonne Leadership Computing Facility at Argonne National Lab for providing computation time on the Mira cluster.  ... 
doi:10.1145/2925426.2926287 dblp:conf/ics/MalekiNLGPP16 fatcat:7m5tbp7jr5dztpzcphtztfjj5m

DSMR

Saeed Maleki, Donald Nguyen, Andrew Lenharth, María Garzarán, David Padua, Keshav Pingali
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
The Single-Source Shortest Path (SSSP) problem is to find the shortest paths from a source vertex to all other vertices in a graph.  ...  In this paper, we introduce the Dijkstra Strip-Mined Relaxation (DSMR) algorithm, an efficient parallel SSSP algorithm for shared and distributed memory systems.  ...  This paper presents DSMR (Dijkstra Strip Mined Relaxation), a new shared and distributed memory parallel algorithm for the Single-Source Shortest Path (SSSP) problem that is particularly efficient on scale-free  ... 
doi:10.1145/2851141.2851183 dblp:conf/ppopp/MalekiNLGPP16 fatcat:4o4j3iaoojhdlna4kzn5cjcbse

MapReduce Algorithm for Single Source Shortest Path Problem

Praveen Kumar, CSED, MNNIT Allahabad, Prayagraj (India), Anil Kumar Singh
2020 International Journal of Computer Network and Information Security  
Computing single source shortest path is a popular problem in graph theory, extensively applied in many areas like computer networks, operation research and complex network analysis.  ...  MapReduce is a popular programming framework for large data processing in distributed and cloud environments.  ...  INTRODUCTION Single Source Shortest Path (SSSP) problem is to find shortest paths from the source vertex to all other vertices such that the sum of the weights of constituent edges of every path is minimized  ... 
doi:10.5815/ijcnis.2020.03.02 fatcat:ur2c2zx2mvgqlix6rerymmhgei

Engineering a Parallel Δ-stepping Algorithm

Erika Duriakova, Deepak Ajwani, Neil Hurley
2019 2019 IEEE International Conference on Big Data (Big Data)  
In many se ings, the static partitioning may be signi cantly be er. 2 Background and Related Work 2.1 Single Source Shortest Path Algorithms SSSP algorithms compute the shortest paths from the given source  ...  In this paper, we focus on engineering shortest path algorithms that leverage the parallelism o ered by shared memory multicore architectures.  ... 
doi:10.1109/bigdata47090.2019.9006237 dblp:conf/bigdataconf/DuriakovaAH19 fatcat:aevn3a7sdnag7hpiuu7i25elru

DMGA: A Distributed Shortest Path Algorithm for Multistage Graph

Huanqing Cui, Ruixue Liu, Shaohua Xu, Chuanai Zhou, Cristian Mateos
2021 Scientific Programming  
The multistage graph problem is a special kind of single-source single-sink shortest path problem.  ...  Next, DMGA calculates the shortest paths between any pair of starting and ending vertices within a partition by the classical dynamic programming algorithm.  ...  S·Maleki [18] introduced a partially asynchronous parallel DSMR (Dijkstra Strip Mined Relaxation) algorithm for SSSP on shared and distributed memory systems.  ... 
doi:10.1155/2021/6639008 fatcat:xnofzd36hfcz3iwho2lrbi4oge

Approximation Algorithm for Shortest Path in Large Social Networks

Dennis Nii Ayeh Mensah, Hui Gao, Liang Wei Yang
2020 Algorithms  
Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall's algorithms are limited to small networks due to computational complexity and cost.  ...  We propose an efficient and a more accurate approximation algorithm that is applicable to large scale networks.  ...  Algorithms 2020, 13, 36  ... 
doi:10.3390/a13020036 fatcat:lqroqgmbq5a2nlpk67zrafnh4m

A Comprehensive Survey of Machine Learning Applied to Radar Signal Processing [article]

Ping Lang, Xiongjun Fu, Marco Martorella, Jian Dong, Rui Qin, Xianpeng Meng, Min Xie
2020 arXiv   pre-print
This paper aims at helping researchers and practitioners to better understand the application of ML techniques to RSP-related problems by providing a comprehensive, structured and reasoned literature overview  ...  This paper then concludes with a series of open questions and proposed research directions, in order to indicate current gaps and potential future solutions and trends.  ...  A direct graph structure-based single source shortest path search algorithm was also adopted to represent the tradeoff between the recognition performance and flight distance of SAR platform.  ... 
arXiv:2009.13702v1 fatcat:m6am73324zdwba736sn3vmph3i