|
Numerical methods and programming, 2017, Volume 18, Issue 1, Pages 53–64
(Mi vmp860)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
An approximate algorithm for choosing the optimal subset of nodes in the Angara interconnect with failures
A. V. Mukosey, A. S. Semenov Scientific and Research Centre of Electronic Computer Technology, Moscow
Abstract:
The Angara high-speed interconnect with multidimensional torus topology is under development in Scientific Research Center for Electronic Computer Technology. During the utilization of the Angara interconnect in cluster systems, there exist busy and failed nodes. Thus, there is a problem of finding an optimal cluster node subset such that the network traffic belongs to this node subset and the node subset size is not less than a given size. The paper presents an approximate algorithm for solving this problem.
Keywords:
fault tolerance, interconnect, multidimensional torus, connectivity, deterministic routing, direction-order routing.
Received: 30.12.2016
Citation:
A. V. Mukosey, A. S. Semenov, “An approximate algorithm for choosing the optimal subset of nodes in the Angara interconnect with failures”, Num. Meth. Prog., 18:1 (2017), 53–64
Linking options:
https://www.mathnet.ru/eng/vmp860 https://www.mathnet.ru/eng/vmp/v18/i1/p53
|
Statistics & downloads: |
Abstract page: | 139 | Full-text PDF : | 58 |
|