In this paper, the star-packing problem introduced in [1] for a square lattice is generalized for d-dimensional lattice Ld, d 2 N. The problem is to pack the lattice Ld with star graphs S2d. Using the solution of this problem, a parallel algorithm for the simulation of d-dimensional cellular automata is developed. As an example of cellular automata, the relaxation process of unstable states of Abelian sandpile model is considered. Appropriate software packages have been developed using OpenMP and CUDA technologies. The parallel simulation results, carried out for 3-dimensional lattices of different sizes, are presented.
oai:arar.sci.am:258899
ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան
Dec 8, 2023
Jul 24, 2020
25
https://arar.sci.am/publication/282028
Edition name | Date |
---|---|
The Parallel Simulation Method for d-dimensional Abelian Sandpile Automata | Dec 8, 2023 |
Volyam H. Hovnanyan Suren S. Poghosyan Vahagn S. Poghosyan
Vilyam H. Hovnanyan Suren S. Poghosyan Vahagn S. Poghosyan
Vladimir G. Sahakyan Yuri H. Shoukourian Hrachya V. Astsatryan
Vilyam H. Hovnanyan Suren S. Poghosyan Vahagn S. Poghosyan
Hayk E. Nahapetyan Suren S. Poghosyan