{"id":"https://openalex.org/W2020088537","doi":"https://doi.org/10.1145/1921659.1921669","title":"Competitive analysis of flash memory algorithms","display_name":"Competitive analysis of flash memory algorithms","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2020088537","doi":"https://doi.org/10.1145/1921659.1921669","mag":"2020088537"},"language":"en","primary_location":{"id":"doi:10.1145/1921659.1921669","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921669","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/A5081761718","display_name":"Avraham Ben-Aroya","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Avraham Ben-Aroya","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056808449","display_name":"Sivan Toledo","orcid":"https://orcid.org/0000-0002-9524-7115"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sivan Toledo","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":3.2199,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.91897019,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":"2","first_page":"1","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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.9958000183105469,"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/T10237","display_name":"Cryptography and Data Security","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8111252784729004},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7124209403991699},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6980718374252319},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5812510848045349},{"id":"https://openalex.org/keywords/flash-memory","display_name":"Flash memory","score":0.5807312726974487},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4980792999267578},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.48194456100463867},{"id":"https://openalex.org/keywords/flash","display_name":"Flash (photography)","score":0.47958865761756897},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.45848414301872253},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.18135225772857666},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12260371446609497},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.11019667983055115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1098601222038269}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8111252784729004},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7124209403991699},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6980718374252319},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5812510848045349},{"id":"https://openalex.org/C2776531357","wikidata":"https://www.wikidata.org/wiki/Q174077","display_name":"Flash memory","level":2,"score":0.5807312726974487},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4980792999267578},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.48194456100463867},{"id":"https://openalex.org/C2777526259","wikidata":"https://www.wikidata.org/wiki/Q221836","display_name":"Flash (photography)","level":2,"score":0.47958865761756897},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.45848414301872253},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.18135225772857666},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12260371446609497},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.11019667983055115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1098601222038269},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1921659.1921669","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921669","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1486613786","https://openalex.org/W1486947867","https://openalex.org/W1493976610","https://openalex.org/W1495548585","https://openalex.org/W1512513277","https://openalex.org/W1524315965","https://openalex.org/W1526462389","https://openalex.org/W1555172178","https://openalex.org/W1571386461","https://openalex.org/W1581199517","https://openalex.org/W1587463421","https://openalex.org/W1608042692","https://openalex.org/W1858483563","https://openalex.org/W2024363956","https://openalex.org/W2099753358","https://openalex.org/W2115009671","https://openalex.org/W2117702591","https://openalex.org/W2137905605","https://openalex.org/W2151745115","https://openalex.org/W2158963043","https://openalex.org/W2316600135","https://openalex.org/W2405130583","https://openalex.org/W4251787433","https://openalex.org/W6823311174"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"Flash":[0],"memories":[1],"are":[2],"widely":[3],"used":[4,133],"in":[5,96,170,175],"computer":[6],"systems":[7,11,92],"ranging":[8],"from":[9],"embedded":[10],"to":[12,16,82,99,107],"workstations":[13],"and":[14,19,40,55,106,174,207],"servers":[15],"digital":[17],"cameras":[18],"mobile":[20],"phones.":[21],"The":[22],"memory":[23],"cells":[24,43,88],"of":[25,34,61,70,75,86,104,111,164,186],"flash":[26],"devices":[27],"can":[28,51,79,214],"only":[29],"endure":[30],"a":[31,158,187,203],"limited":[32],"number":[33,103],"write":[35],"cycles,":[36],"usually":[37],"between":[38],"10,000":[39],"1,000,000.":[41],"Furthermore,":[42],"containing":[44],"data":[45,77,94,117],"must":[46],"be":[47,80],"erased":[48],"before":[49,84],"they":[50,139],"store":[52],"new":[53],"data,":[54],"erasure":[56],"operations":[57],"erase":[58,114],"large":[59],"blocks":[60],"memory,":[62],"not":[63],"individual":[64],"cells.":[65],"To":[66],"maximize":[67],"the":[68,71,101,109,112,125,150,171,176],"endurance":[69],"device":[72],"(the":[73],"amount":[74],"useful":[76],"that":[78,157,193,209,220],"written":[81],"it":[83,213],"one":[85,163],"its":[87],"wears":[89],"out),":[90],"flash-based":[91],"move":[93],"around":[95],"an":[97,120,184],"attempt":[98],"reduce":[100],"total":[102],"erasures":[105],"level":[108],"wear":[110],"different":[113],"blocks.":[115],"This":[116],"movement":[118],"introduces":[119],"interesting":[121],"online":[122,221],"problem":[123,127,206],"called":[124],"wear-leveling":[126,153],".":[128],"Wear-leveling":[129],"algorithms":[130,195,211,222],"have":[131,140],"been":[132,142],"at":[134],"least":[135],"since":[136],"1993,":[137],"but":[138,219],"never":[141],"mathematically":[143],"analyzed.":[144],"In":[145],"this":[146],"article":[147],"we":[148],"analyze":[149,202],"two":[151],"main":[152],"problems.":[154],"We":[155,191,200],"show":[156,192,208],"simple":[159],"randomized":[160],"algorithm":[161],"for":[162,212],"them":[165],"is":[166],"essentially":[167,223],"optimal":[168],"both":[169],"competitive":[172,180],"sense":[173,178],"absolute":[177],"(our":[179],"result":[181],"relies":[182],"on":[183],"analysis":[185],"nearly-optimal":[188],"offline":[189,210],"algorithm).":[190],"deterministic":[194],"cannot":[196],"achieve":[197],"comparable":[198],"endurance.":[199],"also":[201],"more":[204],"difficult":[205],"improve":[215],"upon":[216],"naive":[217],"approaches,":[218],"cannot.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}