In this paper, we present Paragone, an algorithm that helps designers fundamentally rethink how I/O traces should be modeled and replayed.
Designers of storage and file systems use I/O traces to emulate application workloads while designing new algorithms and for testing bug fixes. However, since traces are large, they are hard to store and moreover inflexible to manipulate. Thus, researchers have proposed techniques to create trace models in order to alleviate these concerns. However, the prior trace modeling approaches are limited with respect to 1) number of trace parameters they can model, and hence, the accuracy of the model and 2) with respect to manipulating the trace model in both temporal and spatial domains (that is, changing the burstiness of a workload, or scaling the size of the data supporting the workload). In this paper we present a new algorithm/tool called Paragone that addresses the above mentioned problems by fundamentally re-thinking how traces should be modeled and replayed.
In Proceedings of the IEEE Symposium on Massive Storage Systems and Technologies 2013 (MSST ’13).
- The author's version of this paper is attached to this posting. Please observe the following copyright:
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
- The definitive version of the paper can be found at: http://storageconference.org/2013/Papers/2013.Paper.17.pdf.
- Paragone.pdf (230.6 K)