Performance of shortest path algorithm based on parallel vertex traversal
Autor: | Vesović Mihailo, Smiljanić Aleksandra, Kostić Dušan |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2016 |
Předmět: | |
Zdroj: | Serbian Journal of Electrical Engineering, Vol 13, Iss 1, Pp 31-43 (2016) |
Druh dokumentu: | article |
ISSN: | 1451-4869 2217-7183 |
DOI: | 10.2298/SJEE1601031V |
Popis: | Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of nodes. However, scale of shortest path problems is increasing, and more efficient algorithms are needed. With the development of multicore processors, one natural way to speedup shortest path algorithms is through parallelization. In this paper, we propose a novel shortest path algorithm with parallel vertex transversal, and compare its speed with standard solutions in datacenter topologies. |
Databáze: | Directory of Open Access Journals |
Externí odkaz: |