A continuum of disk scheduling algorithms
ACM Transactions on Computer Systems (TOCS)
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Floating parity and data disk arrays
Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Parity logging overcoming the small write problem in redundant disk arrays
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
The architecture of a fault-tolerant cached RAID controller
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Trace driven analysis of write caching policies for disks
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance of RAID5 disk arrays with read and write caching
Distributed and Parallel Databases - Special issue on disk arrays
DCD—disk caching disk: a new approach for boosting I/O performance
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
File server scaling with network-attached secure disks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Destage Algorithms for Disk Arrays with Nonvolatile Caches
IEEE Transactions on Computers
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems
IEEE Transactions on Parallel and Distributed Systems
A New Hierarchical Disk Architecture
IEEE Micro
My Cache or Yours? Making Storage More Exclusive
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
STICS: SCSI-to-IP cache for storage area networks
Journal of Parallel and Distributed Computing
Improving application launch times with hybrid disks
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Hi-index | 0.00 |
In a disk array with a nonvolatile write cache, destages from the cache to the disk are performed in the background asynchronously while read requests from the host system are serviced in the foreground. In this paper, we study a number of algorithms for scheduling destages in a RAID-5 system. We introduce a new scheduling algorithm, called linear threshold scheduling, that adaptively varies the rate of destages to disks based on the instantaneous occupancy of the write cache. The performance of the algorithm is compared with that of a number of alternative scheduling approaches such as least-cost scheduling and high/low mark. The algorithms are evaluated in terms of their effectiveness in making destages transparent to the servicing of read requests from the host, disk utilization, and their ability to tolerate bursts in the workload without causing an overflow of the write cache. Our results show that linear threshold scheduling provides the best read performance of all the algorithms compared, while still maintaining a high degree of burst tolerance. An approximate implementation of the linear-threshold scheduling algorithm is also described. The approximate algorithm can be implemented with much lower overhead, yet its performance is virtually identical to that of the ideal algorithm.