Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel clustering”

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 199 records · Page 11

Editorial to the special issue on the 2015 TOUGH Symposium

This Special Issue of Transport in Porous Media features selected papers from the 2015 TOUGH Symposium, which took place on September 28–30, 2015, in Berkeley, California, USA. Such symposia are held every 3 years and are a forum where users of the TOUGH family of numerical simulators meet for an open exchange on the code applications and recent enhancements. The TOUGH codes (TOUGH is an acronym for Transport of Unsaturated Groundwater and Heat) were originally developed in the early 1980s for geothermal reservoir simulation by a team of researchers at the Lawrence Berkeley National Laboratory (LBNL) headed by Karsten Pruess (see http://esd.lbl.gov/TOUGH). The TOUGH codes have a modular structure in which different fluid components can be incorporated into the code by means of a replaceable equation of state (EOS) package. Since its first release, a variety of important EOS modules have been developed, enabling the modeling of volatile organic compounds, decay chains of multiple radionuclides, gas hydrates, tight and shale gas behavior, enhanced oil recovery, and supercritical water and CO 2 . Derivatives and descendants of the basic TOUGH code include coupled multi-phase flow and reactive chemical transport; coupled thermo-hydrologic-mechanical processes; inverse modeling for parameter estimation, sensitivity analysis, and uncertainty quantification; and parallelization for multi-core PCs, workstation clusters, and supercomputers. The TOUGH codes have been applied to a large variety of problems, including geothermal and petroleum reservoir engineering, nuclear waste and CO 2 geologic sequestration, subsurface environmental remediation, methane gas hydrate production, compressed air energy storage, and many other energy and environmental applications. Finally, the international TOUGH user community currently numbers almost 400 organizations (research laboratories, government agencies, private companies, universities, etc.) in over 60 countries.

99 GENERAL AND MISCELLANEOUS↗

Spotlight: efficient automated global optimization in rietveld analysis of diffraction data

Performing reliable Rietveld analysis on tens or hundreds of powder diffraction datasets from parametric or time-resolved experiments often poses a bottleneck in extracting meaningful results from the data. While automated analysis of data has recently been demonstrated, high temperature annealing studies, during which phase transformations occur and lattice parameters may change due to repartitioning of elements, are prime examples where automation by a simple phase identification from a database of room temperature structures or automation by sequential refinements is likely to fail. To enable reliable, efficient, automated Rietveld analysis, we present a Python package named Spotlight , building on established Rietveld packages such as MAUD, GSAS , or GSAS-II , which extends the refinement of best fit parameters to a global optimization using an ensemble of optimizers leveraging hierarchical parallel execution on high-performance computing clusters. Spotlight further enables the efficient design of refinement plans through the iterative automated machine-learning of a surrogate for the refinement on which the global optimizations are performed until results from the surrogate converge to the response surface data. We demonstrate Spotlight with the analysis of uranium molybdenum and Ti–6Al–4V datasets, as well as in two open-source tutorials analyzing aluminium oxide and lead sulphate.

36 MATERIALS SCIENCE↗

Solving global optimization problems on GPU cluster

The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

97 MATHEMATICS AND COMPUTING↗

Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale

This paper describes MADHAT (Multidimensional Anomaly Detection fusing HPC, Analytics, and Tensors), an integrated workflow that demonstrates the applicability of HPC resources to the problem of maintaining cyber situational awareness. MADHAT combines two high-performance packages: ENSIGN for large-scale sparse tensor decompositions and HAGGLE for graph analytics. Tensor decompositions isolate coherent patterns of network behavior in ways that common clustering methods based on distance metrics cannot. Parallelized graph analysis then uses directed queries on a representation that combines the elements of identified patterns with other available information (such as additional log fields, domain knowledge, network topology, whitelists and blacklists, prior feedback, and published alerts) to confirm or reject a threat hypothesis, collect context, and raise alerts. MADHAT was developed using the collaborative HPC Architecture for Cyber Situational Awareness (HACSAW) research environment and evaluated on structured network sensor logs collected from Defense Research and Engineering Network (DREN) sites using HPC resources at the U.S. Army Engineer Research and Development Center DoD Supercomputing Resource Center (ERDC DSRC). To date, MADHAT has analyzed logs with over 650 million entries.

Cyber security, Tensor decomposition, graph analyt↗

PV Hosting Capacity Estimation: Experiences with Scalable Framework

Hosting capacity is an indication of the amount of solar photovoltaics (PV) that can be hosted in a distribution system without additional changes to infrastructure or oper-ations. This paper presents a framework for estimating the PV hosting capacity at scale. First, we analyze computational, modeling and other key challenges of performing relevant, large-scale simulations, provided along with the experiences and lessons learned. Then, we develop two open-source Python-based software tools to conduct repeatable distribution analyses: the Distribution Integration Solution Cost Options (DISCO) for configuring and analyzing simulations and the Job Automation and Deployment Engine (JADE) for parallelizing jobs on high-performance computing clusters. A case study of hosting capacity estimation for the SMART-DS San Francisco (SFO) 2000+ synthetic feeders, is used to demonstrate the capability of the developed DISCO+JADE framework and tools. The framework and tools can help utilities assess the overall hosting capacity of their service territory, which can help them better plan for the overall upgrade costs to integrate more PV in the future. The experiences are shared to aid the tool users and researchers to conduct relevant studies and research.

distributed energy resources↗

iTOUGH2 v7.1

iTOUGH2 (inverse TOUGH2) provides inverse modeling capabilities for TOUGH2, a simulator for multi-dimensional, multi-phase, multi-component, non-isothermal flow and transport in fractured porous media. iTOUGH2 performs sensitivity analyses, data-worth analyses, parameter estimation, and uncertainty propagation analyses in geosciences and reservoir engineering and other application areas. iTOUGH2 supports a number of different combinations of fluids and components (equation-of-state (EOS) modules). In addition, the optimization routines implemented in iTOUGH2 can also be used for sensitivity analysis, automatic model calibration, and uncertainty quantification of any external code that uses text-based input and output files using the PEST protocol. iTOUGH2 solves the inverse problem by minimizing a non-linear objective function of the weighted differences between model output and the corresponding observations. Multiple minimization algorithms (derivative-free, gradient-based, and second-order; local and global) are available. iTOUGH2 also performs Latin Hypercube Monte Carlo simulations for uncertainty propagation analyses. A detailed residual and error analysis is provided. This upgrade includes (a) global sensitivity analysis methods, (b) dynamic memory allocation (c) additional input features and output analyses, (d) increased forward simulation capabilities, (e) parallel execution on multicore PCs and Linux clusters, and (f) bug fixes.

Finsterle, Stefan↗

Status on the Development of a Modeling and Simulation Framework for the Economic Assessment of Nuclear Hybrid Energy Systems

An effort to design and build a modeling and simulation framework to assess the economic viability of Nuclear Hybrid Energy Systems (NHES) was undertaken in fiscal year 2015 (FY15). The purpose of this report is to document the various tasks associated with the development of such a framework and to provide a status on its progress. Several tasks have been accomplished. First, starting from a simulation strategy, a rigorous mathematical formulation has been achieved in which the economic optimization of a Nuclear Hybrid Energy System is presented as a constrained robust (under uncertainty) optimization problem. Some possible algorithms for the solution of the optimization problem are presented. A variation of the Simultaneous Perturbation Stochastic Approximation algorithm has been implemented in RAVEN and preliminary tests have been performed. The development of the software infrastructure to support the simulation of the whole NHES has also moved forward. The coupling between RAVEN and an implementation of the Modelica language (OpenModelica) has been implemented, migrated under several operating systems and tested using an adapted model of a desalination plant. In particular, this exercise was focused on testing the coupling of the different code systems; testing parallel, computationally expensive simulations on the INL cluster; and providing a proof of concept for the possibility of using surrogate models to represent the different NHES subsystems. Another important step was the porting of the RAVEN code under the Windows™ operating system. This accomplishment makes RAVEN compatible with the development environment that is being used for dynamic simulation of NHES components. A very simplified model of a NHES on the electric market has been built in RAVEN to confirm expectations on the analysis capability of RAVEN to provide insight into system economics and to test the capability of RAVEN to identify limit surfaces even for stochastic constraints. This capability will be needed in the future to enforce the stochastic constraints on the electric demand coverage from the NHES. The development team gained experience with many of the tools that are currently envisioned for use in the economic analysis of NHES and completed several important steps. Given the complexity of the project, preference has been given to a structural approach in which several independent efforts have been used to build the cornerstone of the simulation framework. While this is good approach in establishing such a complex framework, it may delay reaching more complete results on the performance of analyzed system configurations. The integration of the previously reported exergy analysis approach was initially proposed as part of this milestone. However, in reality, the exergy-based apportioning of cost will take place only in a second stage of the implementation since it will be used to properly allocate cost among the different NHES subsystems. Therefore, exergy does not appear at the level of the main drivers in the analysis framework; the latter development of the base framework is the focus of this report.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Computing the Properties of Matter with Leadership Computing Resources (Closeout Report for DE-SC0018121)

In order to add more capabilities to Halide, we have designed a new framework called Tiramisu and integrated this framework into Halide. Since Tiramisu enables Halide to target heterogeneous architectures, our development efforts have been refocused on Tiramisu. Most high-performance computer systems today are complex and increasingly heterogeneous; they may have CPUs, GPUs and FPGAs. Achieving best performance requires taking full advantage of all these different architectures. To address this issue, we have designed Tiramisu, an optimization framework that enables Halide (and other DSLs) to target heterogeneous architectures. Tiramisu is an optimization framework that takes as input a high level, architecture-independent representation of code and a set of scheduling and data mapping commands that guide code transformation. The input can either be generated by a domain-specific language (DSL) compiler such as Halide or directly written by a programmer. Tiramisu then applies the user-specified code and data-layout transformations and generates an architecture-specific, low-level intermediate representation (IR) that takes advantage of modern architectural features such as multicore parallelism, non-uniform memory (NUMA) hierarchies, clusters, and accelerators like GPUs and FPGAs. We integrated Tiramisu within Halide and implemented a representative set of benchmarks to evaluate this integration. Tiramisu is now open source and is available for public use (http://tiramisu-compiler.org/). A paper about Tiramisu was published, it shows that Tiramisu extends Halide with many new capabilities and that Tiramisu can generate efficient code for multicores, GPUs, FPGAs and distributed heterogeneous systems. The performance of code generated by the Tiramisu backends matches or exceeds hand optimized reference implementations. For example, the multicore backend matches the highly optimized Intel MKL library on many kernels and shows speedups reaching 4x over the original Halide. In addition to making Tiramisu more robust, we have used Tiramisu to implement a set of representative tensor operation for constructing baryon building blocks required for multi baryon contractions in LQCD. In order to implement this code, we needed to generalize Tiramisu in two ways: first we needed to support indirect array accesses, and second, we needed to add support for complex numbers to Tiramisu. The code generated by Tiramisu is 6x faster than the reference code. Our efforts towards an MPI based multi-node version of tiramisu have matured and the resulting code scales well on multiple nodes (tests up to 512 KNL nodes have been undertaken).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

STUDYING INTERCLUSTER GALAXY FILAMENTS THROUGH STACKING gmBCG GALAXY CLUSTER PAIRS

We present a method to study the photometric properties of galaxies in filaments by stacking the galaxy populations between pairs of galaxy clusters. Using Sloan Digital Sky Survey data, this method can detect the intercluster filament galaxy overdensity with a significance of {approx}5{sigma} out to z = 0.40. Using this approach, we study the g - r color and luminosity distribution of filament galaxies as a function of redshift. Consistent with expectation, filament galaxies are bimodal in their color distribution and contain a larger blue galaxy population than clusters. Filament galaxies are also generally fainter than cluster galaxies. More interestingly, the observed filament population seems to show redshift evolution at 0.12 < z < 0.40: the blue galaxy fraction has a trend to increase at higher redshift; such evolution is parallel to the ''Butcher-Oemler effect'' of galaxy clusters. We test the dependence of the observed filament density on the richness of the cluster pair: richer clusters are connected by higher density filaments. We also test the spatial dependence of filament galaxy overdensity: this quantity decreases when moving away from the intercluster axis between a cluster pair. This method provides an economical way to probe the photometric properties of filament galaxies and should prove useful for upcoming projects like the Dark Energy Survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Extending adaptive sparse grids for stochastic collocation to hybrid parallel architectures

We are developing an adaptive sparse grid library tailored for emerging architectures that will allow the solution of stochastic problems of unprecedented size. This paper gives a brief overview of the problem at hand and presents initial results for a small GPU-based cluster. An outlook on large-scale distributed memory parallelization and our hybrid design approach is also included.

99 GENERAL AND MISCELLANEOUS↗

Young galaxy candidates in the Hubble Frontier Fields. II. MACS J0416–2403

We searched for z ≳ 7 Lyman-break galaxies in the optical-to-mid-infrared Hubble Frontier Field and associated parallel field observations of the strong-lensing cluster MACS J0416−2403. We discovered 22 candidates, of which 6 lie at z ≳ 9 and 1 lies at z ≳ 10. Based on the Hubble and Spitzer photometry, all have secure photometric redshifts and a negligible probability of being at lower redshifts according to their peak-probability ratios, R. This substantial increase in the number of known high-redshift galaxies allows a solid determination of the luminosity function (LF) at z ≳ 8. The number of high-z candidates in the parallel field is considerably higher than that in the Abell 2744 parallel field. Our candidates have median stellar masses of log(M{sub ∗})∼8.44{sub −0.31}{sup +0.55} M{sub ⊙}, star formation rates (SFRs) of ∼1.8{sub −0.4}{sup +0.5} M{sub ⊙} yr{sup −1}, and SFR-weighted ages of ≲300{sub −140}{sup +70} Myr. Finally, we are able to put strong constraints on the z = 7, 8, 9, and 10 LFs. One of the objects in the cluster field is a z ≃ 10 candidate, with a magnification of μ ∼ 20 ± 13. This object is likely the faintest z ∼ 10 object known to date, allowing a first look into the extreme faint end (L ∼ 0.04 L*) of the z ∼ 10 LF (It is named “Tayna” in the Aymara language).

79 ASTRONOMY AND ASTROPHYSICS↗

PLATO (Parallel Load Assignment Tool): A Parallel Workload Partitioner for Particle-based Methods

A key first step in many large-scale high-performance scientific computing applications is the distribution of the computational domain across all participating processors of a parallel computing platform such as a shared memory machine, cluster or a tightly-coupled supercomputer. The primary goal of such a partitioning step is to ensure that the computational work performed by each process remains load-balanced throughout the execution of the parallel application. In this project, a general-purpose parallel partitioning tool, code-named PLATO, was designed and implemented. PLATO assumes that the workload is a set of points in an n-dimensional metric space. These points are abstractions of computational units that may represent point-like computational units such as celestial objects in astrophysics, atoms in materials sciences and molecules in biology/chemistry, or may represent more abstract computational units such as grid points in finite difference methods, grid elements in finite element methods or n-dimensional points in the feature space of a host of other applications. PLATO supports several key and useful capabilities, namely: (a) multiple load partitioning strategies, (b) support for arbitrary user-defined processor topology, (c) pre-fetching data from neighboring processors based on user-defined parameters, and (d) support for arbitrary number and types of attributes associated with each point in the computational domain. PLATO is implemented in the C programming language using Message Passing Interface (MPI) for inter-processor communications and its parallel performance tested on up to 48 processors of a shared memory machine. This report includes a detailed performance study of PLATO using parallel speedup and iso-efficiency as the two main metrics of parallel performance. In addition, a user manual and DOXYGEN generated code documentation have been included for completeness.

97 MATHEMATICS AND COMPUTING↗

The GRISM Lens-Amplified Survey from Space (GLASS). I. Survey overview and first data release

We give an overview of the Grism Lens Amplified Survey from Space (GLASS), a large Hubble Space Telescope program aimed at obtaining grism spectroscopy of the fields of 10 massive clusters of galaxies at redshift z = 0.308–0.686, including the Hubble Frontier Fields (HFF). The Wide Field Camera 3 (WFC3) yields near-infrared spectra of the cluster cores covering the wavelength range 0.81–1.69 μm through grisms G102 and G141, while the Advanced Camera for Surveys in parallel mode provides G800L spectra of the infall regions of the clusters. The WFC3 spectra are taken at two almost orthogonal position angles in order to minimize the effects of confusion. After summarizing the scientific drivers of GLASS, we describe the sample selection as well as the observing strategy and data processing pipeline. We then utilize MACS J0717.5+3745, a HFF cluster and the first one observed by GLASS, to illustrate the data quality and the high-level data products. Each spectrum brighter than H{sub AB}=23 is visually inspected by at least two co-authors and a redshift is measured when sufficient information is present in the spectra. Furthermore, we conducted a thorough search for emission lines through all of the GLASS WFC3 spectra with the aim of measuring redshifts for sources with continuum fainter than H{sub AB}=23. We provide a catalog of 139 emission-line-based spectroscopic redshifts for extragalactic sources, including three new redshifts of multiple image systems (one probable, two tentative). In addition to the data itself, we also release software tools that are helpful to navigate the data.

79 ASTRONOMY AND ASTROPHYSICS↗

A Massively Parallel Implementation of the CCSD(T) Method Using the Resolution-of-the-Identity Approximation and a Hybrid Distributed/Shared Memory Parallelization Model

In this work, a parallel algorithm is described for the coupled-cluster singles and doubles method augmented with a perturbative correction for triple excitations [CCSD(T)] using the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs). The algorithm bypasses the storage of four-center ERIs by adopting an integral-direct strategy. The CCSD amplitude equations are given in a compact quasi-linear form by factorizing them in terms of amplitude-dressed three-center intermediates. A hybrid MPI/OpenMP parallelization scheme is employed, which uses the OpenMP-based shared memory model for intranode parallelization and the MPI-based distributed memory model for internode parallelization. Parallel efficiency has been optimized for all terms in the CCSD amplitude equations. Two different algorithms have been implemented for the rate-limiting terms in the CCSD amplitude equations that entail and -scaling computational costs, where N O and N V denote the number of correlated occupied and virtual orbitals, respectively. One of the algorithms assembles the four-center ERIs requiring N V 4 and N O 2 N V 2 -scaling memory costs in a distributed manner on a number of MPI ranks, while the other algorithm completely bypasses the assembling of quartic memory-scaling ERIs and thus largely reduces the memory demand. It is demonstrated that the former memory-expensive algorithm is faster on a few hundred cores, while the latter memory-economic algorithm shows a better strong scaling in the limit of a few thousand cores. The program is shown to exhibit a near-linear scaling, in particular for the compute-intensive triples correction step, on up to 8000 cores. The performance of the program is demonstrated via calculations involving molecules with 24–51 atoms and up to 1624 atomic basis functions. As the first application, the complete basis set (CBS) limit for the interaction energy of the π-stacked uracil dimer from the S66 data set has been investigated. This work reports the first calculation of the interaction energy at the CCSD(T)/aug-cc-pVQZ level without local orbital approximation. The CBS limit for the CCSD correlation contribution to the interaction energy was found to be -8.01 kcal/mol, which agrees very well with the value -7.99 kcal/mol reported by Schmitz, Hättig, and Tew [ Phys. Chem. Chem. Phys. 2014 , 16 , 22167-22178]. The CBS limit for the total interaction energy was estimated to be -9.64 kcal/mol.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel scalability of Hartree–Fock calculations

Quantum chemistry is increasingly performed using large cluster computers consisting of multiple interconnected nodes. For a fixed molecular problem, the efficiency of a calculation usually decreases as more nodes are used, due to the cost of communication between the nodes. This paper empirically investigates the parallel scalability of Hartree–Fock calculations. The construction of the Fock matrix and the density matrix calculation are analyzed separately. For the former, we use a parallelization of Fock matrix construction based on a static partitioning of work followed by a work stealing phase. For the latter, we use density matrix purification from the linear scaling methods literature, but without using sparsity. When using large numbers of nodes for moderately sized problems, density matrix computations are network-bandwidth bound, making purification methods potentially faster than eigendecomposition methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗

Understanding irradiation growth through atomistic simulations: Defect diffusion and clustering in α-zirconium and the influence of alloying elements - 2016-0093

Irradiation-induced structural changes of α-zirconium alloys and in particular the effect of iron were investigated by molecular dynamics simulations using embedded atom potentials derived from first-principles calculations. The simulations revealed that at temperatures between 500 and 600 K self-interstitial atoms (SIAs) diffuse rapidly in a cooperative movement, preferably parallel to basal planes (a directions; ), forming nano-clusters with an extension in and . Vacancies diffuse more slowly than SIAs and remain isolated for a longer period of time. Nano-clusters associated with SIAs cause a pronounced overall expansion in a directions, as well as local strains. Under compressive strain in the c direction, vacancy diffusivity increases in the c direction. In contrast, the diffusivity of SIAs increases in the c direction under a tensile strain in the c direction. SIA nano-clusters are highly mobile within basal planes. Vacancy clusters grow by merging, leading to a contraction in the a direction, compensating for the expansion caused by SIA nano-clusters and possibly contributing to the plateau in growth after the initial rapid expansion. At the onset of breakaway growth, possibly due to stress buildup, the vacancy nano-clusters can condense into c loops, thereby diminishing the compensation effect. The alloying elements iron, nickel, chromium, and niobium liberated from secondary phase particles under irradiation or already in solution are attracted to vacancies and SIAs and are found inside vacancy and SIA loops. The interaction of alloying elements with defect clusters is discussed, with a particular focus on iron. Iron has been found to promote cluster formation in zirconium, and the structures of zirconium-iron clusters have been analyzed. Tin is repelled by SIA clusters and only weakly attracted by vacancies. Niobium impedes the diffusion of SIAs (and therefore may increase annihilation rates with nearby vacancies) and does not destabilize vacancy or SIA clusters. Ab initio calculations of the dimensional and elastic coefficients of the intermetallic phases occurring in secondary phase particles, such as Zr{sub 2}Fe and Zr{sub 3}Fe, are presented, allowing an assessment of local strains in a zirconium matrix. Thus, novel results from extended molecular dynamics simulations provide new insights and contribute to a deeper understanding of the complex mechanisms causing irradiation-induced dimensional changes and the breakaway growth of zirconium alloys. (authors)

36 MATERIALS SCIENCE↗

Fast Fault Injection and Sensitivity Analysis for Collective Communications, In: 2015 IEEE International Conference on Cluster Computing

The collective communication operations, which are widely used in parallel applications for global communication and synchronization are critical for application's performance and scalability. However, how faulty collective communications impact the application and how errors propagate between the application processes is largely unexplored. One of the critical reasons for this situation is the lack of fast evaluation method to investigate the impacts of faulty collective operations. The traditional random fault injection methods relying on a large amount of fault injection tests to ensure statistical significance require a significant amount of resources and time. These methods result in prohibitive evaluation cost when applied to the collectives. In this paper, we introduce a novel tool named Fast Fault Injection and Sensitivity Analysis Tool (FastFIT) to conduct fast fault injection and characterize the application sensitivity to faulty collectives. The tool achieves fast exploration by reducing the exploration space and predicting the application sensitivity using Machine Learning (ML) techniques. A basis for these techniques are implicit correlations between MPI semantics, application context, critical application features, and application responses to faulty collective communications. The experimental results show that our approach reduces the fault injection points and tests by 97% for representative benchmarks (NAS Parallel Benchmarks (NPB)) and a realistic application (Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS)) on a production supercomputer. Further, we statistically generalize the application sensitivity to faulty collective communications for these workloads, and present correlation between application features and the sensitivity.

Computer Science↗