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
オンライン･アクセス:	https://sapi.bntu.by/jour/article/view/178
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!