Show simple item record

dc.contributor.advisorRajopadhye, Sanjay
dc.contributor.authorSifat, Tarequl Islam
dc.contributor.committeememberPouchet, Louis Noel
dc.contributor.committeememberBetten, Anton
dc.date.accessioned2019-06-14T17:06:21Z
dc.date.available2019-06-14T17:06:21Z
dc.date.submitted2019
dc.description2019 Spring.
dc.descriptionIncludes bibliographical references.
dc.description.abstractThe 0/1-Knapsack Problem is a classic NP-hard problem. There are two common approaches to obtain the exact solution: branch-and-bound (BB) and dynamic programming (DP). A socalled, "sparse" DP algorithm (SKPDP) that performs fewer operations than the standard algorithm (KPDP) is well known. To the best of our knowledge, there has been no quantitative analysis of the benefits of sparsity. We provide a careful empirical evaluation of SKPDP and observe that for a "large enough" capacity, C, the number of operations performed by SKPDP is invariant with respect to C for many problem instances. This leads to the possibility of an exponential improvement over the conventional KPDP. We experimentally explore SKPDP over a large range of knapsack problem instances and provide a detailed study of the attributes that impact the performance. DP algorithms have a nice regular structure and are amenable to highly parallel implementations. However, due to the dependence structure, parallelizing SKPDP is challenging. We propose two parallelization strategies (fine-grain and coarse-grain) for SKPDP on modern multi-core processors and demonstrate a scalable improvement in the performance.
dc.format.mediumborn digital
dc.format.mediummasters theses
dc.identifierSifat_colostate_0053N_15373.pdf
dc.identifier.urihttps://hdl.handle.net/10217/195332
dc.languageEnglish
dc.publisherColorado State University. Libraries
dc.relation.ispartof2000-2019 - CSU Theses and Dissertations
dc.rightsCopyright of the original work is retained by the author.
dc.subjectdynamic programming
dc.subjectsparsity
dc.subjectsalable parallelization
dc.subject0/1 knapsack
dc.titleRevisiting sparse dynamic programming for the 0/1 Knapsack Problem
dc.typeText
dcterms.rights.dplaThe copyright and related rights status of this item has not been evaluated (https://rightsstatements.org/vocab/CNE/1.0/). Please refer to the organization that has made the Item available for more information.
thesis.degree.disciplineComputer Science
thesis.degree.grantorColorado State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science (M.S.)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record