Membrane Systems and Distributed Computing
This paper presents membrane systems as an appropriate model for distributed computing, an efficient and natural environment to present the fundamental distributed algorithms. We support the idea that P systems can become a primary model for distributed computing, particularly for message-passing algorithms. We present the core theory, the fundamental algorithms and problems in distributed computing. We focus on an example describing an immune response system against virus attacks. The example is implemented using a P system library created by the authors to simulate the main functions of a P system, and an MPI program that takes advantage of the highly parallel features provided by the model. The program uses distributed leader election and synchronization algorithms.
Unable to display preview. Download preview PDF.
- 1.H. Attiya, J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 1998.Google Scholar
- 2.G. Ciobanu. Distributed algorithms over communicating membrane systems, BioSystems, Elsevier, to appear.Google Scholar
- 4.G. Ciobanu, D. Dumitriu, D. Huzum, G. Moruz, B. Tanasă. Client-Server P Systems in modeling molecular interaction. In Gh. Păun, G. Rozenberg, A. Salomaa, C. Zandron (Eds.): Membrane Computing 2002, Lecture Notes in Computer Science-this volume, Springer, 2002.Google Scholar
- 6.P. Pacheco. Parallel Programming with MPI, Morgan Kaufmann Publishers, 1997.Google Scholar
- 8.M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra. MPI-The Complete Reference vol.1, The MPI Core, 2nd edition, MIT Press, 1998.Google Scholar