A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads
In heterogeneous I/O workload environments, disk scheduling algorithms should support different QoS (Quality-of-Service) for each I/O request. For example, the algorithm should meet the deadlines of real-time requests and at the same time provide reasonable response time for best-effort requests. Th...
Saved in:
Main Authors: | Taeseok Kim, Hyokyung Bahn, Youjip Won |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/940850 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Electricity Usage Scheduling in Smart Building Environments Using Smart Devices
by: Eunji Lee, et al.
Published: (2013-01-01) -
Sensor and Dynamic Pricing Aware Vertical Transportation in Smart Buildings
by: Hyunkyoung Choi, et al.
Published: (2019-01-01) -
An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree
by: Wei Zhang, et al.
Published: (2013-12-01) -
Crapemyrtle Pruning
by: Gary W. Knox, et al.
Published: (2024-12-01) -
Pruning Palms
by: Timothy K. Broschat
Published: (2011-06-01)