loading...
The Cellular Automata Network Compiler System: Modules and Features
Dresden, Germany September 07-September 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.67International Conference on Parallel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
C. R. Calidonna, Istituto di Cibernetica "E. Caianiello" C.N.R, Italy
M. Mango Furnari, Istituto di Cibernetica "E. Caianiello" C.N.R, Italy
In simulating complex phenomena by Cellular Automata (CA) programming model performances assume a crucial role. The efficient exploitation of intrinsic parallelism is a must for this kind of applications. The Cellular Automata Network (CAN) model, that is an extension of the CA classical model due to the introduction of the network abstraction between automata nodes, offer another parallelism source besides to the classical CA parallelism source. In order to exploit efficiently this opportunities tools and systems must be designed. In this paper we deal with the CAN compiler system components description and features designed ad hoc.
Citation:
C. R. Calidonna, M. Mango Furnari, "The Cellular Automata Network Compiler System: Modules and Features," parelec, pp.271-276, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.