Enhanced Exploration of Protein Conformational Space through Integration of Ultra-Coarse-Grained Models to Multiscale Workflows
Not Available
Engineering topics
Publications and source records attributed to Oppelstrup, Tomas.
Not Available
Explore the source record for details and available documents.
Artifact Description of the Cerebras TriLabs SC'24 conference paper. Include details and procedures for how to reproduce timing computations.
The oncogene RAS, extensively studied for decades, presents persistent gaps in understanding, hindering the development of effective therapeutic strategies due to a lack of precise details on how RAS initiates MAPK signaling with RAF effector proteins at the plasma membrane. Recent advances in X-ray crystallography, cryo-EM, and super-resolution fluorescence microscopy offer structural and spatial insights, yet the molecular mechanisms involving protein-protein and protein-lipid interactions in RAS-mediated signaling require further characterization. This study utilizes single-molecule experimental techniques, nuclear magnetic resonance spectroscopy, and the computational Machine-Learned Modeling Infrastructure (MuMMI) to examine KRAS4b and RAF1 on a biologically relevant lipid bilayer. MuMMI captures long-timescale events while preserving detailed atomic descriptions, providing testable models for experimental validation. Both in vitro and computational studies reveal that RBDCRD binding alters KRAS lateral diffusion on the lipid bilayer, increasing cluster size and decreasing diffusion. RAS and membrane binding cause hydrophobic residues in the CRD region to penetrate the bilayer, stabilizing complexes through β-strand elongation. These cooperative interactions among lipids, KRAS4b, and RAF1 are proposed as essential for forming nanoclusters, potentially a critical step in MAP kinase signal activation.
ParaDiS, or Parallel Dislocation Simulator, is a simulation tool that performs direct numerical simulation of dislocation ensembles, the carriers of plasticity, to predict the strength in crystalline materials from the fundamental physics of defect motion, evolution, and interaction. The code has been successfully deployed on high performance computing architectures and used to study the origins of strength and strain hardening for cubic crystals, the strength of micro-pillars, and irradiated materials at LLNL. The ParaDiS code has been successfully deployed on more than one hundred thousand CPU's with over ten million active degrees of freedom.
Not Available
Not Available
Complex scientific inquiries rely increasingly upon large and autonomous multiscale simulation campaigns, which fundamentally require similarity metrics to quantify ‘sufficient’ changes among data and/or configurations. However, subject matter experts are often unable to articulate similarity precisely or in terms of well-formulated definitions, especially when new hypotheses are to be explored, making it challenging to design a meaningful metric. Furthermore, the key to practical usefulness of such metrics to enable autonomous simulations lies in in situ inference, which requires generalization to possibly substantial distributional shifts in unseen, future data. Here, we address these challenges in a cancer biology application and develop a meaningful similarity metric for ‘patches’—regions of simulated human cell membrane that express interactions between certain proteins of interest and relevant lipids. In the absence of well-defined conditions for similarity, we leverage several biology-informed notions about data and the underlying simulations to impose inductive biases on our metric learning framework, resulting in a suitable similarity metric that also generalizes well to significant distributional shifts encountered during the deployment. We combine these intuitions to organize the learned embedding space in a multiscale manner, which makes the metric robust to incomplete and even contradictory intuitions. Our approach delivers a metric that not only performs well on the conditions used for its development and other relevant criteria, but also learns key spatiotemporal relationships without ever being exposed to any such information during training.
Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.
The objective of this study is to develop a new computational methodology to predict the motion of grain boundaries in tungsten associated with recrystallization. This approach accounts recently discovered high-temperature grain boundary phases in tungsten and other metals and alloys. This paper reports the initial work in the project that developed a novel technique for molecular dynamics to characterize disconnections, dislocation-like defects in grain boundaries that mediate grain boundary motion. Grain boundary properties are needed for a thermomechanical model of recrystallization of tungsten for magnetic fusion applications.
Significance Here we present an unprecedented multiscale simulation platform that enables modeling, hypothesis generation, and discovery across biologically relevant length and time scales to predict mechanisms that can be tested experimentally. We demonstrate that our predictive simulation-experimental validation loop generates accurate insights into RAS-membrane biology. Evaluating over 100,000 correlated simulations, we show that RAS–lipid interactions are dynamic and evolving, resulting in: 1) a reordering and selection of lipid domains in realistic eight-lipid bilayers, 2) clustering of RAS into multimers correlating with specific lipid fingerprints, 3) changes in the orientation of the RAS G-domain impacting its ability to interact with effectors, and 4) demonstration that RAS–RAS G-domain interfaces are nonspecific in these putative signaling domains.
Describing microstructure evolution in tungsten requires a quantitative description of the anisotropic grain boundary energy. Here we present a grain boundary energy function for tungsten that specifies the energy of an arbitrary boundary given its five macroscopic crystallographic parameters. A comparison of measured grain boundary areas and the grain boundary energies given by the function at the Σ11, Σ17b, and Σ33a misorientations, which are problematic to determine by measurement or atomistic calculations, reveals inverse correlations that are similar to what have been observed in other metals.
The advancement of machine learning techniques and the heterogeneous architectures of most current supercomputers are propelling the demand for large multiscale simulations that can automatically and autonomously couple diverse components and map them to relevant resources to solve complex problems at multiple scales. Nevertheless, despite the recent progress in workflow technologies, current capabilities are limited to coupling two scales. In the first-ever demonstration of using three scales of resolution, we present a scalable and generalizable framework that couples pairs of models using machine learning and in situ feedback. We expand upon the massively parallel Multiscale Machine-Learned Modeling Infrastructure (MuMMI), a recent, award-winning workflow, and generalize the framework beyond its original design. We discuss the challenges and learnings in executing a massive multiscale simulation campaign that utilized over 600,000 node hours on Summit and achieved more than 98% GPU occupancy for more than 83% of the time. We present innovations to enable several orders of magnitude scaling, including simultaneously coordinating 24,000 jobs, and managing several TBs of new data per day and over a billion files in total. Finally, we describe the generalizability of our framework and, with an upcoming open-source release, discuss how the presented framework may be used for new applications.
Multiscale simulations are a well-accepted way to bridge the length and time scales required for scientific studies with the solution accuracy achievable through available computational resources. Traditional approaches either solve a coarse model with selective refinement or coerce a detailed model into faster sampling, both of which have limitations. Here, we present a paradigm of adaptive, multiscale simulations that couple different scales using a dynamic-importance sampling approach. Our method uses machine learning to dynamically and exhaustively sample the phase space explored by a macro model using microscale simulations and enables an automatic feedback from the micro to the macro scale, leading to a self-healing multiscale simulation. As a result, our approach delivers macro length and time scales, but with the effective precision of the micro scale. Our approach is arbitrarily scalable as well as transferable to many different types of simulations. Overall, our method made possible a multiscale scientific campaign of unprecedented scale to understand the interactions of RAS proteins with a plasma membrane in the context of cancer research running over several days on Sierra, which is currently the second-most-powerful supercomputer in the world.
For thousands of years, humans have exploited the natural property of metals to get stronger or harden when mechanically deformed. Ultimately rooted in the motion of dislocations, mechanisms of metal hardening have remained in the cross-hairs of physical metallurgists for over a century. Here, we performed atomistic simulations at the limits of supercomputing that are sufficiently large to be statistically representative of macroscopic crystal plasticity yet fully resolved to examine the origins of metal hardening at its most fundamental level of atomic motion. We demonstrate that the notorious staged (inflection) hardening of metals is a direct consequence of crystal rotation under uniaxial straining. At odds with widely divergent and contradictory views in the literature, we observe that basic mechanisms of dislocation behaviour are the same across all stages of metal hardening.
We have implemented the Martini force field within Lawrence Livermore National Laboratory’s molecular dynamics program, ddcMD. The program is extended to a heterogeneous programming model so that it can exploit graphics processing unit (GPU) accelerators. In addition to the Martini force field being ported to the GPU, the entire integration step, including thermostat, barostat, and constraint solver, is ported as well, which speeds up the simulations to 278-fold using one GPU vs one central processing unit (CPU) core. A benchmark study is performed with several test cases, comparing ddcMD and GROMACS Martini simulations. The average performance of ddcMD for a protein–lipid simulation system of 136k particles achieves 1.04 µs/day on one NVIDIA V100 GPU and aggregates 6.19 µs/day on one Summit node with six GPUs. The GPU implementation in ddcMD offloads all computations to the GPU and only requires one CPU core per simulation to manage the inputs and outputs, freeing up remaining CPU resources on the compute node for alternative tasks often required in complex simulation campaigns.
ddcMD is a general purpose molecular dynamics (MD) code that supports MPI parallelism. MD codes are used for simulation of particles systems and capture all the many-body effects of the underlying particle potential that defines the physical system. Though MD can be used to model systems from the subatomic to astrological length scales ddcMD is mainly focused on the atomic scale length scale, In this release of ddcMD the support will be mainly for systems using the coarse-grain Martini potential, a particle potential for biological systems.