Persons

The parallel architectures of computing systems, including the massively parallel ones, attract a particular interest of modern researchers in the theoretical informatics field. In this connection the hardware or algorithmic acceleration of the interprocessor exchange becomes the main objective. One of the approaches to creation of algorithms can be the use of nonconventional formalism-neural networks or cellular automata (CA), to realize the model of near interaction of elementary calculators. In the work three operations with matrix data have been considered: unary, reflection, transposing. The operations have been realized by parallel algorithms in the formalism of the cellular automata in an assumption that the data had been loaded into CA before the calculation. It has been shown that all presented algorithms have linear complexity of the matrix size. Movement and modification of the data have been executed by means of introducing the bit or/and trit flag components into a cell state description. The calculation stop-conditions are the occurrence of a stop-condition of a special CA cell or of all cells of the CA field, i.e. their «freezing». The development of the cellular automata algorithmization on an example of elementary operations over matrices can be used as a base for solving more difficult tasks (for example, the calculations of a determinant of a matrix).

• Counter: 1970 | Comments : 0

The up-to-date nanostructures and nanomaterials, used as a part of the electronic component base, are characterized by high extent of heterogeneity and non-equilibrium. During operation of the device under thermal, electric and other effects its characteristics worsen as a result of proceeding of physical-chemical processes. The issues of providing the error-free and fault-tolerant operation of nanodevices in conditions of autonomous work are very urgent and require significant development of the mathematical apparatus in the reliability theory. In the paper the physical-statistic approach (PSA) to the issue of reliability of nanodevices, in particular from the VLSI fragments to the component base level, has been considered. The more accurate than previously formulations while solving the PSA equation have been given. The solution in the quadratures for one dimensional stationary case has been obtained. The PSA advantages compared to a traditional approach of physics of failures, more significant exactly for nanodevices, have been stipulated. Besides, the similarity of the approach formality and the specifics of testing the modern nanodevices with the classical BAZ model have been noted. It has been shown that based on the dynamics of the function of distribution of items in space of their characteristics both the evolution of the reliability function and the evolution of information entropy can be obtained. The weak and strong features of the hypothesis of the relation between such distribution information entropy (based on tests) and the nanodevice physical entropy have been discussed. The proposed physical-statistic approach of the reliability theory combines the advantages of the physical approach based on the concreteness of degradation mechanisms and statistical approach using the reliability function.

• Counter: 1367 | Comments : 0

The application of UML for development of the cellular automata machines (CAM) architecture has been considered. The general requirements to CAM have been formulated. An abstract structure of the CAM cell adapted to the multi agent technical system has been presented. The diagrams of usage options, the classes and sequences have been created by means of the freeware program StarUML.

• Counter: 1291 | Comments : 0

The cellular automata formulations of the algorithm for sorting arrays of characters and strings, not available in literature of recent decades, have been presented. For the first time, the cellular automation, that multiplies two integers written in a number system with an arbitrary basis, has been proposed. The algorithm is based on the Atrubin’s scheme for parallel multiplication by means of a symbolic array of processors and requires four components (registers) instead of five.

• Counter: 1828 | Comments : 0