The MapReduce based approach to improve the all-pair shortest path computation
International Journal of Advanced Science and Computer Applications · 2023
DOI: 10.47679/ijasca.v3i1.44 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Advanced Science and Computer Applications, 2023. Verfasst von Lau Nguyen Dinh. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
When building sequential algorithms for problems on the graphic network, the algorithms themselves are not only very complex but the complexity of the algorithms also is very big. Thus, sequential algorithms must be parralled to share work and reduce computation time. For above reasons, it is crucial to build parallelization of algorithms in extended graph to find the shortest path. Therefore, a study of algorithm finding the shortest path from a source node to all nodes in the MapReduce architectures is essential to deal with many real problems with huge input data in our daily life. MapReduce architectures processes on (Key, Value) pairs are independent between processes, so multiple processes can be assigned to execute simultaneously on the Hodoop system to reduce calculation time
Zitieren
APA
Dinh, L. N. (2023). The MapReduce based approach to improve the all-pair shortest path computation. International Journal of Advanced Science and Computer Applications. https://doi.org/10.47679/ijasca.v3i1.44
Vancouver
Dinh LN. The MapReduce based approach to improve the all-pair shortest path computation. International Journal of Advanced Science and Computer Applications. 2023. doi:10.47679/ijasca.v3i1.44
BibTeX
@article{Dinh2023,
author = {Dinh, Lau Nguyen},
title = {The MapReduce based approach to improve the all-pair shortest path computation},
journal = {International Journal of Advanced Science and Computer Applications},
year = {2023},
doi = {10.47679/ijasca.v3i1.44}
}
EUVIMED