FAST NETWORK CODING SIMULATION WITH PARALLELIZATION OF PROCESSES IN THE DTSMS SYSTEM

Изложены принципы быстрого имитационного моделирования процедур сетевого кодирования с распараллеливанием процессов в многоядерных ЭВМ на основе разработанной системы моделирования DTSMS. Представлены способы и схемы взаимодействия элементов модели с реализацией модели сети в соответствии с общепринятой в сетевом кодировании архитектурой «бабочка» для последовательного и асинхронного режимов работы. Выполнена оценка объема выделяемой памяти и времени моделирования для DTSMS в сравнении с реализацией на открытой системе компьютерной алгебры GNU/Octave. The principles of fast network coding simulation with parallelization of processes in multicore computers based on the developed DTSMS simulation system are stated. Methods and schemes of the sequential and asynchronous model elements interaction within the framework of the "butterfly" network model architecture generally accepted in network coding are presented. The allocated memory amount and simulation time for DTSMS are estimated in comparison with the open computer algebra system GNU/Octave.

TFBN: A Cost Effective High Performance Hierarchical Interconnection Network

In order to fulfill the increasing demand for computation power to process a boundless data concurrently within a very short time or real-time in many areas such as IoT, AI, machine learning, smart grid, and big data analytics, we need exa-scale or zetta-scale computation in the near future. Thus, to have this level of computation, we need a massively parallel computer (MPC) system that shall consist of millions of nodes; and, for the interconnection of these massive numbers of nodes, conventional topologies are infeasible. Thus, a hierarchical interconnection network (HIN) is a rational way to connect huge nodes. Through this article, we are proposing a new HIN, which is a tori-connected flattened butterfly network (TFBN) for the next generation MPC system. Numerous basic modules are hierarchically interconnected as a toroidal connection, whereby the basic modules are flattened butterfly networks. We have studied the network architecture, static network performance, and static cost-effectiveness of the proposed TFBN in detail; and compared static network and cost-effectiveness performance of the TFBN to those of TTN, torus, TESH, and mesh networks. It is depicted that TFBN possesses low diameter and average distance, high arc connectivity, and temperate bisection width. It also has better cost-effectiveness and cost-performance trade-off factor compared to those of TTN, torus, TESH, and mesh networks. The only shortcoming is that the complexity of wiring of the TFBN is higher than that of those networks; this is because the basic module necessitates some extra short length link to form the flattened butterfly network. Therefore, TFBN is a high performance and cost-effective HIN, and it will be a good option for the next generation MPC system.

Total Irregular Labelling Of Butterfly and Beneš Network 5-Dimension

This paper aims to determine the total vertex irregularity strength and total edge irregularity strength of Butterfly and Beneš Network 5-Dimension. The determination of the total vertex irregularity strength and the edge irregularity strength was conducted by determining the lower bound and upper bound. The lower bound was analyzed based on characteristics of the graph and other proponent theorems, while upper bound was analyzed by constructing the function of the irregular total labeling. The result show that the total vertex irregularity strength of Butterfly Network , the total edge irregularity strength . The total vertex irregularity strength of Beneš Network , the total edge irregularity strength