{"id":"https://openalex.org/W780986551","doi":null,"title":"Accelerating the knapsack problem on GPUs","display_name":"Accelerating the knapsack problem on GPUs","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W780986551","mag":"780986551"},"language":"en","primary_location":{"id":"pmh:oai:DiVA.org:liu-70406","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400653","display_name":"DiVA (Digitala Vetenskapliga Arkivet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/bachelorThesis"},"parent_works":[],"lineage":["https://openalex.org/W780986551"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085151077","display_name":"Bharath Suri","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bharath Suri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5085151077"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9330999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9330999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.03359999880194664,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.01140000019222498,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":0.8700000047683716},{"id":"https://openalex.org/keywords/multiple-choice-knapsack-problem","display_name":"multiple-choice knapsack problem","score":0.9710000157356262},{"id":"https://openalex.org/keywords/gpu-acceleration","display_name":"GPU acceleration","score":0.9200000166893005},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9649999737739563},{"id":"https://openalex.org/keywords/system-level-design","display_name":"system-level design","score":0.7229999899864197},{"id":"https://openalex.org/keywords/embedded-systems","display_name":"embedded systems","score":0.9789999723434448},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.6259999871253967},{"id":"https://openalex.org/keywords/pseudo-polynomial-time","display_name":"pseudo-polynomial time","score":0.6800000071525574}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9911128282546997},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8557425141334534},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7760066986083984},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.6364027261734009},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6149085760116577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6125120520591736},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6095418334007263},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5466440916061401},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5046902894973755},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48369985818862915},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47345346212387085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4685707092285156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4453252851963043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10023197531700134}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:DiVA.org:liu-70406","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400653","display_name":"DiVA (Digitala Vetenskapliga Arkivet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/bachelorThesis"},{"id":"mag:780986551","doi":null,"is_oa":false,"landing_page_url":"http://www.diva-portal.org/smash/record.jsf?pid=diva2:439054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:DiVA.org:liu-70406","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400653","display_name":"DiVA (Digitala Vetenskapliga Arkivet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/bachelorThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1490182363","https://openalex.org/W1686420892","https://openalex.org/W1994389497","https://openalex.org/W2004268641","https://openalex.org/W2011625592","https://openalex.org/W2014289527","https://openalex.org/W2024386636","https://openalex.org/W2045247420","https://openalex.org/W2057795393","https://openalex.org/W2066671865","https://openalex.org/W2079843505","https://openalex.org/W2094377471","https://openalex.org/W2101980173","https://openalex.org/W2104787167","https://openalex.org/W2106287110","https://openalex.org/W2109197177","https://openalex.org/W2111953042","https://openalex.org/W2116220526","https://openalex.org/W2117285153","https://openalex.org/W2117689653","https://openalex.org/W2120062497","https://openalex.org/W2127172809","https://openalex.org/W2127467256","https://openalex.org/W2128909617","https://openalex.org/W2159570675","https://openalex.org/W2159754498","https://openalex.org/W2162888549","https://openalex.org/W2167728712","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W3141471645","https://openalex.org/W1987169484","https://openalex.org/W119451361","https://openalex.org/W4390679009","https://openalex.org/W4386703090","https://openalex.org/W7014380639","https://openalex.org/W4322731450","https://openalex.org/W3088301722","https://openalex.org/W638840421","https://openalex.org/W2593217673"],"abstract_inverted_index":{"The":[0],"knapsack":[1,45,86,96,109,170,194,225],"problem":[2,46,110,129,147,195,296],"manifests":[3],"itself":[4],"in":[5,21,130,165,179,184,213,244,282],"many":[6,117],"domains":[7,168],"like":[8,261],"cryptography,":[9],"financial":[10],"domain":[11],"and":[12,24,41,62,82,120,240],"bio-informatics.":[13],"Knapsack":[14],"problems":[15,171],"are":[16,101],"often":[17],"inside":[18,199],"optimization":[19,202],"loops":[20],"system-level":[22,176,289],"design":[23,177],"analysis":[25],"of":[26,34,54,66,75,84,163,210,246,279,297],"embedded":[27,181],"systems":[28,182],"as":[29],"well.":[30],"Given":[31],"a":[32,39,42,52,153,193,200,218,286],"set":[33],"items,":[35],"each":[36],"associated":[37],"with":[38,48],"profit":[40,59],"weight,":[43],"the":[44,58,63,67,73,76,94,99,107,128,137,146,180,206,223,233,238,247,258,263,277,295],"deals":[47],"how":[49],"to":[50,113,126,144,159,221,231,255],"choose":[51],"subset":[53],"items":[55,69,100],"such":[56,132,192,211],"that":[57],"is":[60,70,111,149],"maximized":[61],"total":[64],"weight":[65],"chosen":[68],"less":[71],"than":[72],"capacity":[74],"knapsack.":[77],"There":[78],"exists":[79],"several":[80],"variants":[81],"extensions":[83],"this":[85,89,214],"problem.":[87,226],"In":[88],"thesis,":[90,215],"we":[91,216,274,293],"focus":[92],"on":[93,237,271],"multiple-choice":[95,108,224],"problem,":[97],"where":[98,169],"grouped":[102],"into":[103],"disjoint":[104],"classes.":[105],"However,":[106],"known":[112],"be":[114,173,197],"NP-hard.":[115],"While":[116],"different":[118,229],"heuristics":[119],"approximation":[121],"schemes":[122],"have":[123],"been":[124],"proposed":[125],"solve":[127,145,222],"polynomial-time,":[131],"techniques":[133],"do":[134],"not":[135],"return":[136],"optimal":[138],"solution.":[139],"A":[140],"dynamic":[141,234],"programming":[142,235],"algorithm":[143,236],"optimally":[148],"known,":[150],"but":[151],"has":[152],"pseudo-polynomial":[154],"running":[155,161,190,208,248,259],"time.":[156],"This":[157],"leads":[158],"high":[160,189,207],"times":[162,209,260],"tools":[164,178],"various":[166],"application":[167],"must":[172,196],"solved.":[174],"Many":[175],"domain,":[183],"particular,":[185],"would":[186],"suffer":[187],"from":[188,269,288],"when":[191],"solved":[198],"larger":[201],"loop.":[203],"To":[204],"mitigate":[205],"algorithms,":[212],"propose":[217],"GPU-based":[219],"technique":[220,281],"We":[227,250],"study":[228],"approaches":[230],"map":[232],"GPU":[239,252,264],"compare":[241],"their":[242],"performance":[243],"terms":[245],"times.":[249],"employ":[251],"specific":[253],"methods":[254],"further":[256],"improve":[257],"exploiting":[262],"on-chip":[265],"shared":[266],"memory.":[267],"Apart":[268],"results":[270],"synthetic":[272],"test-cases,":[273],"also":[275],"demonstrate":[276],"applicability":[278],"our":[280],"practice":[283],"by":[284],"considering":[285],"case-study":[287],"design.":[290],"Towards":[291],"this,":[292],"consider":[294],"instruction-set":[298],"selection":[299],"for":[300],"customizable":[301],"processors.":[302]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W780986551","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
