{"id":"https://openalex.org/W2295173494","doi":"https://doi.org/10.1145/2837614.2837669","title":"The hardness of data packing","display_name":"The hardness of data packing","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2295173494","doi":"https://doi.org/10.1145/2837614.2837669","mag":"2295173494"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837669","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837669","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837669","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837669","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050680776","display_name":"Rahman Lavaee","orcid":null},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rahman Lavaee","raw_affiliation_strings":["University of Rochester, USA"],"affiliations":[{"raw_affiliation_string":"University of Rochester, USA","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050680776"],"corresponding_institution_ids":["https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":2.5598,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88485345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/cache","display_name":"Cache","score":0.8821579813957214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7484288215637207},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7076837420463562},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6465591788291931},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.606377124786377},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.5734208822250366},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5520539283752441},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5316033363342285},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.5257191061973572},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5153069496154785},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.5078416466712952},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.49420812726020813},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4569530785083771},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.42487892508506775},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4247792065143585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32317084074020386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16385099291801453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15459713339805603},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10364562273025513},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07305234670639038}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8821579813957214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7484288215637207},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7076837420463562},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6465591788291931},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.606377124786377},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.5734208822250366},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5520539283752441},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5316033363342285},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.5257191061973572},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5153069496154785},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.5078416466712952},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.49420812726020813},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4569530785083771},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.42487892508506775},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4247792065143585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32317084074020386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16385099291801453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15459713339805603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10364562273025513},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07305234670639038}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2837614.2837669","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837669","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837669","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2837614.2837669","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2837614.2837669","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2837614.2837669","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G148243712","display_name":null,"funder_award_id":"CNS-1319617,CCF-1116104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2582672188","display_name":null,"funder_award_id":"CCF-1116104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4223688490","display_name":"CSR: Small: Safe Parallelization in a Dynamic Language","funder_award_id":"1319617","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8105208638","display_name":"SHF: Small: Footprint Models and Techniques for Multi-core Cache Management","funder_award_id":"1116104","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8871618492","display_name":null,"funder_award_id":"CNS-1319617","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322183","display_name":"Huawei Technologies","ror":"https://ror.org/00cmhce21"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2295173494.pdf","grobid_xml":"https://content.openalex.org/works/W2295173494.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1581776712","https://openalex.org/W1600193896","https://openalex.org/W1734799737","https://openalex.org/W1966923282","https://openalex.org/W1968797199","https://openalex.org/W1975229999","https://openalex.org/W1982455793","https://openalex.org/W1984005572","https://openalex.org/W1991707635","https://openalex.org/W2004976090","https://openalex.org/W2011601876","https://openalex.org/W2011717090","https://openalex.org/W2024023641","https://openalex.org/W2043260929","https://openalex.org/W2045501273","https://openalex.org/W2067471095","https://openalex.org/W2072802070","https://openalex.org/W2079816878","https://openalex.org/W2087673011","https://openalex.org/W2101462267","https://openalex.org/W2108117840","https://openalex.org/W2113513143","https://openalex.org/W2115049345","https://openalex.org/W2116672403","https://openalex.org/W2120358419","https://openalex.org/W2122466336","https://openalex.org/W2126915506","https://openalex.org/W2129027842","https://openalex.org/W2131574356","https://openalex.org/W2131926352","https://openalex.org/W2135056392","https://openalex.org/W2139165932","https://openalex.org/W2141170493","https://openalex.org/W2151224887","https://openalex.org/W2153691881","https://openalex.org/W2166034429","https://openalex.org/W2171134934","https://openalex.org/W2999097477","https://openalex.org/W4233785673","https://openalex.org/W4248045917","https://openalex.org/W4250784990"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2734782074","https://openalex.org/W2546991807","https://openalex.org/W2538519144","https://openalex.org/W2121191383","https://openalex.org/W1505654810","https://openalex.org/W2076114130","https://openalex.org/W2535115842","https://openalex.org/W2436169747","https://openalex.org/W1584415117"],"abstract_inverted_index":{"A":[0],"program":[1],"can":[2,22,73],"benefit":[3],"from":[4],"improved":[5],"cache":[6,52,64,88,117],"block":[7,27],"utilization":[8],"when":[9],"contemporaneously":[10],"accessed":[11],"data":[12,43,59],"elements":[13],"are":[14],"placed":[15],"in":[16,50,62,104],"the":[17,24,33,40,51,70,81,87,105,108,116],"same":[18],"memory":[19,26],"block.":[20],"This":[21],"reduce":[23,32],"program's":[25],"working":[28],"set":[29],"and":[30,53,66],"thereby,":[31],"capacity":[34],"miss":[35,118],"rate.":[36],"We":[37],"formally":[38],"define":[39],"problem":[41,91,120],"of":[42,48,58,102],"packing":[44,54],"for":[45,76,98],"arbitrary":[46],"number":[47,57,101],"blocks":[49,103],"factor":[55],"(the":[56],"objects":[60],"fitting":[61],"a":[63,95],"block)":[65],"study":[67],"how":[68],"well":[69],"optimal":[71],"solution":[72],"be":[74,122],"approximated":[75],"two":[77],"dual":[78],"problems.":[79],"On":[80,107],"one":[82],"hand,":[83,110],"we":[84,111],"show":[85,112],"that":[86,113],"hit":[89],"maximization":[90],"is":[92],"approximable":[93],"within":[94],"constant":[96],"factor,":[97],"every":[99],"fixed":[100],"cache.":[106],"other":[109],"unless":[114],"P=NP,":[115],"minimization":[119],"cannot":[121],"efficiently":[123],"approximated.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}