scholarly journals Linear speed-up for cellular automata synchronizers and applications

1997 ◽  
Vol 188 (1-2) ◽  
pp. 45-57 ◽  
Author(s):  
Olivier Heen
1992 ◽  
Vol 101 (1) ◽  
pp. 59-98 ◽  
Author(s):  
J. Mazoyer ◽  
N. Reimen

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Biljana Stamatovic ◽  
Gregor Kosec ◽  
Roman Trobec ◽  
Xiao Xuan ◽  
Sinisa Stamatovic

We propose a new algorithm based on cellular automation (CA) for preservingn-connectivity,n>1. The CA algorithm transforms an initial grid configuration in a grid with same number of holes but without 1-connected components. Also, maximal thinning ofn-connected components,n>1, is achieved. The grid can be used as initial for investigating properties of initial grid. Computational performances are evaluated and measured on real cases. The obtained results indicate that the proposed approach achieves comparable complexity as standard approaches; however, the speed-up and scalability of the proposed algorithm are not limited by the number of processing nodes.


Author(s):  
Natalia V. Menshutina ◽  
Igor V. Lebedev ◽  
Evgeniy A. Lebedev ◽  
Ratmir R. Dashkin ◽  
Mikhail V. Shishanov ◽  
...  

The presented work is devoted to reactions of obtaining 4,4´-diaminodiphenylmethane in the presence of a catalyst. The work describes the importance of studying 4,4´-diaminodiphenylmethane obtaining process and possibility of cellular automata approach in modelling chemical reactions. Cellular automata model which allows to predict the kinetic curves of the studied 4,4´-diaminodiphenylmethane-obtaining reaction. Model reflects two processes that are observed in the system under study - the movement of reagents under the stirring and the reaction in the presence of a catalyst. The suggested model does not use complex calculations for operation and can be implemented using high-performance parallel computing, which will speed up calculations and reduce the requirements for computing resources. The developed model was used to carry out computational experiments under various conditions. Since the model contains a number of empirical parameters, first computational experiments were carried out, which made it possible to establish the relationship between the model parameters and real values. Then, computational experiments were carried out to predict the kinetic curves of the studied reactions and were compared with the corresponding experimental data. The suggested model is suitable for predicting 4,4´-diaminodiphenylmethane-obtaining reaction kinetics. Also, model can be the part of complex multiscale modeling from the molecule level to the level of the entire apparatus.


Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 71
Author(s):  
Vladimir Gurvich ◽  
Mikhail Vyalyi

We study the algorithmic complexity of solving subtraction games in a fixed dimension with a finite difference set. We prove that there exists a game in this class such that solving the game is EXP-complete and requires time 2Ω(n), where n is the input size. This bound is optimal up to a polynomial speed-up. The results are based on a construction introduced by Larsson and Wästlund. It relates subtraction games and cellular automata.


Sign in / Sign up

Export Citation Format

Share Document