A competitive analysis for the Start-Gap algorithm for online memory wear leveling
•This paper presents a novel competitive analysis of the Start-Gap wear-leveling algorithm.•Under reasonable assumptions, w.h.p., Start-Gap can serve (1−o(1))NL write requests before writing to a location more than L times.•The analysis implies a competitive ratio of 1/(1−o(1)) for Start-Gap. Erase-...
Saved in:
| Published in | Information processing letters Vol. 166; p. 106042 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.02.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0020-0190 1872-6119 |
| DOI | 10.1016/j.ipl.2020.106042 |
Cover
| Abstract | •This paper presents a novel competitive analysis of the Start-Gap wear-leveling algorithm.•Under reasonable assumptions, w.h.p., Start-Gap can serve (1−o(1))NL write requests before writing to a location more than L times.•The analysis implies a competitive ratio of 1/(1−o(1)) for Start-Gap.
Erase-limited memory, such as flash memory and phase change memory (PCM), has limitations on the number of times that any memory cell can be erased. The Start-Gap algorithm has shown a significant ability in practice to distribute updates across the cells of an erase-limited memory, but it has heretofore not been characterized in terms of its competitive ratio against an optimal offline algorithm that is given all the update addresses in advance. In this paper, we present a competitive analysis for the Start-Gap wear-leveling algorithm, showing that under reasonable assumptions about the sequence of update operations, the Start-Gap algorithm has a competitive ratio of 1/(1−o(1)). |
|---|---|
| AbstractList | •This paper presents a novel competitive analysis of the Start-Gap wear-leveling algorithm.•Under reasonable assumptions, w.h.p., Start-Gap can serve (1−o(1))NL write requests before writing to a location more than L times.•The analysis implies a competitive ratio of 1/(1−o(1)) for Start-Gap.
Erase-limited memory, such as flash memory and phase change memory (PCM), has limitations on the number of times that any memory cell can be erased. The Start-Gap algorithm has shown a significant ability in practice to distribute updates across the cells of an erase-limited memory, but it has heretofore not been characterized in terms of its competitive ratio against an optimal offline algorithm that is given all the update addresses in advance. In this paper, we present a competitive analysis for the Start-Gap wear-leveling algorithm, showing that under reasonable assumptions about the sequence of update operations, the Start-Gap algorithm has a competitive ratio of 1/(1−o(1)). |
| ArticleNumber | 106042 |
| Author | Devanny, William E. Goodrich, Michael T. Irani, Sandy |
| Author_xml | – sequence: 1 givenname: William E. surname: Devanny fullname: Devanny, William E. email: devanny.2@osu.edu organization: Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43210-1210 USA – sequence: 2 givenname: Michael T. surname: Goodrich fullname: Goodrich, Michael T. email: goodrich@ics.uci.edu organization: Department of Computer Science, University of California, Irvine, CA 92697 USA – sequence: 3 givenname: Sandy surname: Irani fullname: Irani, Sandy email: irani@ics.uci.edu organization: Department of Computer Science, University of California, Irvine, CA 92697 USA |
| BookMark | eNp9kMtqwzAQRUVJoUnaD-hOP-BUY8uSTVchtGkhUOhjLWRlnCjYlpFEiv--TtNVF1kNdy5nYM6MTDrXISH3wBbAQDwcFrZvFilLT1kwnl6RKRQyTQRAOSFTNjYJg5LdkFkIB8aY4JmckvclNa7tMdpoj0h1p5sh2EBr52ncI_2I2sdkrXuqm53zNu7b3851je2Qttg6P9Bv1J42eMRxubsl17VuAt79zTn5en76XL0km7f162q5SUxaypgITEXNgVdQybxIM16i4CDqPM_ktoQCMDdgaigLPsZMQ10VRhRVITOQzPBsTuT5rvEuBI-1MjbqaF0XvbaNAqZOatRBjWrUSY06qxlJ-Ef23rbaDxeZxzOD40tHi14FY7EzuLUeTVRbZy_QP_ojfY0 |
| CitedBy_id | crossref_primary_10_1016_j_micpro_2021_104266 crossref_primary_10_1016_j_memori_2022_100014 |
| Cites_doi | 10.1145/3857.3862 10.1109/5.622505 10.1007/BF02835833 10.1109/TC.2009.134 10.1007/s10107-003-0436-0 10.1109/L-CA.2010.2 10.1109/JPROC.2003.811702 10.1109/JPROC.2010.2070050 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ipl.2020.106042 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-6119 |
| ExternalDocumentID | 10_1016_j_ipl_2020_106042 S0020019020301290 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-6e26f414b1b7582349e6416f5537d9181e5c1cf1984d913a1fb8c68b873170c43 |
| IEDL.DBID | .~1 |
| ISSN | 0020-0190 |
| IngestDate | Wed Oct 01 05:15:52 EDT 2025 Thu Apr 24 23:10:01 EDT 2025 Fri Feb 23 02:47:01 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Analysis of algorithms Data structures On-line algorithms |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-6e26f414b1b7582349e6416f5537d9181e5c1cf1984d913a1fb8c68b873170c43 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ipl_2020_106042 crossref_primary_10_1016_j_ipl_2020_106042 elsevier_sciencedirect_doi_10_1016_j_ipl_2020_106042 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | February 2021 2021-02-00 |
| PublicationDateYYYYMMDD | 2021-02-01 |
| PublicationDate_xml | – month: 02 year: 2021 text: February 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Information processing letters |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Bez, Camerlenghi, Modelli, Visconti (br0010) 2003; 91 Seznec (br0160) 2010; 9 Bercu, Delyon, Rio (br0150) 2015 Qureshi, Karidis, Franceschini, Srinivasan, Lastras, Abali (br0070) 2009 Pavan, Bez, Olivo, Zanoni (br0020) 1997; 85 Chang (br0050) 2007 Chang, Hsieh, Kuo (br0060) 2010; 59 Albers (br0100) 2003; 97 Irani, Naor, Rubinfeld (br0120) 1992; 25 Wong, Raoux, Kim, Liang, Reifenberg, Rajendran, Asheghi, Goodson (br0030) 2010; 98 Wu, Zwaenepoel (br0040) 1994 Vitter (br0130) 1985; 10 Chen, Gibbons, Nath (br0080) 2011 Ben-Aroya, Toledo (br0110) 2006; vol. 4168 Eppstein, Goodrich, Mitzenmacher, Pszona (br0090) 2014; vol. 8504 Barcelo, Zhou, Cole, Nugent, Pruhs (br0140) 2012; vol. 7659 Vitter (10.1016/j.ipl.2020.106042_br0130) 1985; 10 Bez (10.1016/j.ipl.2020.106042_br0010) 2003; 91 Chang (10.1016/j.ipl.2020.106042_br0050) 2007 Albers (10.1016/j.ipl.2020.106042_br0100) 2003; 97 Eppstein (10.1016/j.ipl.2020.106042_br0090) 2014; vol. 8504 Pavan (10.1016/j.ipl.2020.106042_br0020) 1997; 85 Wu (10.1016/j.ipl.2020.106042_br0040) 1994 Chang (10.1016/j.ipl.2020.106042_br0060) 2010; 59 Bercu (10.1016/j.ipl.2020.106042_br0150) 2015 Qureshi (10.1016/j.ipl.2020.106042_br0070) 2009 Irani (10.1016/j.ipl.2020.106042_br0120) 1992; 25 Barcelo (10.1016/j.ipl.2020.106042_br0140) 2012; vol. 7659 Seznec (10.1016/j.ipl.2020.106042_br0160) 2010; 9 Chen (10.1016/j.ipl.2020.106042_br0080) 2011 Wong (10.1016/j.ipl.2020.106042_br0030) 2010; 98 Ben-Aroya (10.1016/j.ipl.2020.106042_br0110) 2006; vol. 4168 |
| References_xml | – volume: 98 start-page: 2201 year: 2010 end-page: 2227 ident: br0030 article-title: Phase change memory publication-title: Proc. IEEE – volume: 59 start-page: 53 year: 2010 end-page: 65 ident: br0060 article-title: Improving flash wear-leveling by proactively moving static data publication-title: IEEE Trans. Comput. – volume: vol. 8504 start-page: 162 year: 2014 end-page: 173 ident: br0090 article-title: Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket publication-title: 13th Int. Symp. on Experimental Algorithms (SEA) – volume: 25 start-page: 141 year: 1992 end-page: 159 ident: br0120 article-title: On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? publication-title: Math. Syst. Theory – year: 2015 ident: br0150 article-title: Concentration Inequalities for Sums and Martingales – volume: 85 start-page: 1248 year: 1997 end-page: 1271 ident: br0020 article-title: Flash memory cells—an overview publication-title: Proc. IEEE – volume: 9 start-page: 5 year: 2010 end-page: 8 ident: br0160 article-title: A phase change memory as a secure main memory publication-title: Comput. Archit. Lett. – volume: 97 start-page: 3 year: 2003 end-page: 26 ident: br0100 article-title: Online algorithms: a survey publication-title: Math. Program. – start-page: 1126 year: 2007 end-page: 1130 ident: br0050 article-title: On efficient wear leveling for large-scale flash-memory storage systems publication-title: ACM Symp. on Applied Computing (SAC) – volume: 91 start-page: 489 year: 2003 end-page: 502 ident: br0010 article-title: Introduction to flash memory publication-title: Proc. IEEE – start-page: 14 year: 2009 end-page: 23 ident: br0070 article-title: Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling publication-title: 42nd IEEE/ACM Int. Symp. on Microarchitecture (MICRO) – volume: 10 start-page: 129 year: 1985 end-page: 162 ident: br0130 article-title: An efficient I/O interface for optical disks publication-title: ACM Trans. Database Syst. – volume: vol. 4168 start-page: 100 year: 2006 end-page: 111 ident: br0110 article-title: Competitive analysis of flash-memory algorithms publication-title: European Symp. on Algorithms (ESA) – start-page: 21 year: 2011 end-page: 31 ident: br0080 article-title: Rethinking database algorithms for phase change memory publication-title: 5th Conf. on Innovative Data Systems Research (CIDR) – volume: vol. 7659 start-page: 67 year: 2012 end-page: 81 ident: br0140 article-title: Energy efficient caching for phase-change memory publication-title: 1st Mediterranean Conf. on Algorithms (MedAlg) – start-page: 86 year: 1994 end-page: 97 ident: br0040 article-title: eNVy: a non-volatile, main memory storage system publication-title: 6th Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS) – volume: 10 start-page: 129 issue: 2 year: 1985 ident: 10.1016/j.ipl.2020.106042_br0130 article-title: An efficient I/O interface for optical disks publication-title: ACM Trans. Database Syst. doi: 10.1145/3857.3862 – volume: 85 start-page: 1248 issue: 8 year: 1997 ident: 10.1016/j.ipl.2020.106042_br0020 article-title: Flash memory cells—an overview publication-title: Proc. IEEE doi: 10.1109/5.622505 – volume: vol. 7659 start-page: 67 year: 2012 ident: 10.1016/j.ipl.2020.106042_br0140 article-title: Energy efficient caching for phase-change memory – start-page: 1126 year: 2007 ident: 10.1016/j.ipl.2020.106042_br0050 article-title: On efficient wear leveling for large-scale flash-memory storage systems – volume: vol. 8504 start-page: 162 year: 2014 ident: 10.1016/j.ipl.2020.106042_br0090 article-title: Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket – volume: 25 start-page: 141 issue: 2 year: 1992 ident: 10.1016/j.ipl.2020.106042_br0120 article-title: On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? publication-title: Math. Syst. Theory doi: 10.1007/BF02835833 – start-page: 86 year: 1994 ident: 10.1016/j.ipl.2020.106042_br0040 article-title: eNVy: a non-volatile, main memory storage system – volume: 59 start-page: 53 issue: 1 year: 2010 ident: 10.1016/j.ipl.2020.106042_br0060 article-title: Improving flash wear-leveling by proactively moving static data publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2009.134 – volume: 97 start-page: 3 issue: 1 year: 2003 ident: 10.1016/j.ipl.2020.106042_br0100 article-title: Online algorithms: a survey publication-title: Math. Program. doi: 10.1007/s10107-003-0436-0 – volume: vol. 4168 start-page: 100 year: 2006 ident: 10.1016/j.ipl.2020.106042_br0110 article-title: Competitive analysis of flash-memory algorithms – start-page: 21 year: 2011 ident: 10.1016/j.ipl.2020.106042_br0080 article-title: Rethinking database algorithms for phase change memory – volume: 9 start-page: 5 issue: 1 year: 2010 ident: 10.1016/j.ipl.2020.106042_br0160 article-title: A phase change memory as a secure main memory publication-title: Comput. Archit. Lett. doi: 10.1109/L-CA.2010.2 – volume: 91 start-page: 489 issue: 4 year: 2003 ident: 10.1016/j.ipl.2020.106042_br0010 article-title: Introduction to flash memory publication-title: Proc. IEEE doi: 10.1109/JPROC.2003.811702 – volume: 98 start-page: 2201 issue: 12 year: 2010 ident: 10.1016/j.ipl.2020.106042_br0030 article-title: Phase change memory publication-title: Proc. IEEE doi: 10.1109/JPROC.2010.2070050 – start-page: 14 year: 2009 ident: 10.1016/j.ipl.2020.106042_br0070 article-title: Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling – year: 2015 ident: 10.1016/j.ipl.2020.106042_br0150 |
| SSID | ssj0006437 |
| Score | 2.2892091 |
| Snippet | •This paper presents a novel competitive analysis of the Start-Gap wear-leveling algorithm.•Under reasonable assumptions, w.h.p., Start-Gap can serve... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106042 |
| SubjectTerms | Analysis of algorithms Data structures On-line algorithms |
| Title | A competitive analysis for the Start-Gap algorithm for online memory wear leveling |
| URI | https://dx.doi.org/10.1016/j.ipl.2020.106042 |
| Volume | 166 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Freedom Collection customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: ACRLP dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection Journals customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIKHN dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6119 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AKRWK dateStart: 19930125 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KvXjxLT7LHjwJsdnNZpM9lmKtij2Ihd5CdptopY9QIuLF3-7MZlMV1IO3bJKF8DGZ-dj5ZoaQs0AbycD3epgi8yDiSU-NjYErboSJQnd0cTeQ_aG4GYWjBunWtTAoq3S-v_Lp1lu7O22HZruYTLDGF_VAClNp9jQFK9hFhFMMLt4_ZR6YmKpkHijAUqvMptV4TQrMPnBcS1_wn2PTl3jT2yIbjijSTvUt26SRzXfIZj2Egbp_cpfcd6ix3NeKgGjqmoxQIKMUyB0FNrksvau0oOn0cbGclE8z-6xqkUFnqLR9o69g8HSKAiIIZXtk2Lt86PY9NyjBM1xFpSczLnPBhGYa6D8PhMokEK08DINorCCGZ6FhJmcqFrAMUpbr2MhYxxGwB9-IYJ8054t5dkAo8jcpjdKcZcKkqQpj4Bi5NrnPtIrGh8SvIUqM6yKOwyymSS0Xe04A1QRRTSpUD8n5aktRtdD462VR4558s4MEXPzv247-t-2YrHPUqFgV9glplsuX7BRIRqlb1opaZK1zfdsffABFi85y |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZKGWDhjShPD0xIgdhxnHisKkqBtgNqpW5W7CYQ1EdUBSEWfjvnxCkgAQNbHOek6NPl7ovv8xmhc09pTiD2OqZE5kDG444Yaw1XVDMd-HbpotfnnSG7G_mjGmpVe2GMrNLG_jKmF9Ha3rmyaF5laWr2-Bo9kDCltGI1ZQWtMp8G5g_s8v1T52EqU6XOwyiwxLK0WYi80syUH6gZc5fRn5PTl4TT3kIbliniZvky26gWz3bQZnUKA7Yf5S56aGJdkN9CBYQj22UEAxvFwO4w0MlF7txEGY4mj_NFmj9Ni7myRwaeGqntG34Fj8cToyCCXLaHhu3rQavj2JMSHE1FkDs8pjxhhCmigP9Tj4mYA9NKfN8LxgKSeOxrohMiQgZDLyKJCjUPVRgAfXA18_ZRfTafxQcIGwLHuRaKkpjpKBJ-CCQjUTpxiRLBuIHcCiKpbRtxc5rFRFZ6sWcJqEqDqixRbaCLpUlW9tD462FW4S6_OYKEGP-72eH_zM7QWmfQ68rubf_-CK1TI1gpJNnHqJ4vXuITYBy5Oi086gM-pdAH |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+competitive+analysis+for+the+Start-Gap+algorithm+for+online+memory+wear+leveling&rft.jtitle=Information+processing+letters&rft.au=Devanny%2C+William+E.&rft.au=Goodrich%2C+Michael+T.&rft.au=Irani%2C+Sandy&rft.date=2021-02-01&rft.issn=0020-0190&rft.volume=166&rft.spage=106042&rft_id=info:doi/10.1016%2Fj.ipl.2020.106042&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2020_106042 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |