HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM

The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are known. A new heterogeneous block algorithm is...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής

Κύριοι συγγραφείς:	A. A. Prihozhy, O. N. Karasik
Μορφή:	Artigo
Γλώσσα:	Inglês
Έκδοση:	Belarusian National Technical University 2017-11-01
Σειρά:	Системный анализ и прикладная информатика
Θέματα:	floyd-warshall algorithm all pairs shortest paths heterogeneous block algorithm multi-core system shared cache memory
Διαθέσιμο Online:	https://sapi.bntu.by/jour/article/view/178
Ετικέτες:	Προσθήκη ετικέτας Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!