Show simple item record

dc.contributor.advisorQasem, Apan
dc.contributor.authorRashid, Hammad A. ( )en_US
dc.date.accessioned2012-02-24T10:19:06Z
dc.date.available2012-02-24T10:19:06Z
dc.date.issued2010-08en_US
dc.identifier.citationRashid, H. A. (2010). Parallel knapsack algorithms on multicore architectures (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/3904
dc.description.abstractEmergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced by the selection of the algorithm, algorithmic choice also plays a critical role in achieving high performance on modern architectures. Hence, in the era of multicore computing, it is important to re-evaluate algorithms efficiency for key problem domains. This paper investigates the impact of algorithmic choice on the performance of parallel implementations of the integral knapsack problem on multicore architectures. The study considers two algorithms and their parallel implementations, and examines several aspects of performance including speedup and scalability.en_US
dc.formatText
dc.format.extent126 pages
dc.format.medium1 file (.pdf)
dc.language.isoen
dc.subjectMulticoreen_US
dc.subjectKnapsacken_US
dc.subjectParallelen_US
dc.subjectOpenmpen_US
dc.subject.classificationComputer Sciencesen_US
dc.titleParallel Knapsack Algorithms on Multicore Architecturesen_US
txstate.documenttypeThesis
dc.contributor.committeeMemberNovoa, Clara
dc.contributor.committeeMemberMcKenney, Mark
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorTexas State University-San Marcosen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
txstate.departmentComputer Science


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record