Paper Info
Title
Fair Write Attribution and Allocation for Consolidated Flash Cache
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.
Year
DOI
Venue
2020
10.1145/3373376.3378502
ASPLOS '20: Architectural Support for Programming Languages and Operating Systems Lausanne Switzerland March, 2020
Keywords
DocType
ISBN
flash lifetime,fair allocation,Shapley value
Conference
978-1-4503-7102-5
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Wonil Choi1364.98
Bhuvan Urgaonkar22309158.10
Mahmut T. Kandemir37371568.54
Myoungsoo Jung474.51
David Evans500.34