TY - GEN
T1 - Data-driven time parallelization
AU - Ji, Lei
AU - Yu, Yanan
AU - Chandra, Namas
AU - Nymeyer, Hugh
AU - Srinivasan, Ashok
PY - 2006
Y1 - 2006
N2 - We present a new approach to parallelization of important scientific applications. It is based on the observation that results of prior, related, simulations are often available. We use such data to parallelize the time domain. We demonstrate the effectiveness of our approach in Molecular Dynamics (MD) simulations, which are widely used in nano and nano-bio sciences. An important limitation of MD is that the time-step size is around a femto-second. So a large number of time-steps are required to simulate to realistic time scales. Conventional parallelization is of limited effectiveness here - the most scalable codes currently are not efficient at granularities finer than several milliseconds per iteration. Using our approach, Carbon Nanotube simulations scale to granularities as fine as around ten microseconds per iteration. We also present results on protein unfolding simulations of AFM pulling, where we obtain additional one order of magnitude scalability over conventional parallelization.
AB - We present a new approach to parallelization of important scientific applications. It is based on the observation that results of prior, related, simulations are often available. We use such data to parallelize the time domain. We demonstrate the effectiveness of our approach in Molecular Dynamics (MD) simulations, which are widely used in nano and nano-bio sciences. An important limitation of MD is that the time-step size is around a femto-second. So a large number of time-steps are required to simulate to realistic time scales. Conventional parallelization is of limited effectiveness here - the most scalable codes currently are not efficient at granularities finer than several milliseconds per iteration. Using our approach, Carbon Nanotube simulations scale to granularities as fine as around ten microseconds per iteration. We also present results on protein unfolding simulations of AFM pulling, where we obtain additional one order of magnitude scalability over conventional parallelization.
UR - http://www.scopus.com/inward/record.url?scp=34548272177&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548272177&partnerID=8YFLogxK
U2 - 10.1145/1188455.1188609
DO - 10.1145/1188455.1188609
M3 - Conference contribution
AN - SCOPUS:34548272177
SN - 0769527000
SN - 9780769527000
T3 - Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, SC'06
BT - Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, SC'06
ER -