High Performance and Scalable Simulations of a Bio-inspired Computational Model

The Network of Polarized Evolutionary Processors (NPEP) is a rather new variant of the bio-inspired computing model called Network of Evolutionary Processors (NEP). This model, together with its variants, is able to provide theoretical feasible solutions to hard computational problems. NPEPE is a software engine able to simulate NPEP which is deployed over Giraph, an ultra-scalable platform based on the Bulk Synchronous Parallel (BSP) programming model. Rather surprisingly, the BSP model and the underlying architecture of NPEP have many common points. Moreover, these similarities are also shared with all variants in the NEP family. We take advantage of these similarities and propose an extension of NPEPE (named gNEP) that enhances it to simulate any variant of the NEP’s family. Our extended gNEP framework, presents a twofold contribution. Firstly, a flexible architecture able to extend software components in order to include other NEP models (including the seminal NEP model and new ones). Secondly, a component able to translate input configuration files representing the instance of a problem and an algorithm based on different variants of the NEP model into some suitable input files for gNEP framework. In this work, we simulate a solution to the “3-colorability” problem which is based on NPEP. We compare the results for a specific experiment using NPEPE engine and gNEP. Moreover, we show several experiments in the aim of studying, in a preliminary way, the scalability offered by gNEP to easily deploy and execute instances of problems requiring more intensive computations.

[1]  Mario J. Pérez-Jiménez,et al.  Simulating P Systems on GPU Devices: A Survey , 2015, Fundam. Informaticae.

[2]  Jonathan W. Berry,et al.  Challenges in Parallel Graph Processing , 2007, Parallel Process. Lett..

[3]  Victor Mitrana,et al.  Accepting networks of splicing processors: Complexity results , 2007, Theor. Comput. Sci..

[4]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[5]  R. Shen,et al.  A new characterization of A5 , 2008 .

[6]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[7]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Joseph Gonzalez,et al.  PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs , 2012, OSDI.

[10]  Reynold Xin,et al.  GraphX: a resilient distributed graph system on Spark , 2013, GRADES.

[11]  Carlos Guestrin,et al.  Distributed GraphLab : A Framework for Machine Learning and Data Mining in the Cloud , 2012 .

[12]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[13]  Alberto Mozo,et al.  NPEPE: Massive Natural Computing Engine for Optimally Solving NP-complete Problems in Big Data Scenarios , 2015, ADBIS.

[14]  Victor Mitrana,et al.  Networks of splicing processors with evaluation sets as optimization problems solvers , 2016, Inf. Sci..

[15]  Elankovan Sundararajan,et al.  Parallel and distributed computing models on a graphics processing unit to accelerate simulation of membrane systems , 2014, Simul. Model. Pract. Theory.

[16]  José Miguel Rojas,et al.  Parallel Simulation of NEPs on Clusters , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[17]  Meritxell Vinyals,et al.  Solving optimization problems by using networks of evolutionary processors with quantitative filtering , 2016, J. Comput. Sci..

[18]  Victor Mitrana,et al.  A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors , 2010, Theory of Computing Systems.

[19]  Mario J. Pérez-Jiménez,et al.  An Overview of P-Lingua 2.0 , 2009, Workshop on Membrane Computing.

[20]  Hairong Kuang,et al.  The Hadoop Distributed File System , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).

[21]  Victor Mitrana,et al.  Polarization: a new communication protocol in networks of bio-inspired processors , 2019, Journal of Membrane Computing.

[22]  Alfonso Ortega,et al.  Distributed Simulation of P Systems by Means of Map-Reduce: First Steps with Hadoop and P-Lingua , 2011, IWANN.

[23]  Marcelino Campos,et al.  Accepting Networks of Genetic Processors are computationally complete , 2012, Theor. Comput. Sci..

[24]  Victor Mitrana,et al.  Networks of evolutionary processors , 2003, Acta Informatica.

[25]  Sandra Gómez Canaval,et al.  Distributed Simulation of NEPs Based On-Demand Cloud Elastic Computation , 2015, IWANN.

[26]  Michael J. Franklin,et al.  Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.

[27]  Victor Mitrana,et al.  Networks of Polarized Evolutionary Processors Are Computationally Complete , 2014, LATA.

[28]  José M. García,et al.  The GPU on the simulation of cellular computing models , 2012, Soft Comput..

[29]  Florentin Ipate,et al.  Implementation of P Systems by Using Big Data Technologies , 2013, Int. Conf. on Membrane Computing.

[30]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[31]  Tsuyoshi Murata,et al.  {m , 1934, ACML.