[starlogo-users] serial CA algorithm

[kevin mcgee]

Can anyone on this list point me to information about a particular
class of serial algorithms for parallel simulations?

A typical problem for systems such as those modeled with starlogo is
how to accurately update the "parallel" movement of turtles that have
certain physical properties (collision, etc.) so that their movement
is local with each time-step. In other words, a simple serial
algorithm runs the risk of moving one turtle from one cell to another
-- and then moving it again (so it is now 2 cells from its original
location) in the *same* time-step. This can occur, for example, when
the movement of the next turtle is calculated in such a way as to
displace the first turtle.

I'm looking for pointers to "mark and sweep" algorithms that may not
be particularly efficient, but nonetheless guarantee that no turtle is
moved more than one physical cell (Moore neighborhood) in a
single time-step.

It's not necessary to send/post the details of the algorithms; any
pointers to relevant authors, papers, or names of algorithms will do.

Thanks,

kevin