1 / 6

Distributed Dijkstra Shortest Path Implementation

Distributed Dijkstra Shortest Path Implementation. The Scared Order of Dijkstra M. Mahdi - 1203000668 Markus - 1203000684 Okky H.T.F. - 1203000838 Prayana Galih - 1203000862 Randy S.P. - 1203000935 Septian A. - 1203001036. Background.

vito
Download Presentation

Distributed Dijkstra Shortest Path Implementation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Distributed Dijkstra Shortest Path Implementation The Scared Order of Dijkstra M. Mahdi - 1203000668 Markus - 1203000684 Okky H.T.F. - 1203000838 Prayana Galih - 1203000862 Randy S.P. - 1203000935 Septian A. - 1203001036

  2. Background Algoritma Dijkstra pertama kali ditemukan oleh: Edsger Wybe Dijkstra (1930 - 2002) Solusi untuk menemukan jarak terdekat antara satu titik dengan titik yang lain.

  3. Distributed Dijkstra Algorithm Merupakan pengembangan dari algoritma Dijsktra orisinil. Dijkstra orisinil > secara sequencial mencari shortest path pada graph. Distributed Dijkstra > berjalan secara paralel (concurrent). Setiap node mencari shortest path ke semua node lain.

  4. The Algorithm Basically: • Setiap node mempunyai informasi path dan cost ke setiap node lain. • Informasi dari setiap node disimpan pada tabel, yang menyimpan informasi mengenai node tetangga dan cost-nya. • Tabel tersebut di-share ke node lain untuk dihitung shortest path-nya, pengambilan informasi dapat dilakukan oleh setiap node dalam waktu yang bersamaan

  5. The Algorithm (cont.) Dijkstra(G,w,s) S<--Empty Set for all v in V v.d = infinity v.p = NIL s.d = 0 Q.insert All v in V while Q is not empty u <-- Q.Extract-Min() S <-- S union {u} for each vertex that is adjacent to U if v.d > u.d + c(u, v) then u.d <-- u.d+c(u,v) v.p <-- u

  6. Advantages • Mendeteksi dan menghindari edge yang bernilai negatif. • Performa yang lebih baik karena prinsip paralelitas. • Algoritma tidak terpengaruh kondisi node.

More Related