TY - GEN
T1 - Resource provisioning for staging components
AU - Nguyen, Tuan Anh
AU - Eisenhauer, Greg
AU - Schwan, Karsten
AU - Wolf, Matthew
AU - Abbasi, Hasan
AU - Klasky, Scott
AU - Podhorszki, Norbert
PY - 2013
Y1 - 2013
N2 - To deal with the inordinate output data volumes of current and future high end simulations, researchers are turning to online methods in which multiple software components that implement desired data analytics and visualization are run on 'staging resources' of the petascale machine, concurrently and coupled with the simulations producing these outputs. Efficient online execution of data analytics 'in the output stream', however, requires careful provisioning of staging resources, to obtain delays for analytics processing that prevent applications from blocking on stalled output, while also bounding total required staging resources. This paper addresses the 'staging provisioning' problem, assuming sets of components arranged as potentially multiple analytics/output pipelines that differ in runtime behavior and resource requirements. For such configurations, it then meets the throughput constraint of online analytics while also minimizing end-to-end pipeline latency, all based on runtime observations and predictions of component performance. Experimental evaluations demonstrate the algorithm's utility. Its complexity for minimizing latency without violating throughput constraints is O(M), where M is the number of components in the staging area.
AB - To deal with the inordinate output data volumes of current and future high end simulations, researchers are turning to online methods in which multiple software components that implement desired data analytics and visualization are run on 'staging resources' of the petascale machine, concurrently and coupled with the simulations producing these outputs. Efficient online execution of data analytics 'in the output stream', however, requires careful provisioning of staging resources, to obtain delays for analytics processing that prevent applications from blocking on stalled output, while also bounding total required staging resources. This paper addresses the 'staging provisioning' problem, assuming sets of components arranged as potentially multiple analytics/output pipelines that differ in runtime behavior and resource requirements. For such configurations, it then meets the throughput constraint of online analytics while also minimizing end-to-end pipeline latency, all based on runtime observations and predictions of component performance. Experimental evaluations demonstrate the algorithm's utility. Its complexity for minimizing latency without violating throughput constraints is O(M), where M is the number of components in the staging area.
KW - resource management
KW - resource provisioning
KW - staging
UR - http://www.scopus.com/inward/record.url?scp=84899724390&partnerID=8YFLogxK
U2 - 10.1109/IPDPSW.2013.152
DO - 10.1109/IPDPSW.2013.152
M3 - Conference contribution
AN - SCOPUS:84899724390
SN - 9780769549798
T3 - Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
SP - 1947
EP - 1953
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 -