Home         Authors   Papers   Year of conference   Themes   Organizations        To MES conference

Cellular Automata Computational Parallelism of Elementary Matrix Operations  

 Matyushkin I.V.
 Zapletina M.A.
Date of publication

 The algorithms of strict classical cellular automata formalization with initial states declaration, local rule and neighborhood definitions for some elementary operations on vectors and matrices in the requirements of mass parallelism are presented. The dynamics of cellular automata field state is presented clearly. Among the tasks are the unary element operation, the matrix reflection and transposition. The origi-nal solutions meet the more stringent parallelization condi-tions for a computer with the cellular automata architecture in compare to traditional methods. There is no attachment to concrete hardware model that makes the represented algo-rithms more universal. The methods for matrix reflecting and transposition introduce special global break criteria based on compositions of flags states of local cells and their first-order neighbors. The break on cellular automata state invariance was considered. All the algorithms have the complexity according to the linear dimension of the matrix.
 cellular automata, matrix operations, linear algebra, parallel computing, non-traditional architectures.
Library reference
 Matyushkin I.V., Zapletina M.A. Cellular Automata Computational Parallelism of Elementary Matrix Operations // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2018. Issue 3. P. 132-137.
URL of paper

Copyright © 2009-2019 IPPM RAS. All Rights Reserved.

Design of site: IPPM RAS