Efficient Management of System Idleness

AbstractVarious activities that intend to enhance performance, reliability, and availability of systems are scheduled withlow priority and served during system idle times. Under such conditions, idleness becomes a valuable “resource”that needs to be efficiently managed. A common approach in sys tem design is to be non-work-conserving by “idlewaiting”, i.e., delay scheduling of background jobs to avoid slowing down upcoming foreground tasks.In this paper, we complement “idle-waiting” with the “estimation” of background work to be served in every idleinterval to manage the trade-off between the performance offoreground and background tasks. As a result, the overallsystem is better utilized without compromising foreground performance. Our analysis shows that if idle times havelow variability, then it is not necessary to idle wait before starting a background job. Only if idle times are highlyvariable, then idle waiting is necessary to minimize the impact of background activity on foreground performance.We further show that if there is burstiness in addition to high variability in idle intervals, then it is possible to predictaccurately the length of incoming idle times and use that information to serve more background jobs without affectingforeground performance.

[1]  Spencer W. Ng,et al.  Disk scrubbing in large archival storage systems , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[2]  Alan Scheller-Wolf,et al.  Analysis of cycle stealing with switching times and thresholds , 2005, Perform. Evaluation.

[3]  Philip S. Yu,et al.  An Analytical Model of Reconstruction Time in Mirrored Disks , 1994, Perform. Evaluation.

[4]  Attahiru Sule Alfa,et al.  A vacation model for the non-saturated Readers and Writers system with a threshold policy , 2002, Perform. Evaluation.

[5]  Dirk Grunwald,et al.  Massive Arrays of Idle Disks For Storage Archives , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[6]  Arun Venkataramani,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tcp Nice: a Mechanism for Background Transfers , 2022 .

[7]  Zhisheng Niu,et al.  A vacation queue with setup and close-down times and batch Markovian arrival processes , 2003, Perform. Evaluation.

[8]  Andrea C. Arpaci-Dusseau,et al.  Association Proceedings of the Third USENIX Conference on File and Storage Technologies San Francisco , CA , USA March 31 – April 2 , 2004 , 2004 .

[9]  Kang G. Shin,et al.  FS2: dynamic data replication in free disk space for improving disk performance and energy consumption , 2005, SOSP '05.

[10]  M. Dahlin,et al.  TCP Nice: a mechanism for background transfers , 2002, OSDI '02.

[11]  William J. Bolosky,et al.  Progress-based regulation of low-importance processes , 1999, SOSP.

[12]  Joseph D. Touch,et al.  Idletime scheduling with preemption intervals , 2005, SOSP '05.

[13]  Alma Riska,et al.  Disk Drive Level Workload Characterization , 2006, USENIX Annual Technical Conference, General Track.

[14]  Darrell D. E. Long,et al.  Adaptive disk spin‐down for mobile computers , 2000, Mob. Networks Appl..

[15]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[16]  Michael K. Reiter,et al.  Lazy verification in fault-tolerant distributed storage systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[17]  Gregory R. Ganger,et al.  A Framework for Building Unobtrusive Disk Maintenance Applications (CMU-CS-03-192) , 2004 .

[18]  Shankar Pasupathy,et al.  An analysis of latent sector errors in disk drives , 2007, SIGMETRICS '07.

[19]  Alexander Thomasian,et al.  Performance Evaluation of a Threshold Policy for Scheduling Readers and Writers , 1993, IEEE Trans. Computers.

[20]  John C. S. Lui,et al.  Performance Analysis of Disk Arrays under Failure , 1990, VLDB.

[21]  Fred Douglis,et al.  Adaptive Disk Spin-Down Policies for Mobile Computers , 1995, Comput. Syst..

[22]  D E LongDarrell,et al.  Adaptive disk spindown for mobile computers , 2000 .

[23]  Daniel Zappala,et al.  Cluster Computing on the Fly : P 2 P Scheduling of Idle Cycles in the Internet , 2004 .

[24]  Keith A. Lantz,et al.  Preemptable remote execution facilities for the V-system , 1985, SOSP 1985.

[25]  Carl Staelin,et al.  Idleness is Not Sloth , 1995, USENIX.

[26]  Eitan Bachmat,et al.  Analysis of methods for scheduling low priority disk drive tasks , 2002, SIGMETRICS '02.