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 条

[1] Solving NP-hard combinatorial problems in the practical sense
Ibaraki, T
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 1 - 1
[2] Wisdom of artificial crowds algorithm for solving NP-hard problems
Yampolskiy, Roman V.
EL-Barkouky, Ahmed
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2011, 3 (06) : 358 - 369
[3] Comparing Problem Solving Strategies for NP-hard Optimization Problems
Hidalgo-Herrero, Mercedes
Rabanal, Pablo
Rodriguez, Ismael
Rubio, Fernando
FUNDAMENTA INFORMATICAE, 2013, 124 (1-2) : 1 - 25
[4] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Elijah Pelofske
Georg Hahn
Hristo Djidjev
Journal of Signal Processing Systems, 2021, 93 : 405 - 420
[5] An automatic tuning system for solving NP-hard problems in clouds
Ngoko, Yanik
Trystram, Denis
Reis, Valentin
Cerin, Christophe
2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 1443 - 1452
[6] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Pelofske, Elijah
Hahn, Georg
Djidjev, Hristo
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2021, 93 (04): : 405 - 420
[7] Simulation of an analogue circuit solving NP-hard optimization problems
Babicz, Dora
Tihanyi, Attila
Koller, Miklos
Rekeczky, Csaba
Horvath, Andras
2019 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2019,
[8] SOLVING NP-HARD PROBLEMS IN ALMOST TREES - VERTEX COVER
COPPERSMITH, D
VISHKIN, U
DISCRETE APPLIED MATHEMATICS, 1985, 10 (01) : 27 - 45
[9] SOLVING LP RELAXATIONS OF SOME NP-HARD PROBLEMS IS AS HARD AS SOLVING ANY LINEAR PROGRAM
Prusa, Daniel
Werner, Tomas
SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (03) : 1745 - 1771
[10] Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
Kyriienko, O.
Sigurdsson, H.
Liew, T. C. H.
PHYSICAL REVIEW B, 2019, 99 (19)

← 1 2 3 4 5 →