Welcome to the InfoSci Platform
Reference Hub3
Using Inter-Block Synchronization to Improve the Knapsack Problem on GPUs

Using Inter-Block Synchronization to Improve the Knapsack Problem on GPUs

Xue Sun, Chao-Chin Wu, Liang-Rui Chen, Jian-You Lin
Copyright: © 2018 |Volume: 10 |Issue: 4 |Pages: 16
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781522543398|DOI: 10.4018/IJGHPC.2018100105
Cite Article Cite Article

MLA

Sun, Xue, et al. "Using Inter-Block Synchronization to Improve the Knapsack Problem on GPUs." IJGHPC vol.10, no.4 2018: pp.83-98. http://doi.org/10.4018/IJGHPC.2018100105

APA

Sun, X., Wu, C., Chen, L., & Lin, J. (2018). Using Inter-Block Synchronization to Improve the Knapsack Problem on GPUs. International Journal of Grid and High Performance Computing (IJGHPC), 10(4), 83-98. http://doi.org/10.4018/IJGHPC.2018100105

Chicago

Sun, Xue, et al. "Using Inter-Block Synchronization to Improve the Knapsack Problem on GPUs," International Journal of Grid and High Performance Computing (IJGHPC) 10, no.4: 83-98. http://doi.org/10.4018/IJGHPC.2018100105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article describes how as one of the hot parallel processors, the general-purpose graphics processing unit (GPU) has been widely adopted to accelerate various time-consuming algorithms. Dynamic programming (DP) optimization is a popular method to solve a particular class of complex problems. This article focuses on serial-monadic DP problems onto NVIDIA GPUs. As 0/1 knapsack is one of the most representational problems in this category and it often arises in many other fields of applications. The previous work proposed the compression method to reduce the amount of data transferred, but data in shared memory cannot be reused. This article demonstrates how to apply a more condensed data structure and the inter-block synchronization to efficiently map the serial-monadic DP onto GPUs. Computational experiments reveal that the best performance improvement of the approach is about 100% comparing with the previous work.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.