Pages: 164-169
Published: 30.11.2016
Abstract: We investigate the potential parallelism of a computer system with the graph, which has the smallest diameter at the given order and degree. Formalized function of upper limitation on parallelism and topological scalability of the system in case of solving tasks with the complete graph of data. The analysis of these functions is given. Ways to increase the potential parallelism of compact computing system are considered.
Key words: parallel systems, scalability, compact topology.
|