{"id":"https://openalex.org/W2616949295","doi":"https://doi.org/10.1145/3070693","title":"Cost-Oblivious Storage Reallocation","display_name":"Cost-Oblivious Storage Reallocation","publication_year":2017,"publication_date":"2017-05-26","ids":{"openalex":"https://openalex.org/W2616949295","doi":"https://doi.org/10.1145/3070693","mag":"2616949295"},"language":"en","primary_location":{"id":"doi:10.1145/3070693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070693","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5068761590","display_name":"Michael A. Bender","orcid":"https://orcid.org/0000-0001-7639-530X"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":["Stony Brook University, NY, USA"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087023890","display_name":"Mart\u0131\u0301n Farach-Colton","orcid":"https://orcid.org/0000-0003-3616-7788"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mart\u00edn Farach-Colton","raw_affiliation_strings":["Rutgers University, NY, USA"],"affiliations":[{"raw_affiliation_string":"Rutgers University, NY, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["TU Braunschweig, Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042520814","display_name":"Seth Gilbert","orcid":"https://orcid.org/0000-0003-3298-7412"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Seth Gilbert","raw_affiliation_strings":["National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5068761590"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":0.6216,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71099313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9984999895095825,"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/subadditivity","display_name":"Subadditivity","score":0.806890070438385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5999979376792908},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5469238758087158},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5421922206878662},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5330290794372559},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.520234227180481},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5092223882675171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4943513870239258},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.47924235463142395},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4421789348125458},{"id":"https://openalex.org/keywords/footprint","display_name":"Footprint","score":0.44027960300445557},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.42423146963119507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25430911779403687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23958435654640198},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10971471667289734},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10734620690345764}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.806890070438385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5999979376792908},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5469238758087158},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5421922206878662},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5330290794372559},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.520234227180481},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5092223882675171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4943513870239258},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.47924235463142395},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4421789348125458},{"id":"https://openalex.org/C132943942","wikidata":"https://www.wikidata.org/wiki/Q2562511","display_name":"Footprint","level":2,"score":0.44027960300445557},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.42423146963119507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25430911779403687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23958435654640198},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10971471667289734},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10734620690345764},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3070693","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070693","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4909931985","display_name":null,"funder_award_id":"IIS 1247726, CCF 1217708, CCF 1114809, CCF 0937822, CCF 1617618, IIS 1247750, CCF 1114930 and CCF 1218188","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/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W109241435","https://openalex.org/W1488422606","https://openalex.org/W1499921103","https://openalex.org/W1501698934","https://openalex.org/W1528796068","https://openalex.org/W1535312934","https://openalex.org/W1648194979","https://openalex.org/W1768637848","https://openalex.org/W1968828745","https://openalex.org/W1975216035","https://openalex.org/W1975294145","https://openalex.org/W1978905553","https://openalex.org/W1980313943","https://openalex.org/W1996027765","https://openalex.org/W1996578733","https://openalex.org/W2000746586","https://openalex.org/W2001326908","https://openalex.org/W2011717090","https://openalex.org/W2018816426","https://openalex.org/W2028778377","https://openalex.org/W2031770154","https://openalex.org/W2035105893","https://openalex.org/W2035384491","https://openalex.org/W2036871832","https://openalex.org/W2041623815","https://openalex.org/W2041645394","https://openalex.org/W2043636453","https://openalex.org/W2055119378","https://openalex.org/W2069574596","https://openalex.org/W2073193966","https://openalex.org/W2081835288","https://openalex.org/W2084969027","https://openalex.org/W2088181319","https://openalex.org/W2094678784","https://openalex.org/W2095572269","https://openalex.org/W2095875205","https://openalex.org/W2100389625","https://openalex.org/W2102467006","https://openalex.org/W2114123132","https://openalex.org/W2127527141","https://openalex.org/W2161965494","https://openalex.org/W2168023916","https://openalex.org/W2169657806","https://openalex.org/W2170929650","https://openalex.org/W2188942574","https://openalex.org/W2253769547","https://openalex.org/W2264483270","https://openalex.org/W2444572248","https://openalex.org/W2468341367","https://openalex.org/W2506023989","https://openalex.org/W2569217518","https://openalex.org/W2752853835","https://openalex.org/W2949184829","https://openalex.org/W2949378954","https://openalex.org/W2952609303","https://openalex.org/W4231320478","https://openalex.org/W4234825413","https://openalex.org/W4235499171"],"related_works":["https://openalex.org/W2942373159","https://openalex.org/W4288374528","https://openalex.org/W4245471134","https://openalex.org/W2966385870","https://openalex.org/W4283790219","https://openalex.org/W2065913202","https://openalex.org/W2944528978","https://openalex.org/W3109766892","https://openalex.org/W2049627958","https://openalex.org/W2094220892"],"abstract_inverted_index":{"Databases":[0],"allocate":[1],"and":[2,58,69,155],"free":[3],"blocks":[4,10,37,89],"of":[5,67,73,176,198],"storage":[6,83,116,141,146],"on":[7,32],"disk.":[8,33],"Freed":[9],"introduce":[11],"holes":[12],"where":[13,86],"no":[14,196],"data":[15],"is":[16,43,102,112,148,159,171,180,209],"stored.":[17],"Allocation":[18],"systems":[19],"attempt":[20],"to":[21,28,76,113],"reuse":[22],"such":[23],"deallocated":[24],"regions":[25],"in":[26,64,70,143],"order":[27],"minimize":[29,114],"the":[30,45,65,71,74,82,105,115,120,131,145,156,164,199,206],"footprint":[31,147],"When":[34],"previously":[35,87],"allocated":[36,88,126],"cannot":[38],"be":[39,91],"moved,":[40,92],"this":[41,53],"problem":[42,54],"called":[44],"memory":[46,122],"allocation":[47,166],"problem.":[48],"The":[49,110,183],"competitive":[50],"ratio":[51,72],"for":[52,140],"has":[55],"matching":[56],"upper":[57],"lower":[59],"bounds":[60,194],"that":[61,118,168],"are":[62,185],"logarithmic":[63],"number":[66],"requests":[68],"largest":[75,121],"smallest":[77],"requests.":[78],"This":[79,100,134],"article":[80,135],"defines":[81],"reallocation":[84,132,157],"problem,":[85],"can":[90],"or":[93],"reallocated":[94],",":[95,188],"but":[96],"at":[97,149],"some":[98],"cost.":[99],"cost":[101,107,158,186,201,207],"determined":[103],"by":[104],"allocation/reallocation":[106,200],"function":[108,208],".":[109],"objective":[111],"footprint,":[117],"is,":[119,169],"address":[123],"containing":[124],"an":[125],"object,":[127],"while":[128],"simultaneously":[129],"minimizing":[130],"costs.":[133],"gives":[136],"asymptotically":[137],"optimal":[138,177],"algorithms":[139,184],"reallocation,":[142],"which":[144,189],"most":[150],"(1+":[151],"\u03f5)":[152],"times":[153,163],"optimal,":[154],"O":[160],"((1/\u03f5)log":[161],"(1/\u03f5))":[162],"original":[165],"cost,":[167],"it":[170],"within":[172],"a":[173,181],"constant":[174],"factor":[175],"when":[178],"\u03f5":[179],"constant.":[182],"oblivious":[187],"means":[190],"they":[191],"achieve":[192],"these":[193],"with":[195],"knowledge":[197],"function,":[202],"as":[203,205],"long":[204],"subadditive.":[210]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
