A continuum of disk scheduling algorithms
ACM Transactions on Computer Systems (TOCS)
Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Improving Disk Performance Via Latency Reduction
IEEE Transactions on Computers
Analysis of file I/O traces in commercial computing environments
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
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
Architectures and algorithms for on-line failure recovery in redundant disk arrays
Distributed and Parallel Databases - Special issue on disk arrays
ACM Transactions on Computer Systems (TOCS)
Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems
Journal of the ACM (JACM)
Queueing Analysis of the Scan Policy for Moving-Head Disks
Journal of the ACM (JACM)
Disk scheduling: FCFS vs.SSTF revisited
Communications of the ACM
A comparative analysis of disk scheduling policies
Communications of the ACM
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
RAID5 Performance with Distributed Sparing
IEEE Transactions on Parallel and Distributed Systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Rules of Thumb in Data Engineering
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Towards higher disk head utilization: extracting free bandwidth from busy disk drives
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
A disk head scheduling simulator
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Optimization of online disk scheduling algorithms
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Moneta: A High-Performance Storage Array Architecture for Next-Generation, Non-volatile Memories
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
Hi-index | 0.01 |
Advances in magnetic recording technology have resulted in a rapid increase in disk capacities, but improvements in the mechanical characteristics of disks have been quite modest. For example the access time to random disk blocks has decreased by a mere factor of two, while disk capacities have increased by several orders of magnitude. High performance OLTP applications subject disks to a very demanding workload, since they require high access rates to randomly distributed disk blocks and gain limited benef£t from caching and prefetching. We address this problem by re-evaluating the performance of some well known disk scheduling methods, before proposing and evaluating extensions to them. A variation to CSCAN takes into account rotational latency, so that the service time of further requests is reduced. A variation to SATF considers the sum of service times of several successive requests in scheduling the next request, so that the arm is moved to a (temporal) neighborhood with many requests. The service time of further requests is discounted, since their immediate processing is not guaranteed. A variation to the SATF policy prioritizes reads with respect to writes and processes winner write requests conditionally, i.e., when the ratio of their service time to that of the winner read request is smaller than a certain threshold. We review previous work to put our work into the proper perspective and discuss plans for future work.