Name
Abstract | ||
|---|---|---|
The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to shrink stack sizes. One, serial block partitioned DA, searches blocks one by one. Another, parallel block partitioned DA, searches blocks at the same time. Radii, which are updated when one block search is finished, are set to cut nodes with metrics larger than them in both algorithms. Simulation results show that the visited nodes number of serial block partitioned DA increase is very limited while the stack size is reduced exponentially. It also shows that stack sizes of the parallel block partitioned DA are reduced exponentially and the processing time is reduced efficiently. The performance of proposed algorithms is kept optimal in both proposed algorithms. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/VTCFall.2013.6692448 | VTC Fall |
Keywords | Field | DocType |
parallel block partitioned da,serial block partitioned da,trees (mathematics),tree search algorithm,telecommunication network topology,search problems,dijkstra algorithms | Tree traversal,Search algorithm,Computer science,Algorithm,Jump search,Dijkstra's algorithm | Conference |
Volume | Issue | ISSN |
null | null | 1090-3038 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinyu Mao | 1 | 5 | 2.94 |
| Yuxin Cheng | 2 | 8 | 1.96 |
| Haige Xiang | 3 | 154 | 30.35 |