Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Synchronized Disk Interleaving
IEEE Transactions on Computers
An Evaluation of Multiple-Disk I/O Systems
IEEE Transactions on Computers
Database machines: an idea whose time has passed? A critique of the future of database machines
Parallel architectures for database systems
Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Surveyors' forum—high-performance secondary memory
ACM Computing Surveys (CSUR)
A Performance Evaluation of RAID Architectures
IEEE Transactions on Computers
Striping in disk array RM2 enabling the tolerance of double disk failures
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Design and Performance Analysis of a Disk Array System
IEEE Transactions on Computers
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Performance evaluation of memory systems
Journal of Computing Sciences in Colleges
Issues and Challenges in the Performance Analysis of Real Disk Arrays
IEEE Transactions on Parallel and Distributed Systems
I/O performance of an RAID-10 style parallel file system
Journal of Computer Science and Technology
Pesto: online storage performance management in virtualized datacenters
Proceedings of the 2nd ACM Symposium on Cloud Computing
Allocation strategies of multimedia data on disk arrays
Computer Communications
A New File-Specific Stripe Size Selection Method for Highly Concurrent Data Access
GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
| Hi-index | 14.99 |
The performance implications of asynchronous disk interleaving are examined. In an asynchronous system, adjacent subblocks are placed independently of each other. Since each of the disks in such a system is treated independently while being accessed as a group, the access delay of a request for a data block in an n-disk system is the maximum of n access delays. Using approximate analysis, a simple expression for the expected value of such a maximum delay is obtained. The analysis approximation is verified by simulation using trace data; the relative error is found to be at most 6%.