{"id":"https://openalex.org/W2117615535","doi":"https://doi.org/10.1109/ipdps.2004.1303328","title":"Solving a 2D knapsack problem using a hybrid data-parallel/control style of computing","display_name":"Solving a 2D knapsack problem using a hybrid data-parallel/control style of computing","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2117615535","doi":"https://doi.org/10.1109/ipdps.2004.1303328","mag":"2117615535"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063251239","display_name":"Darrell R. Ulm","orcid":"https://orcid.org/0000-0002-0513-0416"},"institutions":[{"id":"https://openalex.org/I110152177","display_name":"University of Akron","ror":"https://ror.org/02kyckx55","country_code":"US","type":"education","lineage":["https://openalex.org/I110152177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D.R. Ulm","raw_affiliation_strings":["Department of Computer Science, University of Akron, Akron, OH, USA","Dept. of Comp. Sci., Akron Univ., OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Akron, Akron, OH, USA","institution_ids":["https://openalex.org/I110152177"]},{"raw_affiliation_string":"Dept. of Comp. Sci., Akron Univ., OH, USA","institution_ids":["https://openalex.org/I110152177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109064797","display_name":"J.W. Baker","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.W. Baker","raw_affiliation_strings":["Department of Computer Science, Kent University, Kent, OH, USA","Kent State Univ"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Kent State Univ","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091850155","display_name":"Michael Scherger","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.C. Scherger","raw_affiliation_strings":["Department of Computer Science, Kent University, Kent, OH, USA","Kent State Univ"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Kent State Univ","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063251239"],"corresponding_institution_ids":["https://openalex.org/I110152177"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20512994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":null,"first_page":"260","last_page":"266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9020047187805176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7574307918548584},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7443163394927979},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.5933497548103333},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5324108600616455},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5313730239868164},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4961634576320648},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4396926164627075},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.41579392552375793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32626035809516907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21757236123085022},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13895192742347717}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9020047187805176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7574307918548584},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7443163394927979},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.5933497548103333},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5324108600616455},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5313730239868164},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4961634576320648},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4396926164627075},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.41579392552375793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32626035809516907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21757236123085022},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13895192742347717},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2004.1303328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.7951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~parallel/papers/ulm_wmpp04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W86267832","https://openalex.org/W155278659","https://openalex.org/W1605552448","https://openalex.org/W1967810725","https://openalex.org/W2013021539","https://openalex.org/W2060525068","https://openalex.org/W2135601680","https://openalex.org/W2148404167","https://openalex.org/W2153774705","https://openalex.org/W6606323618"],"related_works":["https://openalex.org/W1966986652","https://openalex.org/W2142105839","https://openalex.org/W1563501581","https://openalex.org/W2766828645","https://openalex.org/W4389887952","https://openalex.org/W4391505986","https://openalex.org/W2367132302","https://openalex.org/W338671845","https://openalex.org/W2168700313","https://openalex.org/W2156346058"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2,46],"given.":[3],"This":[4,106],"paper":[5],"describes":[6],"a":[7,18,38,73,76,97,151,165,170],"parallel":[8,94,152,227],"solution":[9],"of":[10,31,33,40,68,75,100,104,130,133,137,172,194],"the":[11,28,62,66,82,203,221],"sequential":[12,205],"dynamic":[13],"programming":[14],"method":[15],"for":[16,61,164,212],"solving":[17],"NP":[19,147],"class,":[20],"2D":[21,166],"knapsack":[22,39,167],"(or":[23],"cutting-stock)":[24],"problem":[25,60,149,168,215],"which":[26,123],"is":[27],"optimal":[29,199],"packing":[30],"multiples":[32],"n":[34],"rectangular":[35],"objects":[36],"into":[37],"size":[41],"L/spl":[42,173],"times/W":[43],"and":[44,57,81,114,135,183],"are":[45,124,197],"obtainable":[47],"with":[48,150,169,200],"guillotine-type":[49],"(side":[50],"to":[51,126,139,202,219,225],"side)":[52],"cuts.":[53],"Here,":[54],"we":[55],"describe":[56],"analyze":[58],"this":[59,146,213],"associative":[63,69,79,92,102,222],"model.":[64],"Since":[65],"introduction":[67],"SIMD":[70],"computers":[71],"over":[72],"quarter":[74],"century":[77],"ago,":[78],"computing":[80],"data-parallel":[83],"paradigm":[84],"remain":[85],"popular.":[86],"The":[87,175],"MASC":[88,210],"(multiple":[89],"instruction":[90,120],"stream":[91],"computer)":[93],"model":[95,107,223],"supports":[96,108],"generalized":[98],"version":[99,179],"an":[101,127,208],"style":[103],"computing.":[105],"data":[109],"parallelism,":[110],"constant":[111],"time":[112,158],"maximum":[113],"minimum":[115],"operations,":[116],"one":[117],"or":[118],"more":[119],"streams":[121],"(ISs)":[122],"sent":[125],"equal":[128],"number":[129],"partition":[131],"sets":[132],"processors,":[134,161],"assignment":[136],"tasks":[138],"ISs":[140,185],"using":[141,159,180],"control":[142],"parallelism.":[143],"We":[144],"solve":[145],"class":[148],"algorithm":[153,211],"that":[154],"runs":[155,186],"in":[156,187],"O(W(n+L+W))":[157],"L":[160],"where":[162],"L>W":[163],"capacity":[171],"times/W.":[174],"new":[176],"multiple":[177],"IS":[178],"LW":[181],"processors":[182],"max{L,M}":[184],"O(n+L+W)":[188],"given":[189],"practical":[190],"hardware":[191],"considerations.":[192],"Both":[193],"these":[195],"results":[196],"cost":[198],"respect":[201],"best":[204],"implementation.":[206],"Moreover,":[207],"efficient":[209],"well-known":[214],"should":[216],"give":[217],"insight":[218],"how":[220],"compares":[224],"other":[226],"models":[228],"such":[229],"as":[230],"PRAM.":[231]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}