Cellular Computing and Least Squares for partial differential problems parallel solving

The pre-print archived version is not the one that is published, as the editor does not formally allow it.International audienceThis paper shows how partial differential problems can be solved thanks to cellular computing and an adaptation of the Least Squares Finite Elements Method. As cellular computing can be implemented on distributed parallel architectures, this method allows the distribution of a resource demanding differential problem over a computer network

Towards a Programming Language in Cellular Computing

Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been no- ticed. In this paper we present a new solution, an e®ective one to the Partition problem via a family of deterministic P systems with active membranes using 2-division. We intend to show that the idea of a cellular programming lan- guage is possible, indicating some \subroutines" that can be used in a variety of situations and therefore could be useful for attacking new problems in the future.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0

Complexity Classes in Cellular Computing with Membranes

In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0

Towards a Programming Language in Cellular Computing

AbstractSeveral solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been noticed. In this paper we present a new solution, to the Partition problem, via a family of deterministic P systems with active membranes using 2-division. Then, we intend to show that the idea of a cellular programming language is possible (at least for some relevant family of NP-complete problems), indicating some “subroutines” that can be used in a variety of situations and therefore could be useful for designing solutions for new problems in the future

parXXL: A Fine Grained Development Environment on Coarse Grained Architectures

http://www.hpc2n.umu.se/para06/papers/paper_48.pdfWe present a new integrated environment for cellular computing and other fine grained applications. It is based upon previous developments concerning cellular computing environments (the ParCeL family) and coarse grained algorithms (the SSCRAP toolbox). It is aimed to be portable and efficient, and at the same time to offer a comfortable abstraction for the developer of fine grained programs. A first campaign of benchmarks shows promising results on clusters and mainframes

The GPU on the simulation of cellular computing models

Membrane Computing is a discipline aiming to abstract formal computing models, called membrane systems or P systems, from the structure and functioning of the living cells as well as from the cooperation of cells in tissues, organs, and other higher order structures. This framework provides polynomial time solutions to NP-complete problems by trading space for time, and whose efficient simulation poses challenges in three different aspects: an intrinsic massively parallelism of P systems, an exponential computational workspace, and a non-intensive floating point nature. In this paper, we analyze the simulation of a family of recognizer P systems with active membranes that solves the Satisfiability problem in linear time on different instances of Graphics Processing Units (GPUs). For an efficient handling of the exponential workspace created by the P systems computation, we enable different data policies to increase memory bandwidth and exploit data locality through tiling and dynamic queues. Parallelism inherent to the target P system is also managed to demonstrate that GPUs offer a valid alternative for high-performance computing at a considerably lower cost. Furthermore, scalability is demonstrated on the way to the largest problem size we were able to run, and considering the new hardware generation from Nvidia, Fermi, for a total speed-up exceeding four orders of magnitude when running our simulations on the Tesla S2050 server.Agencia Regional de Ciencia y Tecnología - Murcia 00001/CS/2007Ministerio de Ciencia e Innovación TIN2009–13192Ministerio de Ciencia e Innovación TIN2009-14475-C04European Commission Consolider Ingenio-2010 CSD2006-0004

The P Versus NP Problem Through Cellular Computing with Membranes

We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P = NP relation by the polynomial time unsolvability of an NP–complete problem by means of a P system.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0