Batched disk scheduling with delays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Exploring the performance impact of stripe size on network attached storage systems
Journal of Systems Architecture: the EUROMICRO Journal
CA-NFS: a congestion-aware network file system
FAST '09 Proccedings of the 7th conference on File and storage technologies
CA-NFS: A congestion-aware network file system
ACM Transactions on Storage (TOS)
What is the future of disk drives, death or rebirth?
ACM Computing Surveys (CSUR)
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
Analysis of the GSTF disk scheduling algorithm
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Most computer systems today are lightly loaded in normal operation. The real performance problems occur during burst times when the system becomes overloaded. We evaluate how the choice of scheduling algorithms can assist a system in maintaining stable performance while operating under transient overloads. We propose a new disk scheduling algorithm that efficiently handles overload by dynamically adjusting its parameters. The algorithm adapts its operation to the current load conditions and achieves good overall performance, while maintaining minimal variability in the request response time. We evaluate the robustness of the algorithm against different disks and synthetic and realistic traces measured in benchmarked systems.