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...

Popoln opis

Bibliografske podrobnosti

Principais autores:	A. A. Prihozhy, O. N. Karasik
Format:	Artigo
Jezik:	Inglês
Izdano:	Belarusian National Technical University 2017-11-01
Serija:	Системный анализ и прикладная информатика
Teme:	floyd-warshall algorithm all pairs shortest paths heterogeneous block algorithm multi-core system shared cache memory
Online dostop:	https://sapi.bntu.by/jour/article/view/178
Oznake:	Označite Brez oznak, prvi označite!