An analytical model of reconstruction time in mirrored disks
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Progress-based regulation of low-importance processes
Proceedings of the seventeenth ACM symposium on Operating systems principles
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
Adaptive disk spin—down for mobile computers
Mobile Networks and Applications
Analysis of methods for scheduling low priority disk drive tasks
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Evaluation of a Threshold Policy for Scheduling Readers and Writers
IEEE Transactions on Computers
A vacation model for the non-saturated readers and writers system with a threshold policy
Performance Evaluation
Performance Analysis of Disk Arrays under Failure
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Adaptive Disk Spin-down Policies for Mobile Computers
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Massive arrays of idle disks for storage archives
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A vacation queue with setup and close-down times and batch Markovian arrival processes
Performance Evaluation
Disk Scrubbing in Large Archival Storage Systems
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
TCP Nice: a mechanism for background transfers
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Idletime scheduling with preemption intervals
Proceedings of the twentieth ACM symposium on Operating systems principles
Proceedings of the twentieth ACM symposium on Operating systems principles
Awarded Best Student Paper! -- Improving Storage System Availability with D-GRAID
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Awarded Best Student Paper! -- A Framework for Building Unobtrusive Disk Maintenance Applications
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Lazy Verification in Fault-Tolerant Distributed Storage Systems
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Analysis of cycle stealing with switching times and thresholds
Performance Evaluation
An analysis of latent sector errors in disk drives
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Disk drive level workload characterization
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Cluster computing on the fly: P2P scheduling of idle cycles in the internet
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Restrained utilization of idleness for transparent scheduling of background tasks
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
Busy bee: how to use traffic information for better scheduling of background tasks
ICPE '12 Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering
Taking garbage collection overheads off the critical path in SSDs
Proceedings of the 13th International Middleware Conference
Fuzzy adaptive control for heterogeneous tasks in high-performance storage systems
Proceedings of the 6th International Systems and Storage Conference
Active flash: towards energy-efficient, in-situ data analytics on extreme-scale machines
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
Various activities that intend to enhance performance, reliability, and availability of storage systems are scheduled with low priority and served during idle times. Under such conditions, idleness becomes a valuable “resource” that needs to be efficiently managed. A common approach in system design is to be nonwork conserving by “idle waiting”, that is, delay the scheduling of background jobs to avoid slowing down upcoming foreground tasks. In this article, we complement “idle waiting” with the “estimation” of background work to be served in every idle interval to effectively manage the trade-off between the performance of foreground and background tasks. As a result, the storage system is better utilized without compromising foreground performance. Our analysis shows that if idle times have low variability, then idle waiting is not necessary. Only if idle times are highly variable does idle waiting become necessary to minimize the impact of background activity on foreground performance. We further show that if there is burstiness in idle intervals, then it is possible to predict accurately the length of incoming idle intervals and use this information to serve more background jobs without affecting foreground performance.