FAIRIO: An Algorithm for Differentiated I/O Performance

• Sarala Arunagiri University of Texas
• Yipkei Kwok University of Texas
• Patricia J. Teller University of Texas
• Ricardo Portillo University of Texas
• Seetharami R. Seelam IBM Thomas J. Watson Research Center

Resumo

Providing differentiated service in a consolidated storage environment is a challenging task. To address this problem, we introduce FAIRIO, a cycle-based I/O scheduling algorithm that provides differentiated service to workloads concurrently accessing a consolidated RAID storage system. FAIRIO enforces proportional sharing of I/O service through fair scheduling of disk time. During each cycle of the algorithm, I/O requests are scheduled according to workload weights and disk-time utilization history. Experiments, which were driven by the I/O request streams of real and synthetic I/O benchmarks and run on a modified version of DiskSim, provide evidence of FAIRIO's effectiveness and demonstrate that fair scheduling of disk time is key to achieving differentiated service. In particular, the experimental results show that, for a broad range of workload request types, sizes, and access characteristics, the algorithm provides differentiated storage throughput that is within 10% of being perfectly proportional to workload weights, and, it achieves this with little or no degradation of aggregate throughput. The core design concepts of FAIRIO, including service-time allocation and history-driven compensation, potentially can be used to design I/O scheduling algorithms that provide workloads with differentiated service in storage systems comprised of RAIDs, multiple RAIDs, SANs, and hypervisors for Clouds.

Palavras-chave: Resource management, Benchmark testing, Throughput, Measurement, Aggregates, History, Processor scheduling, storage systems, RAID, fairness, differentiated service, I/O performance