Fair write attribution and allocation for consolidated flash cache

Wonil Choi, Bhuvan Urgaonkar, Mahmut Kandemir, Myoungsoo Jung, David Evans

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Consolidating multiple workloads on a single flash-based storage device is now a common practice. We identify a new problem related to lifetime management in such settings: how should one partition device resources among consolidated workloads such that their allowed contributions to the device's wear (resulting from their writes including hidden writes due to garbage collection) may be deemed fairly assigned? When flash is used as a cache/buffer, such fairness is important because it impacts what and how much traffic from various workloads may be serviced using flash which in turn affects their performance. We first clarify why the write attribution problem (i.e., which workload contributed how many writes) is non-trivial. We then present a technique for it inspired by the Shapley value, a classical concept from cooperative game theory, and demonstrate that it is accurate, fair, and feasible. We next consider how to treat an overall “write budget” (i.e., total allowable writes during a given time period) for the device as a first-class resource worthy of explicit management. Towards this, we propose a novel write budget allocation technique. Finally, we construct a dynamic lifetime management framework for consolidated devices by putting the above elements together. Our experiments using real-world workloads demonstrate that our write allocation and attribution techniques lead to performance fairness across consolidated workloads.

Original languageEnglish
Title of host publicationASPLOS 2020 - 25th International Conference on Architectural Support for Programming Languages and Operating Systems
PublisherAssociation for Computing Machinery
Pages1063-1076
Number of pages14
ISBN (Electronic)9781450371025
DOIs
Publication statusPublished - 2020 Mar 9
Event25th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2020 - Lausanne, Switzerland
Duration: 2020 Mar 162020 Mar 20

Publication series

NameInternational Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Conference

Conference25th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2020
CountrySwitzerland
CityLausanne
Period20/3/1620/3/20

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Fair write attribution and allocation for consolidated flash cache'. Together they form a unique fingerprint.

  • Cite this

    Choi, W., Urgaonkar, B., Kandemir, M., Jung, M., & Evans, D. (2020). Fair write attribution and allocation for consolidated flash cache. In ASPLOS 2020 - 25th International Conference on Architectural Support for Programming Languages and Operating Systems (pp. 1063-1076). (International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS). Association for Computing Machinery. https://doi.org/10.1145/3373376.3378502