Abstract
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level programming language based on the biology-inspired cellular automata theory. CARPET is a programming language designed for supporting the development of parallel high-performance software abstracting from the parallel architecture on which programs run. We introduce the main constructs of CARPET and discuss how the language can be effectively utilized to implement natural solvers of real-world complex problems such as forest fire and circuitry simulations. Performance figures of the experiments carried out on a MIMD parallel computer show the effectiveness of our approach both in terms of execution time and speedup.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. P. Brinch Hansen, Parallel cellular automata: a model for computational science, Concurrency: Practice and Experience, 5:425–448, 1993.
M. Cannataro, S. Di Gregorio, R. Rongo, W. Spataro, G. Spezzano, and D. Talia, A parallel cellular automata environment on multicomputers for computational science, Parallel Computing, 21:803–824, 1995.
A. K Dewdney, Cellular automata programs that create wireworld, rugworld and other diversions, Scientific American, 262: 146–149, 1990.
S. Di Gregorio, R. Rongo, W. Spataro, G. Spezzano, and D. Talia, A parallel cellular tool for interactive modeling and simulation, IEEE Computational Science & Engineering3:33–43, 1996.
S. Di Gregorio, R. Rongo, W. Spataro, G. Spezzano, and D. Talia, High performance scientific computing by a parallel cellular environment, Future Generation Computer Systems, North-Holland, Amsterdam, 12:357–369, 1997.
J. D. Eckart, Cellang 2.0: reference manual, ACM Sigplan Notices, 27: 107–112, 1992.
G. Folino, C. Pizzuti, and G. Spezzano, Solving the satisfiability problem by a parallel cellular genetic algorithm, Proc. of Euromicro Workshop on Computational Intelligence, IEEE Computer Society Press, pp. 715–722, 1998.
D.B. Skillicorn and D. Talia, “Models and languages for parallel computation”, ACM Computing Survey, 30:123–169, 1998.
G. Spezzano and D. Talia, A high-level cellular programming model for massively parallel processing, in: Proc. 2 ndInt. Workshop on High-Level Programming Models and Supportive Environments (HIPS97), IEEE Computer Society, pp. 55–63, 1997.
J. von Neumann, Theory of Self Reproducing Automata, University of Illinois Press, 1966.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Talia, D. (2000). Solving Problems on Parallel Computers by Cellular Programming. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_81
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive