ACM Transactions on Computer Systems (TOCS)
An operating systems vade mecum
An operating systems vade mecum
Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A system for adaptive disk rearrangement
Software—Practice & Experience
The design and implementation of a log-structured file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM Transactions on Computer Systems (TOCS)
UNIX internals: the new frontiers
UNIX internals: the new frontiers
Adaptive block rearrangement under UNIX
Software—Practice & Experience
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
On being optimistic about real-time constraints
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Solaris internals: core kernel architecture
Solaris internals: core kernel architecture
A unifying approach to scheduling
Communications of the ACM
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Modern Operating Systems
Flexible and Adaptable Buffer Management Techniques for Database Management Systems
IEEE Transactions on Computers
Read Optimized File System Designs: A Performance Evaluation
Proceedings of the Seventh International Conference on Data Engineering
A Low-Cost Storage Server for Movie on Demand Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Disk Scheduling with Quality of Service Guarantees
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Radio-wave propagation prediction using ray-tracing techniques on a network of workstations (NOW)
Journal of Parallel and Distributed Computing
Understanding The Linux Kernel
Understanding The Linux Kernel
QoS-oriented negotiation in disk subsystems
Data & Knowledge Engineering
Pattern Recognition, Third Edition
Pattern Recognition, Third Edition
Hi-index | 0.00 |
Anticipatory scheduling (AS) of I/O requests has become a viable choice for block-device schedulers in open-source OS-kernels as prior work has established its superiority over traditional disk-scheduling policies. An AS-scheduler selectively stalls the block-device right after servicing a request in hope that a new request for a nearby sector will be soon posted. Clearly, this decision may introduce delays if the anticipated I/O does not arrive on time. In this paper, we build on the success of the AS and propose an approach that minimizes the overhead of unsuccessful anticipations. Our suggested approach termed workload-dependent anticipation scheduling (WAS), determines the length of every anticipation period in an on-line fashion in order to reduce penalties by taking into account the evolving spatio-temporal characteristics of running processes as well as properties of the underlying computing system. We harvest the spatio-temporal features of individual processes and employ a system-wide process classification scheme that is re-calibrated on the fly. The resulting classification enables the disk scheduler to make informed decisions and vary the anticipation interval accordingly, on a per-process basis. We have implemented and incorporated WAS into the current Linux kernel. Through experimentation with a wide range of diverse workloads, we demonstrate WAS benefits and establish reduction of penalties over other AS-scheduler implementations.