The Cellular Automata Network Compiler System: Modules and Features

Authors:
C. R. Calidonna;M. Mango Furnari
Affiliations:
Istituto di Cibernetica "E. Caianiello" C.N.R, Italy;Istituto di Cibernetica "E. Caianiello" C.N.R, Italy
Venue:
PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
Year:
2004

Citing 0
Cited 2

Interdisciplinary issues for the management of next generation autonomic wireless systems: nature-inspired techniques and organic computing

International Journal of Mobile Network Design and Innovation
CAOS: a domain-specific language for the parallel simulation of cellular automata

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.