Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Performance Analysis of Parallel Processing Systems
IEEE Transactions on Software Engineering
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
The design and evaluation of RAID 5 and parity striping disk array architectures
Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
A Performance Evaluation of RAID Architectures
IEEE Transactions on Computers
An analytic behavior model for disk drives with readahead caches and request reordering
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Mean value technique for closed fork-join networks
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Capturing the spatio-temporal behavior of real traffic data
Performance Evaluation
Response Time Analysis of Parallel Computer and Storage Systems
IEEE Transactions on Parallel and Distributed Systems
The Mathematica Book
Performance modeling and analysis of disk arrays
Performance modeling and analysis of disk arrays
Issues and Challenges in the Performance Analysis of Real Disk Arrays
IEEE Transactions on Parallel and Distributed Systems
Queueing models of RAID systems with maxima of waiting times
Performance Evaluation
Disk drive level workload characterization
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Hi-index | 0.00 |
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.