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 条

[41] SYSTOLIC ARCHITECTURE FOR SOLVING NP-HARD COMBINATORIAL PROBLEMS OF LOGIC DESIGN AND RELATED AREAS
HO, PM
PERKOWSKI, MA
1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 1170 - 1173
[42] Solving linear interval systems is NP-hard even if we exclude overflow and underflow
Heindl, Gerhard
Kreinovich, Vladik
Lakeyev, Anatoly V.
Reliable Computing, 1998, 4 (04) : 383 - 388
[43] Solving Linear Interval Systems Is NP-Hard even if We Exclude Overflow and Underflow
Heindl, Gerhard
Kreinovich, Vladik
Lakeyev, Anatoly V.
Reliable Computing, 1998, 10 (03) : 383 - 388
[44] Automating Algebraic Proof Systems Is NP-Hard
de Rezende, Susanna F.
Goeoes, Mika
Nordstrom, Jakob
Pitassi, Toniann
Robere, Robert
Sokolov, Dmitry
STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 209 - 222
[45] The Simplest Families of Polytopes Associated with NP-Hard Problems
Maksimenko, A. N.
DOKLADY MATHEMATICS, 2015, 91 (01) : 53 - 55
[46] Faster exact solutions for some NP-hard problems
Drori, L
Peleg, D
THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 473 - 499
[47] Parameterized algorithms of fundamental NP-hard problems: a survey
Li, Wenjun
Ding, Yang
Yang, Yongjie
Sherratt, R. Simon
Park, Jong Hyuk
Wang, Jin
HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2020, 10 (01)
[48] Probabilistic solutions to some NP-hard matrix problems
Vidyasagar, M
Blondel, VD
AUTOMATICA, 2001, 37 (09) : 1397 - 1405
[49] MATRIX REPRESENTATION AND GRADIENT FLOWS FOR NP-HARD PROBLEMS
WONG, WS
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1995, 87 (01) : 197 - 220
[50] Stochastic Enumeration Method for Counting NP-Hard Problems
Reuven Rubinstein
Methodology and Computing in Applied Probability, 2013, 15 : 249 - 291

← 1 2 3 4 5 →