Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “petascale computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Methodology for the Simulation of Molecular Motors at Different Scales

Millisecond-scale conformational transitions represent a seminal challenge for traditional molecular dynamics simulations, even with the help of high-end supercomputer architectures. Such events are particularly relevant to the study of molecular motors—proteins or abiological constructs that convert chemical energy into mechanical work. Here, we present a hybrid-simulation scheme combining an array of methods including elastic network models, transition path sampling, and advanced free-energy methods, possibly in conjunction with generalized-ensemble schemes to deliver a viable option for capturing the millisecond-scale motor steps of biological motors. The methodology is already implemented in large measure in popular molecular dynamics programs, and it can leverage the massively parallel capabilities of petascale computers. The applicability of the hybrid method is demonstrated with two examples, namely cyclodextrin-based motors and V-type ATPases.

Chemistry↗

Enabling Technologies for Petascale Electromagnetic Accelerator Simulation

The SciDAC2 accelerator project at SLAC aims to simulate an entire three-cryomodule radio frequency (RF) unit of the International Linear Collider (ILC) main Linac. Petascale computing resources supported by advances in Applied Mathematics (AM) and Computer Science (CS) and INCITE Program are essential to enable such very large-scale electromagnetic accelerator simulations required by the ILC Global Design Effort. This poster presents the recent advances and achievements in the areas of CS/AM through collaborations.

43 PARTICLE ACCELERATORS↗

A lightweight I/O scheme to facilitate spatial and temporal queries of scientific data analytics

In the era of petascale computing, more scientific applications are being deployed on leadership scale computing platforms to enhance the scientific productivity. Many I/O techniques have been designed to address the growing I/O bottleneck on large-scale systems by handling massive scientific data in a holistic manner. While such techniques have been leveraged in a wide range of applications, they have not been shown as adequate for many mission critical applications, particularly in data postprocessing stage. One of the examples is that some scientific applications generate datasets composed of a vast amount of small data elements that are organized along many spatial and temporal dimensions but require sophisticated data analytics on one or more dimensions. Including such dimensional knowledge into data organization can be beneficial to the efficiency of data post-processing, which is often missing from exiting I/O techniques. In this study, we propose a novel I/O scheme named STAR (Spatial and Temporal AggRegation) to enable high performance data queries for scientific analytics. STAR is able to dive into the massive data, identify the spatial and temporal relationships among data variables, and accordingly organize them into an optimized multi-dimensional data structure before storing to the storage. This technique not only facilitates the common access patterns of data analytics, but also further reduces the application turnaround time. In particular, STAR is able to enable efficient data queries along the time dimension, a practice common in scientific analytics but not yet supported by existing I/O techniques. In our case study with a critical climate modeling application GEOS-5, the experimental results on Jaguar supercomputer demonstrate an improvement up to 73 times for the read performance compared to the original I/O method.

Tian, Yuan↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Ultrascale visualization capabilities for the ParaView/VTK framework

The software is a set of technologies developed by the SciDAC Institute for Ultrascale Visualization in order to address the visualization needs for petascale computing and beyond. These technologies include improved I/O performance, simulation co-processing, advanced rendering capabilities, and specialized visualization techniques developed for SciDAC applications.

MORELAND, KENNETH↗

Institute for Scalable Application Development Software

Work by the University of Wisconsin as part of the DOE SciDAC CScADS includes the following accomplishments: Research on tool componentization, with concentration on the: InstructionAPI and InstructionSemanticsAPI ParseAPI DataflowAPI Co-organized a series of high successful workshops with Prof. John Mellor-Crummey, Rice University, on Performance Tools for Petascale Computing, held in Snowbird, Utah and Lake Tahoe, California in July or August of 2007 through 2012. Investigated the use of multicore in numerical libraries Dyninst porting to 32- and 64bit Power/PowerPC (including BlueGene) and 32- and 64-bit Pentium platforms. Applying our toolkits to advanced problems in binary code parsing associated with dealing with legacy and malicious code.

97 MATHEMATICS AND COMPUTING↗

Wedgehog Manual and Interface Guide, Jayenne-7_0_0

Wedgehog is an IMC package developed by the CCS–2’s Monte Carlo Team1 . Wedgehog is designed to interface with a time-split radiation-hydrodynamics (rad-hydro) code and supports one-dimensional R, two-dimensional RZ or three dimensional XY Z geometry. The geometry is confined to logically rectangular Adaptive Mesh Refinement (AMR) meshes with unit aspect ratios and 2:1 refinement between adjacent cells. Wedgehog supports both two and three temperature simulations. Available scattering models for photon-electron interaction include Compton and isotropic scattering. It maintains a census of particles in between time steps to preserve the contents of the radiation field. Wedgehog can accommodate frequency dependence by using a “Multigroup” (MG) approximation that essentially averages the frequency-dependent opacity information into discrete bins. Additionally, Wedge hog includes a capability to use Opacity Distribution Factors (ODFs) that may be generated with the XCP-5 code TOPS. A previous version of Wedgehog that utilizes IBM’s Cell chip is available for the Roadrunner petascale computer at Los Alamos National Laboratory (circa 2006-2013, estimated). However, as Roadrunner is going out of service in the near future, we have dropped support for the interfaces that were deprecated in Jayenne 6 4 0 and removed in Jayenne-7 0 0. The Roadrunner version had the same interface as the mainline code and is available in RZ and XYZ geometry with all the same features except for flux tallies across a surface (i.e., tally sphere and RZ line-segment).

79 ASTRONOMY AND ASTROPHYSICS↗

Accurate Numerical Simulations Of Chemical Phenomena Involved in Energy Production and Storage with MADNESS and MPQC: ALCF-2 Early Science Program Technical Report

In order to solve the electronic structure of large molecular systems on petascale computers using MADNESS, a numerical tool kit, are required fast and accurate implementations for linear algebra. MADNESS uses multiresolution analysis and low separation rank which translates high dimensional functions in tensor products using Legendre polynomial. The multiple tensor products make to the singular value decomposition and matrix multiplication the most intense operations in MADNESS. This work discusses the interfacing of Eigen3 as a C++ substitute of LAPACK and introduces Elemental for the diagonalization of large matrices. Furthermore, the present paper shows the performance these libraries on Blue Gene/ Q.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Report of a Workshop on Parallelization of Coupled Cluster Methods

The benchmark, ab initio quantum mechanical methods for molecular structure and spectra are now recognized to be coupled-cluster theory. To benefit from the transiiton to tera- and petascale computers, such coupled-cluster methods must be created to run in a scalable fashion. This Workshop, held as a aprt of the 48th annual Sanibel meeting, at St. Simns, Island, GA, addressed that issue. Representatives of all the principal scientific groups who are addressing this topic were in attendance, to exchange information about the problem and to identify what needs to be done in the future. This report summarized the conclusions of the workshop.

36 MATERIALS SCIENCE↗

Progress Report 2008: A Scalable and Extensible Earth System Model for Climate Change Science

This project employs multi-disciplinary teams to accelerate development of the Community Climate System Model (CCSM), based at the National Center for Atmospheric Research (NCAR). A consortium of eight Department of Energy (DOE) National Laboratories collaborate with NCAR and the NASA Global Modeling and Assimilation Office (GMAO). The laboratories are Argonne (ANL), Brookhaven (BNL) Los Alamos (LANL), Lawrence Berkeley (LBNL), Lawrence Livermore (LLNL), Oak Ridge (ORNL), Pacific Northwest (PNNL) and Sandia (SNL). The work plan focuses on scalablity for petascale computation and extensibility to a more comprehensive earth system model. Our stated goal is to support the DOE mission in climate change research by helping ... To determine the range of possible climate changes over the 21st century and beyond through simulations using a more accurate climate system model that includes the full range of human and natural climate feedbacks with increased realism and spatial resolution.

54 ENVIRONMENTAL SCIENCES↗

Level-2 Milestone 3244: Deploy Dawn ID Machine for Initial Science Runs

This report documents the delivery, installation, integration, testing, and acceptance of the Dawn system, ASC L2 milestone 3244: Deploy Dawn ID Machine for Initial Science Runs, due September 30, 2009. The full text of the milestone is included in Attachment 1. The description of the milestone is: This milestone will be a result of work started three years ago with the planning for a multi-petaFLOPS UQ-focused platform (Sequoia) and will be satisfied when a smaller ID version of the final system is delivered, installed, integrated, tested, accepted, and deployed at LLNL for initial science runs in support of SSP mission. The deliverable for this milestone will be a LA petascale computing system (named Dawn) usable for code development and scaling necessary to ensure effective use of a final Sequoia platform (expected in 2011-2012), and for urgent SSP program needs. Allocation and scheduling of Dawn as an LA system will likely be performed informally, similar to what has been used for BlueGene/L. However, provision will be made to allow for dedicated access times for application scaling studies across the entire Dawn resource. The milestone was completed on April 1, 2009, when science runs began running on the Dawn system. The following sections describe the Dawn system architecture, current status, installation and integration time line, and testing and acceptance process. A project plan is included as Attachment 2. Attachment 3 is a letter certifying the handoff of the system to a nuclear weapons stockpile customer. Attachment 4 presents the results of science runs completed on the system.

99 GENERAL AND MISCELLANEOUS↗

Evaluation of Simple Causal Message Logging for Large-Scale Fault Tolerant HPC Systems

The era of petascale computing brought machines with hundreds of thousands of processors. The next generation of exascale supercomputers will make available clusters with millions of processors. In those machines, mean time between failures will range from a few minutes to few tens of minutes, making the crash of a processor the common case, instead of a rarity. Parallel applications running on those large machines will need to simultaneously survive crashes and maintain high productivity. To achieve that, fault tolerance techniques will have to go beyond checkpoint/restart, which requires all processors to roll back in case of a failure. Incorporating some form of message logging will provide a framework where only a subset of processors are rolled back after a crash. In this paper, we discuss why a simple causal message logging protocol seems a promising alternative to provide fault tolerance in large supercomputers. As opposed to pessimistic message logging, it has low latency overhead, especially in collective communication operations. Besides, it saves messages when more than one thread is running per processor. Finally, we demonstrate that a simple causal message logging protocol has a faster recovery and a low performance penalty when compared to checkpoint/restart. Running NAS Parallel Benchmarks (CG, MG and BT) on 1024 processors, simple causal message logging has a latency overhead below 5%.

97 MATHEMATICS AND COMPUTING↗

Ultrascale visualization capabilities for the ParaView/VTK framework

The software is a set of technologies developed by the SciDAC Institute for Ultrascale Visualization in order to address the visualization needs for petascale computing and beyond. These technologies include improved I/O performance, simulation co-processing, advanced rendering capabilities, and specialized visualization techniques developed for SciDAC applications.

MORELAND, KENNETH↗

Linear scaling 3D fragment method for large-scale electronic structure calculations

We present a new linearly scaling three-dimensional fragment (LS3DF) method for large scale ab initio electronic structure calculations. LS3DF is based on a divide-and-conquer approach, which incorporates a novel patching scheme that effectively cancels out the artificial boundary effects due to the subdivision of the system. As a consequence, the LS3DF program yields essentially the same results as direct density functional theory (DFT) calculations. The fragments of the LS3DF algorithm can be calculated separately with different groups of processors. This leads to almost perfect parallelization on tens of thousands of processors. After code optimization, we were able to achieve 35.1 Tflop/s, which is 39% of the theoretical speed on 17,280 Cray XT4 processor cores. Our 13,824-atom ZnTeO alloy calculation runs 400 times faster than a direct DFT calculation, even presuming that the direct DFT calculation can scale well up to 17,280 processor cores. These results demonstrate the applicability of the LS3DF method to material simulations, the advantage of using linearly scaling algorithms over conventional O(N{sup 3}) methods, and the potential for petascale computation using the LS3DF method.

97 MATHEMATICS AND COMPUTING↗

Linearly Scaling 3D Fragment Method for Large-Scale Electronic Structure Calculations

We present a new linearly scaling three-dimensional fragment (LS3DF) method for large scale ab initio electronic structure calculations. LS3DF is based on a divide-and-conquer approach, which incorporates a novel patching scheme that effectively cancels out the artificial boundary effects due to the subdivision of the system. As a consequence, the LS3DF program yields essentially the same results as direct density functional theory (DFT) calculations. The fragments of the LS3DF algorithm can be calculated separately with different groups of processors. This leads to almost perfect parallelization on tens of thousands of processors. After code optimization, we were able to achieve 35.1 Tflop/s, which is 39percent of the theoretical speed on 17,280 Cray XT4 processor cores. Our 13,824-atom ZnTeO alloy calculation runs 400 times faster than a direct DFTcalculation, even presuming that the direct DFT calculation can scale well up to 17,280 processor cores. These results demonstrate the applicability of the LS3DF method to material simulations, the advantage of using linearly scaling algorithms over conventional O(N3) methods, and the potential for petascale computation using the LS3DF method.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Collaboration Portal for Petascale Simulations

The emergence of petascale computing is creating a tsunami of data from peta-scale simulations. Typically, results are analyzed by dozens of scientists who often work as teams. Obviously, it is very important to help these teams by facilitating management, analysis, sharing, and visualization of the data produced by their simulations, and by the auxiliary programs and activities used in the scientific process. One aspect of this is leveraging of their collective knowledge and experiences through a scientific social network. This can be achieved through a combination of back-end IT services, provenance capturing, and easy to use front-end tools. 'eSimMon', is one such tool. In this paper we describe this analysis support system, discuss its ease of use, its efficiency, and its ability to accelerate scientific discovery.

97 MATHEMATICS AND COMPUTING↗

Collaborative Monitoring and Analysis for Simulation Scientist

Collaboratively monitoring and analyzing large scale simulations from petascale computers is an important area of research and development within the scientific community. This paper addresses these issues when teams of colleagues from different research areas work together to help understand the complex data generated from these simulations. In particular, we address the issues when geographically diverse teams of disparate researchers work together to understand the complex science being simulation on high performance computers. Most application scientists want to focus on the sciences and spend a minimum amount of time learning new tools or adopting new techniques to monitor and analyze their simulation data. The challenge eSimMon, of our web-based system is to decrease or eliminate some of the hurdles on the scientists path to scientific discovery, and allow these collaborations to flourish.

99 GENERAL AND MISCELLANEOUS↗