{"id":"https://openalex.org/W2896898580","doi":"https://doi.org/10.1145/3290366","title":"Efficient parameterized algorithms for data packing","display_name":"Efficient parameterized algorithms for data packing","publication_year":2019,"publication_date":"2019-01-02","ids":{"openalex":"https://openalex.org/W2896898580","doi":"https://doi.org/10.1145/3290366","mag":"2896898580"},"language":"en","primary_location":{"id":"doi:10.1145/3290366","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290366","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290366","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3290366","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005241421","display_name":"Amir Kafshdar Goharshady","orcid":"https://orcid.org/0000-0003-1702-6584"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Amir Kafshdar Goharshady","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077488458","display_name":"Nastaran Okati","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Nastaran Okati","raw_affiliation_strings":["Ferdowsi University of Mashhad, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1209,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.87976888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"3","issue":"POPL","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7618651390075684},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7434098720550537},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5674619674682617},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5637030601501465},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5207740664482117},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.49982428550720215},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.47980430722236633},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38030102849006653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3734560012817383},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3313741087913513}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7618651390075684},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7434098720550537},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5674619674682617},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5637030601501465},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5207740664482117},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.49982428550720215},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.47980430722236633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38030102849006653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3734560012817383},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3313741087913513},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3290366","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290366","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290366","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-107148","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85062301191&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-107148","is_oa":false,"landing_page_url":"http://repository.ust.hk/ir/Record/1783.1-107148","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/3290366","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290366","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290366","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2554063606","display_name":"Efficient Algorithms for Computer Aided Verification","funder_award_id":"ICT15-003","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G2655136877","display_name":null,"funder_award_id":"S11407","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G4360933436","display_name":null,"funder_award_id":"Project ICT15-003","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G6496967758","display_name":null,"funder_award_id":"279307","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G683671635","display_name":null,"funder_award_id":"S11407-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2896898580.pdf","grobid_xml":"https://content.openalex.org/works/W2896898580.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W854382448","https://openalex.org/W1537449969","https://openalex.org/W1581776712","https://openalex.org/W1818617877","https://openalex.org/W1975229999","https://openalex.org/W1983096721","https://openalex.org/W1989556004","https://openalex.org/W2002722727","https://openalex.org/W2024023641","https://openalex.org/W2028914463","https://openalex.org/W2029448190","https://openalex.org/W2041645394","https://openalex.org/W2059372025","https://openalex.org/W2074131210","https://openalex.org/W2087083200","https://openalex.org/W2117197583","https://openalex.org/W2141170493","https://openalex.org/W2143406303","https://openalex.org/W2152505265","https://openalex.org/W2153691881","https://openalex.org/W2163724134","https://openalex.org/W2240262109","https://openalex.org/W2293041988","https://openalex.org/W2295173494","https://openalex.org/W2757822510","https://openalex.org/W2880875791","https://openalex.org/W2896898580","https://openalex.org/W2914414140","https://openalex.org/W2962968573","https://openalex.org/W3030461153","https://openalex.org/W3125984961","https://openalex.org/W3197565351","https://openalex.org/W4234611484","https://openalex.org/W4292169167","https://openalex.org/W6604792996"],"related_works":["https://openalex.org/W2546991807","https://openalex.org/W2274935188","https://openalex.org/W2538519144","https://openalex.org/W2037904580","https://openalex.org/W2730690135","https://openalex.org/W2147511796","https://openalex.org/W2147122795","https://openalex.org/W4312770956","https://openalex.org/W2167303720","https://openalex.org/W57688818"],"abstract_inverted_index":{"There":[0],"is":[1,86,103,107,111,121,215,242,268],"a":[2,20,70,75,216,227,230,243,269,298,303,334],"huge":[3],"gap":[4],"between":[5,184],"the":[6,50,58,63,84,89,96,115,152,169,172,175,185,189,197,200,205,209,224,249,256,276,284,307,319],"speeds":[7],"of":[8,23,66,79,98,174,182,191,199,211,226,259,287,324,333,337,348],"modern":[9],"caches":[10],"and":[11,14,120,143,163,317,364],"main":[12,59,233],"memories,":[13],"therefore":[15],"cache":[16,52,92,99,116,127,250],"misses":[17,100],"account":[18],"for":[19,125,136,157,272],"considerable":[21],"loss":[22],"efficiency":[24],"in":[25,219,344],"programs.":[26],"The":[27,105],"predominant":[28],"technique":[29],"to":[30,57,81,87,123,196,222,229,370],"address":[31],"this":[32,148,325],"issue":[33],"has":[34,117,263,292],"been":[35],"Data":[36,67,137,158,273,277],"Packing:":[37],"data":[38,82,186],"elements":[39,90],"that":[40,95,240,253,313,366],"are":[41,47,139,180,235],"frequently":[42],"accessed":[43],"within":[44],"time":[45],"proximity":[46],"packed":[48],"into":[49,91],"same":[51],"block,":[53],"thereby":[54],"minimizing":[55],"accesses":[56,80],"memory.":[60],"We":[61,167,203,355],"consider":[62,168],"algorithmic":[64],"problem":[65,106,170,206,279],"Packing":[68,138,278],"on":[69,101,141,248,302],"two-level":[71],"memory":[72],"system.":[73],"Given":[74],"reference":[76],"sequence":[77],"R":[78,102],"elements,":[83,187],"task":[85],"partition":[88],"blocks":[93],"such":[94,252],"number":[97,244],"minimized.":[104],"notoriously":[108],"difficult:":[109],"it":[110],"NP-hard":[112,281],"even":[113,282],"when":[114],"size":[118,128,198],"1,":[119],"hard":[122],"approximate":[124],"any":[126],"larger":[129],"than":[130],"4.":[131],"Therefore,":[132],"all":[133],"existing":[134],"techniques":[135],"based":[140],"heuristics":[142],"lack":[144],"theoretical":[145,155],"guarantees.":[146],"In":[147],"work,":[149],"we":[150,238,296,328],"present":[151,329],"first":[153],"positive":[154],"results":[156,234,341],"Packing,":[159],"along":[160],"with":[161,359],"new":[162],"stronger":[164],"negative":[165],"results.":[166],"under":[171],"lens":[173],"underlying":[176],"access":[177,193,212,257,285,311,346],"hypergraphs,":[178,213],"which":[179,214],"hypergraphs":[181,347],"affinities":[183],"where":[188],"order":[190,260,288,309],"an":[192,330],"hypergraph":[194,258,286],"corresponds":[195],"affinity":[201],"group.":[202],"study":[204],"parameterized":[207],"by":[208],"treewidth":[210],"standard":[217],"notion":[218],"graph":[220,228],"theory":[221],"measure":[223],"closeness":[225],"tree.":[231],"Our":[232,340],"as":[236],"follows:":[237],"show":[239,365],"there":[241,267],"q":[245,261,289,322],"*":[246,262,290,323],"depending":[247,301],"parameters":[251],"(a)":[254],"if":[255,283],"constant":[264,293,315],"treewidth,":[265],"then":[266],"linear-time":[270],"algorithm":[271,368],"Packing;":[274],"(b)":[275],"remains":[280],"\u22121":[291],"treewidth.":[294,354],"Thus,":[295],"establish":[297,318],"fine-grained":[299],"dichotomy":[300],"single":[304],"parameter,":[305],"namely,":[306],"highest":[308],"among":[310],"hypegraphs":[312],"have":[314,352],"treewidth;":[316],"optimal":[320],"value":[321],"parameter.":[326],"Finally,":[327],"experimental":[331],"evaluation":[332],"prototype":[335],"implementation":[336],"our":[338,357,367],"algorithm.":[339],"demonstrate":[342],"that,":[343],"practice,":[345],"many":[349],"commonly-used":[350],"algorithms":[351,363],"small":[353],"compare":[356],"approach":[358],"several":[360],"state-of-the-art":[361],"heuristic-based":[362],"leads":[369],"significantly":[371],"fewer":[372],"cache-misses.":[373]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}