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

被引：2

作者：

Saldaña, RP ^{[1
]}

Tabares, WC ^{[1
]}

Yu, WES ^{[1
]}

机构：

[1] Ateneo Manila Univ, High Performance Comp & Networking Lab, Quezon City, Philippines

来源：

I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS | 2002年

关键词：

cellular automata; beowulf cluster; AGILA HPCS; parallel computing; Game of Life; Greenburg-Hasting; Cyclic Space; Hodgepodge Machine; complex systems; mathematical modeling; computational simulation; visualization;

D O I：

10.1109/ISPAN.2002.1004271

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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. Also, the mathematical and computational aspects of 1D and 2D CA are considered.

引用

页码：125 / 131

页数：7

共 11 条

[1]

EICHENAUERHERRMANN J, 1991, MATH COMPUT, V56, P297, DOI 10.1090/S0025-5718-1991-1052092-X

[2]

FISCH R, 1991, STAT COMPUTING

[3]

Gaylord R., 1996, MODELING NATURE CELL

[4]

Gaylord RJ, 1994, COMPUTER SIMULATIONS

[5]

MARSAGLIA G, 1968, P NATL ACAD SCI US A, V60, P2

[6]

SALDANA R, 2000, P 1 PHIL COMP SCI C

[7]

SALDANA R, 2000, P 18 NAT PHYS C PHIL

[8]

SALDANA R, 2001, P CELL AUT S CA 2001

[9] Cellular processing tools for high-performance simulation [J].

Talia, D .

COMPUTER, 2000, 33 (09) :44-+

[10] CELLULAR AUTOMATA AS MODELS OF COMPLEXITY [J].

WOLFRAM, S .

NATURE, 1984, 311 (5985) :419-424

← 1 2 →