TY - GEN
T1 - Interference resolver in shared storage systems to provide fairness to I/O intensive applications
AU - Prabhakar, Ramya
AU - Kandemir, Mahmut
AU - Raghavan, Padma
AU - Jung, Myoungsoo
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84899710145&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84899710145&partnerID=8YFLogxK
U2 - 10.1109/IPDPSW.2013.158
DO - 10.1109/IPDPSW.2013.158
M3 - Conference contribution
AN - SCOPUS:84899710145
SN - 9780769549798
T3 - Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
SP - 1971
EP - 1980
BT - Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
PB - IEEE Computer Society
T2 - 2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013
Y2 - 22 July 2013 through 26 July 2013
ER -