Berkeley Lab Scientific Computing Seminar

Date:

Friday, September 1, 2006

Time:

1:00pm-2:00pm

Location:

Building 54-130 (Perseverance Hall)

Seminar Speaker:

Seetharami Seelam
The University of Texas at El Paso
http://utminers.utep.edu/seelam/

Title:

Virtual I/O Scheduler: Towards Dynamic Adaptation of I/O Scheduling

Abstract:

Disk scheduling algorithms in operating systems often are designed to satisfy a primary data delivery requirement. In addition, these algorithms fail to provide performance isolation among concurrently executing disk-bound applications. Multiple concurrent and conflicting requirements need to be satisfied to support concurrently executing applications while providing fairness in sharing the disk resources.
We have designed a new disk scheduling strategy that leverages a fair queuing discipline and implements a fair scheduling algorithm that can facilitate satisfying different data delivery requirements of concurrently executing applications by allowing each application to have its own scheduling algorithm. Because this strategy is fair in terms of allocated disk time, it provides performance isolation among applications and, therefore, predictable disk performance for each application, which facilitates providing quality of service guarantees.

In this talk we describe the impact of different resource-sharing metrics of conventional fair scheduling on fairness, performance isolation, and application disk performance predictability. We present the fairness properties and analytical and experimental evaluations of various fair scheduling algorithms, including our own algorithm, which is superior to the rest.

Sponsor of Seminar:

David Skinner

Scientific Computing

Contact Esmond G. Ng EGNg@lbl.gov