Abstract
Many time-dependent problems like molecular dynamics of protein folding require a large number of time steps. The latencies and overheads of common-purpose clusters with accelerators are too big for high-frequency iteration. We introduce an algorithmic model called Samsara Parallel (or SP) which, unlike BSP, relies on asynchronous communications and can repeatedly return to earlier time steps to refine the precision of computation. This also extends a line of research called Parallel-in-Time in computational chemistry and physics.
- L. Baffico, S. Bernard, Y. Maday, and G. T. G. Zerah. Parallel-in-time molecular-dynamics simulations. Physical Review E, 66(5), 2002.Google Scholar
Cross Ref
- J. M. Bahi, S. Contassot-Vivier, and R. Couturier. Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters. Parallel Computing, 31:439--461, 2005. Google Scholar
Digital Library
- J.-L. Lions, Y. Manday, and G. Turinici. Resolution EDP par un schema en temps parareal. C. R. Acad. Sci. Numerical Analysis, 332(7):661--668, 2001.Google Scholar
- D. E. Shaw and et al. Anton, a special-purpose machine for molecular dynamics simulation. Communications of the ACM, 51(7):91--97, 2008. Google Scholar
Digital Library
- L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103--111, 1990. Google Scholar
Digital Library
Index Terms
Samsara parallel: a non-BSP parallel-in-time model
Recommendations
Samsara parallel: a non-BSP parallel-in-time model
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingMany time-dependent problems like molecular dynamics of protein folding require a large number of time steps. The latencies and overheads of common-purpose clusters with accelerators are too big for high-frequency iteration. We introduce an algorithmic ...
Portable and Efficient Parallel Computing Using the BSP Model
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically optimal execution of architecture-independent software ...
An object-oriented bulk synchronous parallel library for multicore programming
We show that the bulk synchronous parallel (BSP) model, originally designed for distributed-memory systems, is also applicable for shared-memory multicore systems and, furthermore, that BSP libraries are useful in scientific computing on these systems. ...






Comments