Abstract
Our group’s recent quest has been to use P systems to model parallel and distributed algorithms. Several framework extensions are recalled or detailed, in particular, modular composition with information hiding, complex symbols, generic rules, reified cell IDs, asynchronous operational modes, asynchronous complexity. We motivate our proposals via P system models of several well-known distributed algorithms, such as leader election and distributed echo. As another type of application, we mention a dynamic programming algorithm for stereo matching in image processing. We suggest criteria to assess the merits of this modelling approach and offer preliminary evaluations of our proposed additional ingredients, which have been useful in refactoring existing systems and could be useful to the larger P systems community.
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ălănescu, T., Nicolescu, R., Wu, H.: Asynchronous P systems. International Journal of Natural Computing Research, 1–18 (in press, 2011)
Carnero, J., Díaz-Pernil, D., Molina-Abril, H., Real, P.: Image segmentation inspired by cellular models using hardware programming. In: González-Díaz, R., Real-Jurado, P. (eds.) 3rd International Workshop on Computational Topology in Image Context, pp. 143–150 (2010)
Casiraghi, G., Ferretti, C., Gallini, A., Mauri, G.: A Membrane Computing System Mapped on an Asynchronous, Distributed Computational Environment. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 159–164. Springer, Heidelberg (2006)
Cavaliere, M., Egecioglu, O., Ibarra, O.H., Ionescu, M., Păun, G., Woodworth, S.: Asynchronous Spiking Neural P Systems: Decidability and Undecidability. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 246–255. Springer, Heidelberg (2008)
Cavaliere, M., Ibarra, O.H., Păun, G., Egecioglu, O., Ionescu, M., Woodworth, S.: Asynchronous spiking neural P systems. Theor. Comput. Sci. 410, 2352–2364 (2009)
Cavaliere, M., Mura, I.: Experiments on the reliability of stochastic spiking neural P systems. Natural Computing 7, 453–470 (2008)
Cavaliere, M., Sburlan, D.: Time and synchronization in membrane systems. Fundam. Inf. 64, 65–77 (2004)
Ciobanu, G.: Distributed algorithms over communicating membrane systems. Biosystems 70(2), 123–133 (2003)
Ciobanu, G., Desai, R., Kumar, A.: Membrane Systems and Distributed Computing. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 187–202. Springer, Heidelberg (2003)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Toward practical P systems for distributed computing. In: Enachescu, D., Gramatovici, R. (eds.) Seria Matematica-Informatica (Honor of Solomon Marcus on the Occasion of his 85th Anniversary), pp. 23–34. Analele Universitatii Bucuresti (2009)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Edge- and node-disjoint paths in P systems. Electronic Proceedings in Theoretical Computer Science 40, 121–141 (2010)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: A Faster P Solution for the Byzantine Agreement Problem. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 175–197. Springer, Heidelberg (2010)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: P systems and the Byzantine agreement. Journal of Logic and Algebraic Programming 79(6), 334–349 (2010)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Synchronization in P Modules. In: Calude, C.S., Hagiya, M., Morita, K., Rozenberg, G., Timmis, J. (eds.) UC 2010. LNCS, vol. 6079, pp. 32–44. Springer, Heidelberg (2010)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: An adaptive algorithm for P system synchronization. In: Gheorghe, M., et al. (eds.) CMC 2011. LNCS, vol. 7184, pp. 139–164. Springer, Heidelberg (2012)
Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Faster synchronization in P systems. Natural Computing, 1–9 (2011)
Freund, R.: Asynchronous P Systems and P Systems Working in the Sequential Mode. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 36–62. Springer, Heidelberg (2005)
Frisco, P.: The conformon-P system: a molecular and cell biology-inspired computability model. Theor. Comput. Sci. 312, 295–319 (2004)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5, 66–77 (1983)
Gimel’farb, G.L.: Probabilistic regularisation and symmetry in binocular dynamic programming stereo. Pattern Recognition Letters 23(4), 431–442 (2002)
Gimel’farb, G., Nicolescu, R., Ragavan, S.: P Systems in Stereo Matching. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part II. LNCS, vol. 6855, pp. 285–292. Springer, Heidelberg (2011)
Kleijn, J., Koutny, M.: Synchrony and Asynchrony in Membrane Systems. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 66–85. Springer, Heidelberg (2006)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)
Nakamura, Y., Matsuura, T., Satoh, K., Ohta, Y.: Occlusion detectable stereo—occlusion patterns in camera matrix. In: CVPR, pp. 371–378. IEEE Computer Society (1996)
Nicolescu, R., Dinneen, M.J., Kim, Y.-B.: Discovering the Membrane Topology of Hyperdag P Systems. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 410–435. Springer, Heidelberg (2010)
Nicolescu, R., Dinneen, M.J., Kim, Y.-B.: Towards structured modelling with hyperdag P systems. International Journal of Computers, Communications and Control 2, 209–222 (2010)
Nicolescu, R., Wu, H.: BFS Solution for Disjoint Paths in P Systems. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 164–176. Springer, Heidelberg (2011)
Pan, L., Zeng, X., Zhang, X.: Time-free spiking neural P systems. Neural Computation 23, 1320–1342 (2011)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Peña-Cantillana, F., Díaz-Pernil, D., Berciano, A., Gutiérrez-Naranjo, M.A.: A Parallel Implementation of the Thresholding Problem by Using Tissue-Like P Systems. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part II. LNCS, vol. 6855, pp. 277–284. Springer, Heidelberg (2011)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)
Yuan, Z., Zhang, Z.: Asynchronous Spiking Neural P System with Promoters. In: Xu, M., Zhan, Y.-W., Cao, J., Liu, Y. (eds.) APPT 2007. LNCS, vol. 4847, pp. 693–702. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicolescu, R. (2012). Parallel and Distributed Algorithms in P Systems. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-28024-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28023-8
Online ISBN: 978-3-642-28024-5
eBook Packages: Computer ScienceComputer Science (R0)