Asynchronous updating cellular automata

I have a collection of computational models that could be described as asynchronous cellular automata.

These models resemble the Ising model, but are slightly more complicated.

I'm aware that there is literature on the subject, but it all seems to be aimed at hardcore computer scientists who are interested in the details of algorithmic complexity, rather than someone like me who just wants a description of something I can implement, and consequently I find it rather inpenetrable.

For clarity, I'm not looking for an optimal algorithm so much as something I can rapidly implement in CUDA that's likely to give a significant speedup over my CPU implementation.

The statistical properties of this method are completely independent of the size of the grid.

Asynchronous method dispatch, also known as AMD, is a client-server networking model that a server does not need to wait for a client's response before processing other client requests.

We analyze the properties of a synchronous and of various asynchronous methods to iterate cellular automata.

Their basins of attraction might, however, be vastly different under synchronous and asynchronous iteration.

Cellular automata, as with other multi-agent system models, usually treat time as discrete and state updates as occurring synchronously.


Leave a Reply