Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Checking spanning trees optimality using associative parallel processors and its visualization
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
Checking spanning trees optimality using associative parallel processors and its visualization
Тема:
Параллельное программирование
Распределенные системы и сети
Распределенные системы и сети
УДК:
681.3
Посилання:
Checking spanning trees optimality using associative parallel processors and its visualization / A.S. Nepomniaschaya, T.V. Borets // Проблеми програмування. — 2004. — N 2,3. — С. 244-250. — Бібліогр.: 9 назв. — англ.
Підтримка:
This work was supported in part by the Russian Foundation for Basic Research under Grant N 03-01-00399.
Дата:
2004
Переглядів:
1219
Завантажень:
652
Анотація:
In this paper, by means of an abstract model of the SIMD type with vertical data processing (the STAR-machine), we present a simple
associative parallel algorithm for implementing the criterion of Chin and Houck to verify minimal spanning trees in undirected graphs. This
algorithm is given as the corresponding STAR procedure CST whose correctness is proved and time complexity is evaluated. We also provide
an experiment of verifying two spanning trees for optimality in a given undirected graph.
