Abstract
The topology of Sparse Flat Neighborhood Networks (SFNNs) is considered and its advantages and drawbacks are analyzed. A comparative analysis of the quality of SFNN constructions designed by a modified cyclic method is performed. A set of quality criteria for estimation of practical usefulness of SFNN constructions is proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
O. Koshul’ko and A. Koshul’ko, “High-performance computing clusters,” Electronic Components and Systems, No. 6, 39–41 (2004).
T. P. Mar’yanovich and O. A. Koshul’ko, “Use of the topology of Flat Neighborhood Networks for construction of cluster supercomputers,” Mat. Mashiny i Systemy, No. 4, 3–12 (2004).
H. G. Dietz and T. I. Mattox, “KLAT2’s Flat Neighborhood,” in: Proc. 4th Annual Linux Showcase and Conference, Atlanta, GA, USA. (2000), www.linuxshowcase.org.
D. M. Gordon, G. Kuperberg, and O. Patashnik, “New constructions for covering designs,” J. of Combinatorial Designs, No. 3, 269–284 (1995).
Author information
Authors and Affiliations
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 87–92, November– December 2004.
Rights and permissions
About this article
Cite this article
Koshul’ko, A.A. Comparative analysis of topological constructions of Sparse Flat Neighborhood Networks for cluster supercomputers. Cybern Syst Anal 40, 860–864 (2004). https://doi.org/10.1007/s10559-005-0025-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-005-0025-8