Modelling Zoned RAID Systems Using Fork-Join Queueing Simulation

  • Abigail S. Lebrecht
  • Nicholas J. Dingle
  • William J. Knottenbelt
Conference paper

DOI: 10.1007/978-3-642-02924-0_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5652)
Cite this paper as:
Lebrecht A.S., Dingle N.J., Knottenbelt W.J. (2009) Modelling Zoned RAID Systems Using Fork-Join Queueing Simulation. In: Bradley J.T. (eds) Computer Performance Engineering. EPEW 2009. Lecture Notes in Computer Science, vol 5652. Springer, Berlin, Heidelberg

Abstract

RAID systems are ubiquitously deployed in storage environments, both as standalone storage solutions and as fundamental components of virtualised storage platforms. Accurate models of their performance are crucial to delivering storage infrastructures that meet given quality of service requirements. To this end, this paper presents a flexible fork-join queueing simulation model of RAID systems that are comprised of zoned disk drives and which operate under RAID levels 01 or 5. The simulator takes as input I/O workloads that are heterogeneous in terms of request size and that exhibit burstiness, and its primary output metric is I/O request response time distribution. We also study the effects of heavy workload, taking into account the request-reordering optimisations employed by modern disk drives. All simulation results are validated against device measurements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Abigail S. Lebrecht
    • 1
  • Nicholas J. Dingle
    • 1
  • William J. Knottenbelt
    • 1
  1. 1.Department of ComputingImperial College LondonUnited Kingdom

Personalised recommendations