350 rub
Journal Information-measuring and Control Systems №11 for 2010 г.
Article in number:
Adaptive routing algorithm and the environment of exchange interactions of the symbolical multiprocessor
Authors:
V. M. Dovgal, A. V. Malyshev, V. V. Gordienko
Abstract:
In order to ensure a continuous job the multiprocessor requires several decision connected tasks: reproduction of its logical structure in the event of failure of individual nodes, and interoperability of software modules in the already reconfigured medium. The multiprocessor's communication subsystem should thus include two components: the first is to choose the trajectory of the message transfer, and secondly - the direct provision of transmission on this route with a choice of an optimal path.
Existing routing algorithms are constructed based on the condition of a known location of the receiver in the network with a bypass of failed elements in the construction of the trajectory. Thus it is assumed that each processor element contains duplicate routers and have the means of forming the data about the distribution of software modules in the system. These conditions require addi-tional time, hardware, algorithmic and information costs.
Eliminating the above deficiencies requires a joint solution of problems of reproduction and an exchange interactions in a multiprocessor that allows as to search both their retained positions and displaced software modules excluding the cost of collecting data on their location after each failure without duplicating communication elements in each of the nodes.
Based on the analysis of the functioning reproduction medium we introduced the concept of a permissible region where the software module is a set of positions of the matrix used for relocating it. There have been proven theories about a guaranteed achievement of the receiver when the messages reach this region, which has been provided by an annular bypass of its nodes and is independent of fault situations in this region.
Messages between the sites under consideration of the matrix structure are transmitted in four directions and contain: the address of the program, which must comply with the module receiver, the physical address of the receiver module and the field direction of the issuance of the message, which is introduced to avoid situations loops.
Pages: 26-29
References
- Duato, J., Rodrigo, S., Flich, J., An Efficient Implementation of Distributed Routing Algorithms for NoCs // Networks-on-Chips (NoCs-2008). Newcastle: Newcastle University. 2008. P. 87-96.
- Медведева М. В., Медведев А. В., Колосков В. А., Старков Ф. А. Клеточная самоорганизация программируемых отказоустойчивых мультимикроконтроллеров Курск: Курский гуманитарно-технический институт. 2000.
- Патент № 2185656 РФ, МПК7G06 F9/50, G05 B19/18. Распределенная система для программного управления / А. В. Малышеви др. № 2000125982/09; заявл. 16.10.2000; опубл. 20.07.2002; Бюл. № 20.