skip to main content
research-article

Samsara parallel: a non-BSP parallel-in-time model

Published:27 February 2016Publication History
Skip Abstract Section

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.

References

  1. L. Baffico, S. Bernard, Y. Maday, and G. T. G. Zerah. Parallel-in-time molecular-dynamics simulations. Physical Review E, 66(5), 2002.Google ScholarGoogle ScholarCross RefCross Ref
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle Scholar
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103--111, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Samsara parallel: a non-BSP parallel-in-time model

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 51, Issue 8
        PPoPP '16
        August 2016
        405 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/3016078
        Issue’s Table of Contents
        • cover image ACM Conferences
          PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
          February 2016
          420 pages
          ISBN:9781450340922
          DOI:10.1145/2851141

        Copyright © 2016 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 27 February 2016

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!