论文信息 - Lazy Cellular Automata with Communicating Processes

Lazy Cellular Automata with Communicating Processes

Cellular automata (CAs) are good examples of systems in which large num- bers of autonomous entities exhibit emergent behaviour. Using the occam-pi and JCSP communicating process systems, we show how to construct "lazy" and "just-in- time" models of cellular automata, which permit very efficie nt parallel simulation of sparse CA populations on shared-memory and distributed systems.

Adam T. Sampson | Peter H. Welch | Fred R. M. Barnes

[1] Corporate Inmos Limited. Communicating Process Architecture , 1989 .

[2] Adam T. Sampson,et al. Barrier Synchronisation for occam-pi , 2005, PDPTA.

[3] R. Gosper. Exploiting regularities in large cellular spaces , 1984 .

[4] Fred R. M. Barnes,et al. Dynamics and pragmatics for high performance concurrency , 2003 .

[5] Damian J. Dimmich,et al. A Foreign-Function Interface Generator for occam-pi , 2005, CPA.

[6] A. Tanenbaum. Computer recreations , 1973 .

[7] Peter H. Welch,et al. Process Oriented Design for Java: Concurrency for All , 2002, International Conference on Computational Science.

[8] Andrew Adamatzky,et al. New Media for Collision-Based Computing , 2002, Collision-Based Computing.

[9] Peter H. Welch,et al. Higher-Level Paradigms for Deadlock-Free High-Performance Systems , 1993 .

[10] Peter H. Welch,et al. Prioritised Dynamic Communicating Processes: Part II , 2002 .