%0 Generic
%D 2010
%T Simulating a P system based efficient solution to SAT by using GPUs
%A José M. Cecilia
%A José M. García
%A Ginés D. Guerrero
%A Miguel A. Martínez-del-Amor
%A Ignacio Pérez-Hurtado
%A Mario J. Pérez-Jiménez
%C North Holland
%I Elsevier B.V.
%K GPUs
%K Membrane computing
%K P systems
%K SAT
%N 6
%P 317-325
%R dx.doi.org/10.1016/j.jlap.2010.03.008
%U http://dx.doi.org/10.1016/j.jlap.2010.03.008
%V 79
%X P systems are inherently parallel and non-deterministic theoretical computing devices defined inside the field of Membrane Computing. Many P system simulators have been presented in this area, but they are inefficient since they cannot handle the parallelism of these devices. Nowadays, we are witnessing the consolidation of the GPUs as a parallel framework to compute general purpose applications. In this paper, we analyse GPUs as an alternative parallel architecture to improve the performance in the simulation of P systems, and we illustrate it by using the case study of a family of P systems that provides an efficient and uniform solution to the SAT problem. Firstly, we develop a simulator that fully simulates the computation of the P system, demonstrating that GPUs are well suited to simulate them. Then, we adapt this simulator to the GPU architecture idiosyncrasies, improving the performance of the previous simulator.
%Z Membrane computing and programming
%8 08/2010