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

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	A. A. Prihozhy, O. N. Karasik
Format:	Artigo
Sprog:	Inglês
Udgivet:	Belarusian National Technical University 2017-11-01
Serier:	Системный анализ и прикладная информатика
Fag:	floyd-warshall algorithm all pairs shortest paths heterogeneous block algorithm multi-core system shared cache memory
Online adgang:	https://sapi.bntu.by/jour/article/view/178
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!