The Community for Technology Leaders
2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (2013)
Cambridge, MA, USA USA
May 20, 2013 to May 24, 2013
pp: 1971-1980
ABSTRACT
Most of the prior mechanisms on managing shared storage resources manage each individual shared resource without considering the interplay between different resources, leading to low fairness and loss of performance. Therefore, a coordinated mechanism that provides fairness in the entire shared storage system is desirable. This paper proposes a strategy to control inter-application interference by dynamically adjusting the aggressiveness of the shared storage cache and I/O bandwidth accesses made by multiple, concurrently-executing applications, in a coordinated fashion. Our interference resolver eliminates the need for complicated individual resource-based partitioning mechanisms implemented independently in each resource and that require coordination. It ensures fairness among high performance applications that access the underlying storage system, while best utilizing the available resources. In our experimental evaluation, we use both trace-driven simulations and an implementation in the Linux kernel 2.6.32, and show that our interference resolver can significantly increase system performance and provide fairness to concurrently-executing applications.
INDEX TERMS
Fairness, Storage Systems, I/O
CITATION

R. Prabhakar, M. Kandemir, P. Raghavan and M. Jung, "Interference Resolver in Shared Storage Systems to Provide Fairness to I/O Intensive Applications," 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum(IPDPSW), Cambridge, MA, USA USA, 2013, pp. 1971-1980.
doi:10.1109/IPDPSW.2013.158
215 ms
(Ver 3.3 (11022016))