A PARALLEL CELLULAR-AUTOMATA ENVIRONMENT ON MULTICOMPUTERS FOR COMPUTATIONAL SCIENCE

被引:51
作者
CANNATARO, M
DIGREGORIO, S
RONGO, R
SPATARO, W
SPEZZANO, G
TALIA, D
机构
[1] CRAI,LOCALITA S STEFANO,I-87036 RENDE,ITALY
[2] UNIV CALABRIA,DEPT MATH,I-87036 ARCAVACATA,ITALY
关键词
CELLULAR AUTOMATA; MULTICOMPUTERS; PARALLEL PROCESSING; SIMULATION; SOFTWARE TOOLS; TRANSPUTER;
D O I
10.1016/0167-8191(94)00099-V
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper describes CAMEL (Cellular Automata environMent for systEms modeLing), a scalable software environment based on the cellular automata theory implemented on a Transputer-based parallel computer. Cellular automata were originally defined as a theory to model the basic mechanisms of dynamic systems, permitting a new approach which is in many cases simpler and more efficient than the traditional approach based on partial differential equations. Today, cellular automata become more attractive because they are suitable to be effectively and naturally implemented on parallel computers achieving high performance. CAMEL allows a user to program computational science applications exploiting the computing power offered by highly parallel computers in a transparent way. CAMEL implements a cellular automaton as a SPMD program. A load balancing strategy is used to minimize time costs in case of not uniform intervals for transition steps. In the paper the programming environment and the parallel architecture of CAMEL are presented and some experiments are discussed.
引用
收藏
页码:803 / 823
页数:21
相关论文
共 22 条
[1]  
BARCA D, 1993, ACTIVE LAVAS
[2]  
Burks A., 1970, ESSAYS CELLULAR AUTO
[3]   DESIGN, IMPLEMENTATION AND EVALUATION OF A DEADLOCK-FREE ROUTING ALGORITHM FOR CONCURRENT COMPUTERS [J].
CANNATARO, M ;
SPEZZANO, G ;
TALIA, D ;
GALLIZZI, E .
CONCURRENCY-PRACTICE AND EXPERIENCE, 1992, 4 (02) :143-161
[4]  
CANNATARO M, 1993, P INTER SECTION AICA, P143
[5]   A TAXONOMY OF SCHEDULING IN GENERAL-PURPOSE DISTRIBUTED COMPUTING SYSTEMS [J].
CASAVANT, TL ;
KUHL, JG .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (02) :141-154
[6]  
CONWAY JH, 1982, WINNING WAYS MATH PL
[7]   REVERSIBILITY IN CELLULAR AUTOMATA [J].
DIGREGORIO, S ;
TRAUTTEUR, G .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (03) :382-391
[8]  
DIGREGORIO S, 1991, 1 CONV NAZ INF CHIM, P118
[9]   SPATIAL MACHINES - A MORE REALISTIC APPROACH TO PARALLEL COMPUTATION [J].
FELDMAN, Y ;
SHAPIRO, E .
COMMUNICATIONS OF THE ACM, 1992, 35 (10) :60-73
[10]   MODEL PROGRAMS FOR COMPUTATIONAL SCIENCE - A PROGRAMMING METHODOLOGY FOR MULTICOMPUTERS [J].
HANSEN, PB .
CONCURRENCY-PRACTICE AND EXPERIENCE, 1993, 5 (05) :407-423