Implementation of kernel P systems in CUDA for solving NP-hard problems
As a newly introduced variant of P systems, kernel P systems (kP systems) contain the features of several P systems and can offer a coherent view on the integration of different P systems into the same formalism. Thus, the implementation of kP systems in CUDA for solving various problems, including NP-hard problems is worth discussing. This paper presents an implementation framework of kP systems and its implementation method in CUDA for solving a class of NP-hard problems. Both the framework and the method consider the implementation of the membrane structure, objects and evolution rules of kP systems. The subset sum and satisfiability problems are taken as two examples to show how an implementation that relies in CUDA environment is used for solving NP-hard problems. The implementation of the above mentioned problems shows an increase in speed of about 5Vo for the parallel variant compared to the normal CPU implementation.
membrane computing kernel P systems NP-hard problems CUDA
Han Huang Gexiang Zhang Marian Gheorghe
School of Electrical Engineering,Southwest Jiaotong University,Chengdu,610031,P.R. China Department of Computer Science,The University of Sheffield,Regent Court,Portobello Street,Sheffield,
国际会议
成都
英文
73-88
2013-11-04（万方平台首次上网日期，不代表论文的发表时间）