Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Mathematical analysis of coupled parallel simulations.

M R Shirts1, V S Pande

  • 1Department of Chemistry, Stanford University, Stanford, California 94305-5080, USA.

Physical Review Letters
|June 1, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Free energy landscape of activation in a signalling protein at atomic resolution.

Nature communications·2015
Same author

Perspective: Markov models for long-timescale biomolecular dynamics.

The Journal of chemical physics·2014
Same author

Multiscale dynamics of macromolecules using normal mode Langevin.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2009
Same author

A multiscale approach to sampling nascent peptide chains in the ribosomal exit tunnel.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2009
Same author

COMPUTING: Screen Savers of the World Unite!

Science (New York, N.Y.)·2007
Same author

Mechanical unfolding of a beta-hairpin using molecular dynamics.

Biophysical journal·2000
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Parallel simulations coupled together can approximate long trajectories, offering significant speedups for complex computational problems. Varying the coupling can even achieve greater than linear speedup, making intractable simulations feasible.

Area of Science:

  • Computational science
  • Statistical mechanics
  • Algorithm optimization

Background:

  • Complex simulations often require extensive computational resources.
  • Approximating long trajectories is crucial for understanding system dynamics.
  • Current methods may face limitations in efficiency for certain problems.

Purpose of the Study:

  • To develop a method for approximating long simulation trajectories using parallel replicas.
  • To investigate the speedup achievable with statistically coupled parallel simulations.
  • To explore methods for obtaining greater than linear speedup in simulations.

Main Methods:

  • Utilizing a set of parallel simulation replicas.
  • Statistically coupling these parallel simulations.

Related Experiment Videos

  • Varying the coupling parameters between simulations.

    • Main Results:

    • The coupled parallel simulations closely approximate long trajectories.
    • Achieved nearly linear speedup (M times faster with M simulations) in many cases.
    • Demonstrated the potential for greater than linear speedup in specific systems by adjusting coupling.

    Conclusions:

    • Statistically coupled parallel simulations offer an efficient approach to approximating long trajectories.
    • This method significantly enhances computational feasibility for previously intractable problems.
    • The generalizability extends to search algorithms with long residence times in intermediate states.