By Topic

Parallel implementations of cellular automata algorithms on the AGILA high performance computing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. P. Saldana ; High Performance Comput. & Networking Lab., Ateneo de Manila Univ., Quezon City, Philippines ; W. C. Tabares ; W. E. S. Yu

Four basic cellular automata (CA) algorithms are implemented on a Beowulf cluster with 8 processors using MPI and C. The CA algorithms are, namely, (1) Game of Life, (2) Greenburg-Hasting, (3) Cyclic Space, and (4) Hodgepodge Machine. The mathematical and computational aspects of 1D and 2D CA are also considered

Published in:

Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on

Date of Conference: