Abstract
Usually physical systems are characterized by different coupled parameters accounting for the interaction of their different components. The Cellular Automata Network (CAN) model [1] allows to represent each component of a physical system in terms of Cellular Automata (CA) [9], and the interaction among these components in terms of CA networks. In this paper we report our experimentations in exploiting two different kinds of parallelism offered by the CAN model using policies for network restructuring and thread assignment. At this purpose we used a prototype graphic tool (CANviz) designed to let the user experimenting heuristics to efficiently exploit two level parallelism in CAN applications.
Partly supported by CNR Project: “Sviluppo di una Modellistica Sperimentale Spazio-Temporale di Processi Evolutivi dell’Ambiente per la Mitigazione dei Rischi”.
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.
Similar content being viewed by others
References
Carotenuto, L., Mele, F., Mango Furnari, M., Napolitano, R.: PECANS: A ParallelEnvironment for Cellular Automata Modeling. Complex Systems 10, ComplexSystems Publications, (1996), pp. 23–41
Di Napoli, C., Giordano, M., Mango Furnari, M., Napolitano, R.: CANL: a Language for Cellular Automata Network Modeling. Proc. of Parcella’ 96, AkademieVerlag, (1996), pp. 101–111
Di Napoli, C., Giordano, M., Mango Furnari, M., Napolitano, R.: A Portable Parallel Environment for complex systems simulation through cellular automata networks. Journal of Systems Architecture 42, Elsevier Science, (1996), pp. 341–350
IEEE Computer Society: POSIX System Application Program Interface: ThreadsExtension [C Language] POSIX 1003.4A Draft8. Available from the IEEE StandardDept.
Krishnamurthy, B.: Practical Reusable Unix Software. John Wiley Sons, (1997)
Laudon, J., Lenoski, D.: The SGI Origin: A ccNUMA Highly Scalable Server. Proc. of 24th Int’1 Symp. on Computer Architecture, (1997), pp. 253–251
Ousterhout, J.K: Tcl and the Tk Toolkit. Addison Wesley (1994)
Ramaswamy, S., Sapatnekar, S., Banerjee, P.: A Framework for exploiting Task andData Parallelism on a Distributed Memory Multicomputers. IEEE Transactions onParallel and Distributed Systems, Vol. 8 No 11, (1997)
Toffoli, T., Margolus, N.: Cellular Automata Machines: A New Environment forModeling. MIT Press (1987)
Welsh, B.B.: Practical Programming in TclTk. 2nd edition, Prentice Hall (1997)
Worsh, T.: Programming Environments for Cellular Automata. Proc. of ACRI’ 96. Springer, (1996) pp. 3–12
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
Calidonna, C.R., Napoli, C.D., Giordano, M., Furnari, M.M. (2000). Exploring Multi-level Parallelism in Cellular Automata Networks. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-39999-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41128-4
Online ISBN: 978-3-540-39999-5
eBook Packages: Springer Book Archive