About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
4th International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Using bulk arrivals to model I/O request response time distributions in zoned disks and RAID systems

Download833 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2009.7787,
        author={A.S.  Lebrecht and N.J.  Dingle and P.G.  Harrison and W.J.  Knottenbelt and S.  Zertal},
        title={Using bulk arrivals to model I/O request response time distributions in zoned disks and RAID systems},
        proceedings={4th International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2010},
        month={5},
        keywords={queueing theory storage systems},
        doi={10.4108/ICST.VALUETOOLS2009.7787}
    }
    
  • A.S. Lebrecht
    N.J. Dingle
    P.G. Harrison
    W.J. Knottenbelt
    S. Zertal
    Year: 2010
    Using bulk arrivals to model I/O request response time distributions in zoned disks and RAID systems
    VALUETOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2009.7787
A.S. Lebrecht1,*, N.J. Dingle1,*, P.G. Harrison1,*, W.J. Knottenbelt1,*, S. Zertal1,*
  • 1: Department of Computing, Imperial College London, 180 Queen’s Gate, London SW7 2BZ, United Kingdom
*Contact email: asl102@doc.ic.ac.uk, njd200@doc.ic.ac.uk, pgh@doc.ic.ac.uk, wjk@doc.ic.ac.uk, szertal@doc.ic.ac.uk

Abstract

Useful analytical models of storage system performance must support the characteristics exhibited by real I/O workloads. Two essential features are the ability to cater for bursty arrival streams and to support a given distribution of I/O request size. This paper develops and applies the theory of bulk arrivals in queueing networks to support these phenomena in models of I/O request response time in zoned disks and RAID systems, with a specific focus on RAID levels 01 and 5. We represent a single disk as an Mx /G/1 queue, and a RAID system as a fork-join queueing network of Mx /G/1 queues. We find the response time distribution for a randomly placed request within a random bulk arrival. We also use the fact that the response time of a random request with size sampled from some distribution will be the same as that of an entire batch whose size has the same distribution. In both cases, we validate our models against measurements from a zoned disk drive and a RAID platform.

Keywords
queueing theory storage systems
Published
2010-05-16
Publisher
ICST
http://dx.doi.org/10.4108/ICST.VALUETOOLS2009.7787
Copyright © 2009–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL