DiscPOP: Power-aware buffer management for disk accesses

Abstract

Much research has been conducted on energy efficient cache buffer management for disk based storage systems. Some of them use greedy prefetching technique to artificially increase disk idle intervals if there is a large number of known future requests. However, this might result in sub-optimal solution by not exploiting the relationship between I/O access pattern (sequential/random) and application pattern (cpu time required for computing). In a cpu-bound application, by explicitly taking into account the required CPU time it may reduce energy conservation by up to 50% and increase power cycle number by 100% compared to an existing efficient prefetching scheme without this consideration. In this paper, we consider the tradeoff between disk power consumption, performance guarantee and disk reliability all together by proposing a Disk characteristic based Power-Optimal Prefetching (DiscPOP) scheme. Specifically, we make three contributions: (i) A theoretical model is proposed to analyze energy-efficient cache buffer management in disk I/O system and it was formulated as an optimization problem. We have shown it can be solved via an Integer Linear Programming (ILP) technique, we further conduct the following research. (ii) For offline cases, we proposed a Greedy Partition algorithm (GP) to divide the problem into several small ones and solve them separately via the proposed ILP algorithm. (iii) For online cases, we proposed two heuristic algorithms based on Lazy Start Power-Optimal Prefetching (LSPOP) technique. Both of them use simple threshold controlled algorithms to select a prefetching start judiciously and cautiously. We use a trace-driven simulation to evaluate our proposed schemes. The results show GP outperforms the traditional aggressive prefetching by up to 26.9% more disk energy conservation and 17.8% power cycle reduction. The online heuristic algorithms can also improve disk energy saving by up to 20.5% and reduce power cycle by 14.3%.