2014
DOI: 10.4018/ijghpc.2014010101
|View full text |Cite
|
Sign up to set email alerts
|

Adjusting Thread Parallelism Dynamically to Accelerate Dynamic Programming with Irregular Workload Distribution on GPGPUs

Abstract: Dynamic Programming (DP) is an important and popular method for solving a wide variety of discrete optimization problems such as scheduling, string-editing, packaging, and inventory management. DP breaks problems into simpler subproblems and combines their solutions into solutions to original ones. This paper focuses on one type of dynamic programming called Nonserial Polyadic Dynamic Programming (NPDP). To run NPDP applications efficiently on an emerging General-Purpose Graphic Processing Unit (GPGPU), the au… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…For MCCtk, Figure 4(a-i) is the initial interface on the web service; the inputs, Query and Database files, can be selected on the web as shown in Figure 4(a-ii); the information of compounds with similar structure are listed in Figure 4(a-iii). Figure 4(b-i) is the initial (Wu et al, 2014) and multi-GPU communication (Playne, Hawick, 2015), will be considered to apply into the proposed platform and tools.…”
Section: Resultsmentioning
confidence: 99%
“…For MCCtk, Figure 4(a-i) is the initial interface on the web service; the inputs, Query and Database files, can be selected on the web as shown in Figure 4(a-ii); the information of compounds with similar structure are listed in Figure 4(a-iii). Figure 4(b-i) is the initial (Wu et al, 2014) and multi-GPU communication (Playne, Hawick, 2015), will be considered to apply into the proposed platform and tools.…”
Section: Resultsmentioning
confidence: 99%