Parallel programming with MPI
Journal of Computer and System Sciences
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
Fundamenta Informaticae - Membrane computing
Client-Server P Systems in Modeling Molecular Interaction
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
A faster P solution for the Byzantine agreement problem
CMC'10 Proceedings of the 11th international conference on Membrane computing
Discovering the membrane topology of hyperdag p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Self-adaptive and reconfigurable distributed computing systems
Applied Soft Computing
| Hi-index | 0.00 |
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.