Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where John L. Klepeis is active.

Publication


Featured researches published by John L. Klepeis.


Proteins | 2010

Improved side‐chain torsion potentials for the Amber ff99SB protein force field

Kresten Lindorff-Larsen; Stefano Piana; Kim Palmo; Paul Maragakis; John L. Klepeis; Ron O. Dror; David E. Shaw

Recent advances in hardware and software have enabled increasingly long molecular dynamics (MD) simulations of biomolecules, exposing certain limitations in the accuracy of the force fields used for such simulations and spurring efforts to refine these force fields. Recent modifications to the Amber and CHARMM protein force fields, for example, have improved the backbone torsion potentials, remedying deficiencies in earlier versions. Here, we further advance simulation accuracy by improving the amino acid side‐chain torsion potentials of the Amber ff99SB force field. First, we used simulations of model alpha‐helical systems to identify the four residue types whose rotamer distribution differed the most from expectations based on Protein Data Bank statistics. Second, we optimized the side‐chain torsion potentials of these residues to match new, high‐level quantum‐mechanical calculations. Finally, we used microsecond‐timescale MD simulations in explicit solvent to validate the resulting force field against a large set of experimental NMR measurements that directly probe side‐chain conformations. The new force field, which we have termed Amber ff99SB‐ILDN, exhibits considerably better agreement with the NMR data. Proteins 2010.


conference on high performance computing (supercomputing) | 2006

Scalable algorithms for molecular dynamics simulations on commodity clusters

Kevin J. Bowers; Edmond Chow; Huafeng Xu; Ron O. Dror; Michael P. Eastwood; Brent A. Gregersen; John L. Klepeis; István Kolossváry; Mark A. Moraes; Federico D. Sacerdoti; John K. Salmon; Yibing Shan; David E. Shaw

Although molecular dynamics (MD) simulations of biomolecular systems often run for days to months, many events of great scientific interest and pharmaceutical relevance occur on long time scales that remain beyond reach. We present several new algorithms and implementation techniques that significantly accelerate parallel MD simulations compared with current state-of-the-art codes. These include a novel parallel decomposition method and message-passing techniques that reduce communication requirements, as well as novel communication primitives that further reduce communication time. We have also developed numerical techniques that maintain high accuracy while using single precision computation in order to exploit processor-level vector instructions. These methods are embodied in a newly developed MD code called Desmond that achieves unprecedented simulation throughput and parallel scalability on commodity clusters. Our results suggest that Desmonds parallel performance substantially surpasses that of any previously described code. For example, on a standard benchmark, Desmonds performance on a conventional Opteron cluster with 2K processors slightly exceeded the reported performance of IBMs Blue Gene/L machine with 32K processors running its Blue Matter MD code


Current Opinion in Structural Biology | 2009

Long-timescale molecular dynamics simulations of protein structure and function.

John L. Klepeis; Kresten Lindorff-Larsen; Ron O. Dror; David E. Shaw

Molecular dynamics simulations allow for atomic-level characterization of biomolecular processes such as the conformational transitions associated with protein function. The computational demands of such simulations, however, have historically prevented them from reaching the microsecond and greater timescales on which these events often occur. Recent advances in algorithms, software, and computer hardware have made microsecond-timescale simulations with tens of thousands of atoms practical, with millisecond-timescale simulations on the horizon. This review outlines these advances in high-performance molecular dynamics simulation and discusses recent applications to studies of protein dynamics and function as well as experimental validation of the underlying computational models.


ieee international conference on high performance computing data and analytics | 2009

Millisecond-scale molecular dynamics simulations on Anton

David E. Shaw; Ron O. Dror; John K. Salmon; J. P. Grossman; Kenneth M. Mackenzie; Joseph A. Bank; Cliff Young; Martin M. Deneroff; Brannon Batson; Kevin J. Bowers; Edmond Chow; Michael P. Eastwood; Douglas J. Ierardi; John L. Klepeis; Jeffrey S. Kuskin; Richard H. Larson; Kresten Lindorff-Larsen; Paul Maragakis; Mark A. Moraes; Stefano Piana; Yibing Shan; Brian Towles

Anton is a recently completed special-purpose supercomputer designed for molecular dynamics (MD) simulations of biomolecular systems. The machines specialized hardware dramatically increases the speed of MD calculations, making possible for the first time the simulation of biological molecules at an atomic level of detail for periods on the order of a millisecond-about two orders of magnitude beyond the previous state of the art. Anton is now running simulations on a timescale at which many critically important, but poorly understood phenomena are known to occur, allowing the observation of aspects of protein dynamics that were previously inaccessible to both computational and experimental study. Here, we report Antons performance when executing actual MD simulations whose accuracy has been validated against both existing MD software and experimental observations. We also discuss the manner in which novel algorithms have been coordinated with Antons co-designed, application-specific hardware to achieve these results.


Journal of Chemical Physics | 2005

Gaussian split Ewald: A fast Ewald mesh method for molecular simulation

Yibing Shan; John L. Klepeis; Michael P. Eastwood; Ron O. Dror; David E. Shaw

Gaussian split Ewald (GSE) is a versatile Ewald mesh method that is fast and accurate when used with both real-space and k-space Poisson solvers. While real-space methods are known to be asymptotically superior to k-space methods in terms of both computational cost and parallelization efficiency, k-space methods such as smooth particle-mesh Ewald (SPME) have thus far remained dominant because they have been more efficient than existing real-space methods for simulations of typical systems in the size range of current practical interest. Real-space GSE, however, is approximately a factor of 2 faster than previously described real-space Ewald methods for the level of force accuracy typically required in biomolecular simulations, and is competitive with leading k-space methods even for systems of moderate size. Alternatively, GSE may be combined with a k-space Poisson solver, providing a conveniently tunable k-space method that performs comparably to SPME. The GSE method follows naturally from a uniform framework that we introduce to concisely describe the differences between existing Ewald mesh methods.


international symposium on computer architecture | 2007

Anton, a special-purpose machine for molecular dynamics simulation

David E. Shaw; Martin M. Deneroff; Ron O. Dror; Jeffrey S. Kuskin; Richard H. Larson; John K. Salmon; Cliff Young; Brannon Batson; Kevin J. Bowers; Jack C. Chao; Michael P. Eastwood; Joseph Gagliardo; J. P. Grossman; C. Richard Ho; Douglas J. Ierardi; István Kolossváry; John L. Klepeis; Timothy Layman; Christine McLeavey; Mark A. Moraes; Rolf Mueller; Edward C. Priest; Yibing Shan; Jochen Spengler; Michael Theobald; Brian Towles; Stanley C. Wang

The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macro-molecules could in principle provide answers to some of the most important currently outstanding questions in the fields of biology, chemistry and medicine. A wide range of biologically interesting phenomena, however, occur over time scales on the order of a millisecond--about three orders of magnitude beyond the duration of the longest current MD simulations. In this paper, we describe a massively parallel machine called Anton, which should be capable of executing millisecond-scale classical MD simulations of such biomolecular systems. The machine, which is scheduled for completion by the end of 2008, is based on 512 identical MD-specific ASICs that interact in a tightly coupled manner using a specialized high-speed communication network. Anton has been designed to use both novel parallel algorithms and special-purpose logic to dramatically accelerate those calculations that dominate the time required for a typical MD simulation. The remainder of the simulation algorithm is executed by a programmable portion of each chip that achieves a substantial degree of parallelism while preserving the flexibility necessary to accommodate anticipated advances in physical models and simulation methods.


Journal of Physical Chemistry B | 2008

Microsecond Molecular Dynamics Simulation Shows Effect of Slow Loop Dynamics on Backbone Amide Order Parameters of Proteins

Paul Maragakis; Kresten Lindorff-Larsen; Michael P. Eastwood; Ron O. Dror; John L. Klepeis; Isaiah T. Arkin; Morten Ø. Jensen; Huafeng Xu; Nikola Trbovic; and Arthur G. Palmer Iii; David E. Shaw

A molecular-level understanding of the function of a protein requires knowledge of both its structural and dynamic properties. NMR spectroscopy allows the measurement of generalized order parameters that provide an atomistic description of picosecond and nanosecond fluctuations in protein structure. Molecular dynamics (MD) simulation provides a complementary approach to the study of protein dynamics on similar time scales. Comparisons between NMR spectroscopy and MD simulations can be used to interpret experimental results and to improve the quality of simulation-related force fields and integration methods. However, apparent systematic discrepancies between order parameters extracted from simulations and experiments are common, particularly for elements of noncanonical secondary structure. In this paper, results from a 1.2 micros explicit solvent MD simulation of the protein ubiquitin are compared with previously determined backbone order parameters derived from NMR relaxation experiments [Tjandra, N.; Feller, S. E.; Pastor, R. W.; Bax, A. J. Am. Chem. Soc. 1995, 117, 12562-12566]. The simulation reveals fluctuations in three loop regions that occur on time scales comparable to or longer than that of the overall rotational diffusion of ubiquitin and whose effects would not be apparent in experimentally derived order parameters. A coupled analysis of internal and overall motion yields simulated order parameters substantially closer to the experimentally determined values than is the case for a conventional analysis of internal motion alone. Improved agreement between simulation and experiment also is encouraging from the viewpoint of assessing the accuracy of long MD simulations.


Journal of Chemical Physics | 2007

A common, avoidable source of error in molecular dynamics integrators

Ross A. Lippert; Kevin J. Bowers; Ron O. Dror; Michael P. Eastwood; Brent A. Gregersen; John L. Klepeis; István Kolossváry; David E. Shaw

In constrained molecular dynamics simulations using some of the most popular molecular dynamics codes, calculation of the velocities of constrained particles is based solely on the differences in particle positions during two successive time steps. This creates a numerical instability that the authors’ show to be signicant in a typical single-precision floating-point simulation. They describe a simple modification that eliminates this source of instability and demonstrate that this change substantially reduces the energy drift of a sample single-precision NVE simulation.


ieee international conference on high performance computing data and analytics | 2008

A scalable parallel framework for analyzing terascale molecular dynamics simulation trajectories

Tiankai Tu; Charles A. Rendleman; David W. Borhani; Ron O. Dror; Justin Gullingsrud; Morten Ø. Jensen; John L. Klepeis; Paul Maragakis; Patrick J. Miller; Kate A. Stafford; David E. Shaw

As parallel algorithms and architectures drive the longest molecular dynamics (MD) simulations towards the millisecond scale, traditional sequential post-simulation data analysis methods are becoming increasingly untenable. Inspired by the programming interface of Googles MapReduce, we have built a new parallel analysis framework called HiMach, which allows users to write trajectory analysis programs sequentially, and carries out the parallel execution of the programs automatically. We introduce (1) a new MD trajectory data analysis model that is amenable to parallel processing, (2) a new interface for defining trajectories to be analyzed, (3) a novel method to make use of an existing sequential analysis tool called VMD, and (4) an extension to the original MapReduce model to support multiple rounds of analysis. Performance evaluations on up to 512 cores demonstrate the efficiency and scalability of the HiMach framework on a Linux cluster.


high-performance computer architecture | 2008

High-throughput pairwise point interactions in Anton, a specialized machine for molecular dynamics simulation

Richard H. Larson; John K. Salmon; Ron O. Dror; Martin M. Deneroff; Cliff Young; J. P. Grossman; Yibing Shan; John L. Klepeis; David E. Shaw

Anton is a massively parallel special-purpose supercomputer designed to accelerate molecular dynamics (MD) simulations by several orders of magnitude, making possible for the first time the atomic-level simulation of many biologically important phenomena that take place over microsecond to millisecond time scales. The majority of the computation required for MD simulations involves the calculation of pairwise interactions between particles and/or gridpoints separated by no more than some specified cutoff radius. In Anton, such range-limited interactions are handled by a high-throughput interaction subsystem (HTIS). The HTIS on each of Antonpsilas 512 ASICs includes 32 computational pipelines running at 800 MHz, each producing a result on every cycle that would require approximately 50 arithmetic operations to compute on a general-purpose processor. In order to feed these pipelines and collect their results at a speed sufficient to take advantage of this computational power, Anton uses two novel techniques to limit inter- and intra-chip communication. The first is a recently developed parallelization algorithm for the range-limited N-body problem that offers major advantages in both asymptotic and absolute terms by comparison with traditional methods. The second is an architectural feature that processes pairs of points chosen from two point sets in time proportional to the product of the sizes of those sets, but with input and output volume proportional only to their sum. Together, these features allow Anton to perform pairwise interactions with very high throughput and unusually low latency, enabling MD simulations on time scales inaccessible to other general- and special-purpose parallel systems.

Collaboration


Dive into the John L. Klepeis's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Edmond Chow

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge