Implementation of Kernel P Systems in CUDA for Solving NP-hard Problems

被引：0

作者：

Fan, Songhai ^{[1
]}

Gong, Yiyu ^{[1
]}

Zhang, Gexiang ^{[2
,3
]}

Xiao, Yun ^{[4
]}

Rong, Haina ^{[3
]}

Paul, Prithwineel ^{[2
,3
]}

Ma, Xiaomin ^{[1
]}

Huang, Han ^{[3
]}

Gheorghe, Marian ^{[5
]}

机构：

[1] State Grid Sichuan Elect Power Co, Chengdu 610094, Peoples R China

[2] Chengdu Univ Technol, Res Ctr Artificial Intelligence, Chengdu 610059, Peoples R China

[3] Southwest Jiaotong Univ, Sch Elect Engn, Chengdu 611756, Peoples R China

[4] Beijing Jiaotong Univ, Sch Elect & Informat Engn, Beijing 100044, Peoples R China

[5] Univ Bradford, Dept Comp Sci, Bradford BD 7 1DP, W Yorkshire, England

来源：

INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING | 2021年 / 16卷 / 2-3期

基金：

中国国家自然科学基金;

关键词：

Membrane computing; kernel P systems; NP-hard problems; CUDA; ATTACKING;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

As a newly introduced variant of P systems, kernel P systems (kP systems) contain the features of several kinds of 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 5% for the parallel variant compared to the normal CPU implementation.

引用

页码：259 / 278

页数：20

共 50 条

[21] A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
Lazarev, Alexander A.
Werner, Frank
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 58 (04) : 619 - 631
[22] APPLYING THE GENETIC APPROACH TO SIMULATED ANNEALING IN SOLVING SOME NP-HARD PROBLEMS
LIN, FT
KAO, CY
HSU, CC
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (06): : 1752 - 1767
[23] SOLVING NP-HARD PROBLEMS ON GRAPHS THAT ARE ALMOST TREES AND AN APPLICATION TO FACILITY LOCATION-PROBLEMS
GUREVICH, Y
STOCKMEYER, L
VISHKIN, U
JOURNAL OF THE ACM, 1984, 31 (03) : 459 - 473
[24] On the solution of NP-hard linear complementarity problems
Joaquim J. Júdice
Ana M. Faustino
Isabel Martins Ribeiro
Top, 2002, 10 (1) : 125 - 145
[25] SOME NP-HARD POLYGON DECOMPOSITION PROBLEMS
OROURKE, J
SUPOWIT, KJ
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 181 - 190
[26] MULTIVARIATE ALGORITHMICS FOR NP-HARD STRING PROBLEMS
Bulteau, Laurent
Hueffner, Falk
Komusiewicz, Christian
Niedermeier, Rolf
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2014, (114): : 32 - 73
[27] Rigorous Analysis of Heuristics for NP-Hard Problems
Feige, Uriel
PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 927 - 927
[28] Nested Quantum Search and NP-Hard Problems
Nicolas J. Cerf
Lov K. Grover
Colin P. Williams
Applicable Algebra in Engineering, Communication and Computing, 2000, 10 : 311 - 338
[29] NP-hard Problems of Learning From Examples
Chen, Bin
Quan, Guangri
FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2008, : 182 - 186
[30] Nested quantum search and NP-hard problems
Cerf, NJ
Grover, LK
Williams, CP
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2000, 10 (4-5) : 311 - 338

← 1 2 3 4 5 →