TY - GEN
T1 - DOSAS
T2 - 2012 IEEE International Conference on Cluster Computing, CLUSTER 2012
AU - Chen, Chao
AU - Chen, Yong
AU - Roth, Philip C.
PY - 2012
Y1 - 2012
N2 - Active storage provides an effective method to mitigate the I/O bottleneck problem of data intensive high performance computing applications. It can reduce the amount of data transferred as the application runs by moving appropriate computations close to the data. Prior research has achieved considerable progress in developing several active storage prototypes. However, existing studies have neglected the impact of resource contention when concurrent processes request IOoperations from the same storage node simultaneously, which happens frequently in practice. In this paper, we analyze the impact of resource contention on active storage systems. Motivated by our analysis, we propose a novel Dynamic Operation Scheduling Active Storage architecture to address the resource contention issue. It offloads the active processing operations dynamically between storage nodes and compute nodes according to the system environment. By evaluating our architecture, we observed that: (1) resource contention is a critical problem for active storage systems, (2) the proposed dynamic operation scheduling method mitigates the problem, and (3) the new active storage architecture outperforms existing active storage systems.
AB - Active storage provides an effective method to mitigate the I/O bottleneck problem of data intensive high performance computing applications. It can reduce the amount of data transferred as the application runs by moving appropriate computations close to the data. Prior research has achieved considerable progress in developing several active storage prototypes. However, existing studies have neglected the impact of resource contention when concurrent processes request IOoperations from the same storage node simultaneously, which happens frequently in practice. In this paper, we analyze the impact of resource contention on active storage systems. Motivated by our analysis, we propose a novel Dynamic Operation Scheduling Active Storage architecture to address the resource contention issue. It offloads the active processing operations dynamically between storage nodes and compute nodes according to the system environment. By evaluating our architecture, we observed that: (1) resource contention is a critical problem for active storage systems, (2) the proposed dynamic operation scheduling method mitigates the problem, and (3) the new active storage architecture outperforms existing active storage systems.
KW - active storage
KW - data intensive computing
KW - dynamic active storage
KW - high performance computing
KW - parallel I/O
KW - parallel file systems
KW - resource contention
UR - http://www.scopus.com/inward/record.url?scp=84870652963&partnerID=8YFLogxK
U2 - 10.1109/CLUSTER.2012.66
DO - 10.1109/CLUSTER.2012.66
M3 - Conference contribution
AN - SCOPUS:84870652963
SN - 9780768548074
T3 - Proceedings - 2012 IEEE International Conference on Cluster Computing, CLUSTER 2012
SP - 164
EP - 172
BT - Proceedings - 2012 IEEE International Conference on Cluster Computing, CLUSTER 2012
PB - IEEE Computer Society
Y2 - 24 September 2012 through 28 September 2012
ER -