ISJ Theoretical & Applied Science 11(19) 2014

ISPC European Science and Technology, Southampton, United Kingdom

Melent'ev VA

ABOUT TOPOLOGICAL COMPACTNESS OF COMPUTING SYSTEMS.

Full Article: PDF

Digital Object Identifier System: http://dx.doi.org/10.15863/TAS.2014.11.19.12

Language: Russian

Citation: Melent'ev VA (2014) ABOUT TOPOLOGICAL COMPACTNESS OF COMPUTING SYSTEMS. ISJ Theoretical & Applied Science 11 (19): 59-65. doi: http://dx.doi.org/10.15863/TAS.2014.11.19.12

Pages: 59-65

Published: 30.11.2014

Abstract: The problem of synthesis of topology of a computer system is solved as a problem of constructing a graph with a minimum diameter for given values of the order, degree and girth of the graph. The solution is based on the use of projective graph description and it is reduced to creation of a joint, in respect of the above characteristics, set of its vertex-complete projections. The concept of a compact graph is given, its analytical model is presented. A algorithm for generation compact graphs, which is based on this model, is described.

Key words: topology of communication networks of the computing systems CS, compactness of graphs of СS; diameter, order, degree and girth of the graph of СS.