Search NASA⌕ Search

SEARCH · Search NASA

Results for “Application”

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 1,045 records · Page 58

Parameterized Micro-benchmarking: An Auto-tuning Approach for Complex Applications

Auto-tuning has emerged as an important practical method for creating highly optimized implementations of key computational kernels and applications. However, the growing complexity of architectures and applications is creating new challenges for auto-tuning. Complex applications can involve a prohibitively large search space that precludes empirical auto-tuning. Similarly, architectures are becoming increasingly complicated, making it hard to model performance. In this paper, we focus on the challenge to auto-tuning presented by applications with a large number of kernels and kernel instantiations. While these kernels may share a somewhat similar pattern, they differ considerably in problem sizes and the exact computation performed. We propose and evaluate a new approach to auto-tuning which we refer to as parameterized micro-benchmarking. It is an alternative to the two existing classes of approaches to auto-tuning: analytical model-based and empirical search-based. Particularly, we argue that the former may not be able to capture all the architectural features that impact performance, whereas the latter might be too expensive for an application that has several different kernels. In our approach, different expressions in the application, different possible implementations of each expression, and the key architectural features, are used to derive a simple micro-benchmark and a small parameter space. This allows us to learn the most significant features of the architecture that can impact the choice of implementation for each kernel. We have evaluated our approach in the context of GPU implementations of tensor contraction expressions encountered in excited state calculations in quantum chemistry. We have focused on two aspects of GPUs that affect tensor contraction execution: memory access patterns and kernel consolidation. Using our parameterized micro-benchmarking approach, we obtain a speedup of up to 2 over the version that used default optimizations, but no auto-tuning. We demonstrate that observations made from microbenchmarks match the behavior seen from real expressions. In the process, we make important observations about the memory hierarchy of two of the most recent NVIDIA GPUs, which can be used in other optimization frameworks as well.

auto-tuning↗

Improving concurrency and asynchrony in multithreaded MPI applications using software offloading

We present a new approach for multithreaded communication and asynchronous progress in MPI applications, wherein we offload communication processing to a dedicated thread. The central premise is that given the rapidly increasing core counts on modern systems, the improvements in MPI performance arising from dedicating a thread to drive communication outweigh the small loss of resources for application computation, particularly when overlap of communication and computation can be exploited. Our approach allows application threads to make MPI calls concurrently, enqueuing these as communication tasks to be processed by a dedicated communication thread. This not only guarantees progress for such communication operations, but also reduces load imbalance. Our implementation additionally significantly reduces the overhead of mutual exclusion seen in existing implementations for applications using MPI THREAD MULTIPLE. Our technique requires no modification to the application, and we demonstrate significant performance improvement (up to 2X) for QCD, 1-D FFT and deep learning CNN applications.

Vaidyanathan, Karthikeyan↗

LADR: low-cost application-level detector for reducing silent output corruptions

Applications running on future high performance computing (HPC) systems are more likely to experience transient faults due to technology scaling trends with respect to higher circuit density, smaller transistor size and near-threshold voltage (NTV) operations. A transient fault could corrupt application state without warning, possibly leading to incorrect application output. Such errors are called silent data corruptions (SDCs). In this paper, we present LADR, a low-cost application-level SDC detector for scientific applications. LADR protects scientific applications from SDCs by watching for data anomalies in their state variables (those of scientific interest). It employs compile-time data-flow analysis to minimize the number of monitored variables, thereby reducing runtime and memory overheads while maintaining a high level of fault coverage with low false positive rates. We evaluated LADR with 4 scientific workloads and results show that LADR achieved < 80% fault coverage with only ∼ 3% runtime overheads and ∼ 1% memory overheads. As compared to prior state-of-the-art anomaly-based detection methods, SDC achieved comparable or improved fault coverage, but reduced runtime overheads by 21% ∼ 75%, and memory overheads by 35% ∼ 55% for the evaluated workloads. We believe that such an approach with low memory and runtime overheads coupled with attractive detection precision makes LADR a viable approach for assuring the correct output from large-scale high performance simulations.

Chen, Chao↗

Auto-HPCnet: An Automatic Framework to Build Neural Network-based Surrogate for High-Performance Computing Applications

High-performance computing communities are increasingly adopt- ing Neural Networks (NN) as surrogate models in their applications to generate scientific insights. Replacing an execution phase in the application with NN models can bring significant performance im- provement. However, there is a lack of tools that can help domain scientists automatically apply NN-based surrogate models to HPC applications. We introduce a framework, named Auto-HPCnet, to democratize the usage of NN-based surrogates. Auto-HPCnet is the first end-to-end framework that makes past proposals for the NN-based surrogate model practical and disciplined. Auto-HPCnet introduces a workflow to address unique challenges when apply- ing the approximation, such as feature acquisition and meeting the application-specific constraint on the quality of final computation outcome. We show that Auto-HPCnet can leverage NN for a set of HPC applications and achieve 5.50× speedup on average (up to 16.8× speedup and with data preparation cost included) while meeting the application-specific constraint on the final computation quality.

Dong, Wenqian↗

Optimizing Communication in 2D Grid-Based MPI Applications at Exascale

The new reality of exascale computing faces many challenges in achieving optimal performance on large numbers of nodes. A key challenge is the efficient utilization of the message-passing interface (MPI), a critical component for process communication. This paper explores communication optimization strategies to harness the GPU-accelerated architectures of these supercomputers. We focus on MPI applications where processors form a two-dimensional process grid, a common arrangement in applications involving dense matrix operations. This configuration offers a unique opportunity to implement innovative strategies to improve performance and maintain effective load distribution. We study two applications— Dist-FW (Apsp:all-pair-shortest-path) and HPL-MxP (LU factorization with Mixed precision)—on two accelerated systems: Summit (IBM Power and NVIDIA V100) and Frontier (AMD EPYC and MI250X). These supercomputers are operated by the Oak Ridge Leadership Computing Facility (OLCF) and are currently ranked #1 and #5 on the Top500 list. We show how to scale up both applications to exascale levels and tackle the MPI challenges related to implementation, synchronization, and performance. We also compare the performance of several communication strategies at an unprecedented scale. Accurately predicting application performance becomes crucial for cost reduction as the computational scale grows. To address this, we suggest a hyperbolic model as a better alternative to the traditional one-sided asymptotic model for predicting future application performance at such large scales.

Lu, Hao↗

Towards Seamless Interoperability of MPI-OpenMP Applications

A chasm exists between mathematical software libraries written for MPI-based applications and those written for OpenMP applications. Recently, however, PETSc enables the simple use of its MPI-based linear solvers from OpenMP applications. Separately, the MPICH MPI development team has started a new project to allow almost seamless MPI use in OpenMP applications. Both proposed approaches would result in a similar user experience. Here, we discuss the reasons for these projects and their potential for providing more numerical library choices for OpenMP applications, including the unlimited assortment of linear solvers available in PETSc. In addition, we present the performance of an application using the first approach, demonstrating its efficacy.

MPI↗

Umpire: Application-Focused Management and Coordination of Complex Hierarchical Memory

Advanced architectures like Sierra provide a wide range of memory resources that must often be carefully controlled by the user. These resources have varying capacities, access timing rules, and visibility to different compute resources. Applications must intelligently allocate data in these spaces, and depending on the total amount of memory required, applications may also be forced to move data between different parts of the memory hierarchy. Finally, applications using multiple packages must coordinate effectively to ensure that each package can use the memory resources it needs. To address these challenges, we present Umpire, an application-oriented library for managing memory resources. Specifically, Umpire provides support for querying memory resources, provisioning and allocating memory, and memory introspection. It allows computer scientists and computational physicists to efficiently program the memory hierarchies of current and future high-performance computing architectures, without tying their application to specific hardware or software. In this paper, we describe the design and implementation of Umpire and present case studies from the integration of Umpire into applications that are currently running on Sierra.

97 MATHEMATICS AND COMPUTING↗

[Retracted] Research on Application Experience Design of Ice and Snow Sports Equipment Based on Bee Colony Model

Sports equipment is the key to the smooth development of ice and snow sports. With the rapid development of social economy and the improvement of people’s living standards, the demand for ice and snow sports equipment is increasing day by day. This article presents an improved method based on the chaos theory and the bee colony algorithm to quantify the application experience design of ice and snow sports equipment and reduce the influence of uncertain factors on the design results. First, the chaos theory can establish the dataset of application experience design and analyze the discreteness of the set. According to the bee colony algorithm, the dataset is divided into several groups, and each group obtains the best application experience design by using the design optimization strategy. Finally, the results are mixed to obtain the final experience design results. Through MATLAB simulation analysis and verification, the improved bee colony model can improve the accuracy of application experience design of ice and snow sports equipment in an uncertain environment, shorten the overall design time, and meet the requirements of application experience design of different ice and snow sports equipment. Therefore, the model proposed in this paper is suitable for the application experience design of ice and snow sports equipment.

Li, Yuanjing (ORCID:000000018276647X)↗

General Applications for Hamilton Vantage (GenApps for Vantage) v0.6.1

General applications for Hamilton Vantage is a flexible liquid handling method used to automate the most widely applicable types of automated liquid transfers. General applications can also be used as a tool to onboard new fully-automated workflows by breaking them down step by step into single transfers. The goal of General Applications is to make using the Hamilton Vantage liquid handler as easy & practical as using a handheld pipette for the end user. The software supports plate-to-plate transfers for a variety of method types including: Stamp: One-to-One, Stamp: One-To-Many, Split, Combine, Hitpick, and Qtray plating. General Applications eliminates the need for automation engineers to customize individual methods for each new workflow that gets onboarded. Steps can be customized within GenApps according to the needs of the researcher. The software utilizes a GUI to prompt the users to input variables – Allowing for flexible control over plate types, transfer volumes, number of replicates, tip types, liquid classes, mixing steps, aspiration/dispense heights and more. General Applications also generates a deck image and setup instructions to guide the researcher on how to load the deck and start the instrument.

Yoder, Sam↗

PoPLAR: Portal for Petascale Lifescience Applications and Research

Background: We are focusing specifically on fast data analysis and retrieval in bioinformatics that will have a direct impact on the quality of human health and the environment. The exponential growth of data generated in biology research, from small atoms to big ecosystems, necessitates an increasingly large computational component to perform analyses. Novel DNA sequencing technologies and complementary high-throughput approaches–such as proteomics, genomics, metabolomics, and meta-genomics–drive data-intensive bioinformatics. While individual research centers or universities could once provide for these applications, this is no longer the case. Today, only specialized national centers can deliver the level of computing resources required to meet the challenges posed by rapid data growth and the resulting computational demand. Consequently, we are developing massively parallel applications to analyze the growing flood of biological data and contribute to the rapid discovery of novel knowledge. Methods: The efforts of previous National Science Foundation (NSF) projects provided for the generation of parallel modules for widely used bioinformatics applications on the Kraken supercomputer. We have profiled and optimized the code of some of the scientific community’s most widely used desktop and small-cluster-based applications, including BLAST from the National Center for Biotechnology Information (NCBI), HMMER, and MUSCLE; scaled them to tens of thousands of cores on high-performance computing (HPC) architectures; made them robust and portable to next-generation architectures; and incorporated these parallel applications in science gateways with a web-based portal. Results: This paper will discuss the various developmental stages, challenges, and solutions involved in taking bioinformatics applications from the desktop to petascale with a front-end portal for very-large-scale data analysis in the life sciences. Conclusions: This research will help to bridge the gap between the rate of data generation and the speed at which scientists can study this data. The ability to rapidly analyze data at such a large scale is having a significant, direct impact on science achieved by collaborators who are currently using these tools on supercomputers.

59 BASIC BIOLOGICAL SCIENCES↗

WELLS Interactive Application

The Wellbore Exploration and Location Logistic System (WELLS) Interactive Application is an interactive tool to enable easy exploration and visualization of the living national wellbore database (WELLS Database (https://edx.netl.doe.gov/dataset/wells_database)). The tool and underlying database were created and are maintained by the National Energy Technology Laboratory (NETL), providing visualization of the more than six million public wellbore records from more than 65 authoritative state, federal, and tribal resources. The WELLS Interactive Application serves up wellbore data from oil, gas, underground injection, research, geothermal, geotechnical, groundwater, and other types of wells in a single, standardized, unified system. In addition to the surface location of these wells, the underlying database combines select key attributes for features such as well age, depth, and operating status. The system also provides users with references back to the original sources used in this unified platform. The underlying data can be accessed through the WELLS Database: https://edx.netl.doe.gov/dataset/wells_database Additional Information: The WELLS Interactive Application (formerly titled CO2-Locate) enables visualization and access to the public wellbore records through an intuitive web-based mapping tool. The WELLS Interactive Application was designed to help users visualize, query, analyze, and download wellbore records. Public wellbore points are included as a layer in the Map page, called Public Wells. Additionally, a multivariate hexagon grid summarizing well density from proprietary well data, called Well Density, is included to identify data gaps between the public and proprietary well data. Filtering functionalities in the tool allow these two layers to be spatially filtered by state, county, or basin as well as by status, type, true vertical depth, and spud year. The WELLS Interactive Application also contains a Near Me tool can be used to search and explore wellbore data within a user-defined distance of a specified location on the map, which can also be downloaded. The Query tool allows users to query the selected or filtered wells in the Public Wells layer and export the data. For additional information on these tool functionalities, see the help documentation on the About page of the tool. Notes for Consideration: The Well Density layer provided in this application is derived from proprietary wellbore data, the records of which do not always contain values for key features (status, type, true vertical depth, or spud year). Therefore, data might not be available when layers are queried for all filter combinations. Additionally, visualizing layers and applying filters may take additional time to load (i.e., draw on the map) due to the large size of the data.

ccs↗

HTGR Application Economic Model Users' Manual

The High Temperature Gas-Cooled Reactor (HTGR) Application Economic Model was developed at the Idaho National Laboratory for the Next Generation Nuclear Plant Project. The HTGR Application Economic Model calculates either the required selling price of power and/or heat for a given internal rate of return (IRR) or the IRR for power and/or heat being sold at the market price. The user can generate these economic results for a range of reactor outlet temperatures; with and without power cycles, including either a Brayton or Rankine cycle; for the demonstration plant, first of a kind, or nth of a kind project phases; for up to 16 reactor modules; and for module ratings of 200, 350, or 600 MWt. This users manual contains the mathematical models and operating instructions for the HTGR Application Economic Model. Instructions, screenshots, and examples are provided to guide the user through the HTGR Application Economic Model. This model was designed for users who are familiar with the HTGR design and Excel and engineering economics. Modification of the HTGR Application Economic Model should only be performed by users familiar with the HTGR and its applications, Excel, and Visual Basic.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Modular Power Converters for PV Applications

This report describes technical opportunities to serve as parts of a technological roadmap for Shoals Technologies Group in power electronics for PV applications. There are many different power converter circuits that can be used for solar inverter applications. The present applications do not take advantage of the potential for using common modules. We envision that the development of a power electronics module could enable higher reliability by being durable and flexible. Modules would have fault current limiting features and detection circuits such that they can limit the current through the module from external faults and can identify and isolate internal faults such that the remaining modules can continue to operate with only minimal disturbance to the utility or customer. Development of a reliable, efficient, low-cost, power electronics module will be a key enabling technology for harnessing more power from solar panels and enable plug and play operation. Power electronics for computer power supplies, communication equipment, and transportation have all targeted reliability and modularity as key requirements and have begun concerted efforts to replace monolithic components with collections of common smart modules. This is happening on several levels including (1) device level with intelligent control, (2) functional module level, and (3) system module. This same effort is needed in power electronics for solar applications. Development of modular units will result in standard power electronic converters that will have a lower installed and operating cost for the overall system. These units will lead to increased adaptability and flexibility of solar inverters. Incorporating autonomous fault current limiting and reconfiguration capabilities into the modules and having redundant modules will lead to a durable converter that can withstand the rigors of solar power generation for more than 30 years. Our vision for the technology roadmap is that there is no need for detailed design of new power converters for each new application or installation. One set of modules and controllers can be pre-developed and the only design question would be how many modules need to be in series or parallel for the specific power requirement. Then, a designer can put the modules together and add the intelligent reconfigurable controller. The controller determines how many modules are connected, but it might also ask for user input for the specific application during setup. The modules include protection against faults and can reset it, if necessary. In case of a power device failure, the controller reconfigures itself to continue limited operation until repair which might be as simple as taking the faulty module out and inserting a new module. The result is cost savings in design, maintenance, repair, and a grid that is more reliable and available. This concept would be a perfect fit for the recently announced funding opportunity announcement (DE-FOA-0000653) on Plug and Play Photovoltaics.

14 SOLAR ENERGY↗

Collaborative Research: Continuous Dynamic Grid Adaptation in a Global Atmospheric Model - Application and Refinement

This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the "physics" of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited. 3a. EULAG Advances EULAG is a non-hydrostatic, parallel computational model for all-scale geophysical flows. EULAG's name derives from its two computational options: EULerian (flux form) or semi-LAGrangian (advective form). The model combines nonoscillatory forward-in-time (NFT) numerical algorithms with a robust elliptic Krylov solver. A signature feature of EULAG is that it is formulated in generalized time-dependent curvilinear coordinates. In particular, this enables grid adaptivity. In total, these features give EULAG novel advantages over many existing dynamical cores. For EULAG itself, numerical advances included refining boundary conditions and filters for optimizing model performance in polar regions. We also added flexibility to the model's underlying formulation, allowing it to work with the pseudo-compressible equation set of Durran in addition to EULAG's standard anelastic formulation. Work in collaboration with others also extended the demonstrated range of validity of soundproof models, showing that they are more broadly applicable than some had previously thought. Substantial testing of EULAG included application and extension of the Jablonowski-Williamson baroclinic wave test - an archetype of planetary weather - and further analysis of multi-scale interactions arising from collapse of temperature fronts in both the baroclinic wave test and simulations of the Held-Suarez idealized climate. These analyses revealed properties of atmospheric gravity waves not seen in previous work and further demonstrated the ability of EULAG to simulate realistic behavior over several orders of magnitude of length scales. Additional collaborative work enhanced capability for modeling atmospheric flows with adaptive moving meshes and demonstrated the ability of EULAG to move into petascale computing. 3b. CAM-EULAG Advances We have developed CAM-EULAG in collaboration with former project postdoc, now University of Cape Town Assistant Professor, Babatunde Abiodun. Initial study documented good model performance in aqua-planet simulations. In particular, we showed that the grid adaptivity (stretching) implemented in CAM-EULAG allows higher resolution in selected regions without causing anomalous behavior such as spurious wave reflection. We then used the stretched-grid version to analyze simulated extreme precipitation events in West Africa, comparing the precipitation and event environment with observed behavior. The model simulates fairly well the spatial scale and the interannual and intraseasonal variability of the extreme events, although its extreme precipitation intensity is weaker than observed. In addition, both observations and the simulations show possible forcing of extreme events by African easterly waves. 3c. Other Contributions Through our collaborations, we have made contributions to a wide range of outcomes. For research focused on terrestrial behavior, these have included (1) upwind schemes for gas dynamics, (2) a nonlinear perspective on the dynamics of the Madden-Julian Oscillation, (3) numerical realism of thermal convection, (4) extreme precipitation processes, (5) unstructured meshes, (6) porous-media analogies for simulating flow in urban environments, (7) Monge-Ampere enhancements of semi-Lagrangian methods and (8) further extensions of the generality of EULAG applications to geophysical problems. The generality of EULAG for multi-scale flow was also demonstrated through solar applications. Simulations of solar magnetohydrodynamics showed that EULAG produces the solar cycle fairly well. Although the model's solar cycle is significantly longer than observed, it shows remarkable agreement with observations in features of spatial evolution. These efforts in environments that are extreme from a geophysical perspective have helped to establish the robustness of EULAG as an all-scale code for geophysical applications.

54 ENVIRONMENTAL SCIENCES↗

Active Measurement of the Impact of Network SwitchUtilization on Application Performance

Inter-node networks are a key capability of High-Performance Computing (HPC) systems that differentiates them from less capable classes of machines. However, in spite of their very high performance, the increasing computational power of HPC compute nodes and the associated rise in application communication needs make network performance a common performance bottleneck. To achieve high performance in spite of network limitations application developers require tools to measure their applications’ network utilization and inform them about how the network’s communication capacity relates to the performance of their applications. This paper presents a new performance measurement and analysis methodology based on empirical measurements of network behavior. Our approach uses two benchmarks that inject extra network communication. The first probes the fraction of the network that is utilized by a software component (an application or an individual task) to determine the existence and severity of network contention. The second aggressively injects network traffic while a software component runs to evaluate its performance on less capable networks or when it shares the network with other software components. We then combine the information from the two types of experiment to predict the performance slowdown experienced by multiple software components (e.g. multiple processes of a single MPI application) when they share a single network. Our methodology is applied to individual network switches and demonstrated on two real systems with different types of switches and compute node architectures.

97 MATHEMATICS AND COMPUTING↗

Integrating Fault-Tolerance into the Monte Carlo Application Toolkit

High-performance computer systems have passed the petascale mark, and the next decade will witness a drive towards exascale systems. Extrapolating from current hardware trends it is evident that exascale class systems will require a significantly larger number of cores than current petascale systems, and advanced architectures which include heterogeneous processors are gaining popularity. Such an increase in component count will decrease system mean time to interrupt (MTTI), resulting in greater emphasis on application fault tolerance. The additional memory requirements of exascale systems combined with the slow increase in hard drive write bandwidth will exclude current checkpoint/restart (C/R) techniques as a reliable means of fault tolerance. The current C/R approach to handling failures typically aborts the entire application and requires restarting the application, which is clearly an inefficient solution when utilizing 1000+ processors. Unless improvements are made in resilience and fault tolerance, it is predicted that the work throughput on the largest supercomputers could drop below 10% by 2015. As part of the ”Application Enablement for Next Generation Platforms” milestone, we addressed the shortcomings and limitations of C/R by developing a fault-tolerant component which would be integrated into the Monte Carlo Application Toolkit (MCATK) and demonstrated the ability to continue static K-effective calculations even in the presence of multiple processor failures. In section 2, we provide details about the milestone tasks. Section 3 describes the fault-tolerant framework, its integration into MCATK and its failure recovery scheme. We also describe FT-MPI, a fault-tolerant MPI implementation which provides the capabilities needed for an MPI-based application to survive and continue past failures. Section 4 reports future work that we hope to build upon the current accomplishments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Recycled water reuse permit renewal application for the materials and fuels complex industrial waste ditch and industrial waste pond

This renewal application for the Industrial Wastewater Reuse Permit (IWRP) WRU-I-0160-01 at Idaho National Laboratory (INL), Materials and Fuels Complex (MFC) Industrial Waste Ditch (IWD) and Industrial Waste Pond (IWP) is being submitted to the State of Idaho, Department of Environmental Quality (DEQ). This application has been prepared in compliance with the requirements in IDAPA 58.01.17, Recycled Water Rules . Information in this application is consistent with the IDAPA 58.01.17 rules, pre-application meeting, and the Guidance for Reclamation and Reuse of Municipal and Industrial Wastewater (September 2007). This application is being submitted using much of the same information contained in the initial permit application, submitted in 2007, and modification, in 2012. There have been no significant changes to the information and operations covered in the existing IWRP. Summary of the monitoring results and operation activity that has occurred since the issuance of the WRP has been included. MFC has operated the IWP and IWD as regulated wastewater land treatment facilities in compliance with the IDAPA 58.01.17 regulations and the IWRP. Industrial wastewater, consisting primarily of continuous discharges of nonhazardous, nonradioactive, routinely discharged noncontact cooling water and steam condensate, periodic discharges of industrial wastewater from the MFC facility process holdup tanks, and precipitation runoff, are discharged to the IWP and IWD system from various MFC facilities. Wastewater goes to the IWP and IWD with a permitted annual flow of up to 17 million gallons/year. All requirements of the IWRP are being met. The Operations and Maintenance Manual for the Industrial Wastewater System will be updated to include any new requirements.

99 GENERAL AND MISCELLANEOUS↗

Detecting Silent Data Corruption for Extreme-Scale Applications through Data Mining

Supercomputers allow scientists to study natural phenomena by means of computer simulations. Next-generation machines are expected to have more components and, at the same time, consume several times less energy per operation. These trends are pushing supercomputer construction to the limits of miniaturization and energy-saving strategies. Consequently, the number of soft errors is expected to increase dramatically in the coming years. While mechanisms are in place to correct or at least detect some soft errors, a significant percentage of those errors pass unnoticed by the hardware. Such silent errors are extremely damaging because they can make applications silently produce wrong results. In this work we propose a technique that leverages certain properties of high-performance computing applications in order to detect silent errors at the application level. Our technique detects corruption solely based on the behavior of the application datasets and is completely application-agnostic. We propose multiple corruption detectors, and we couple them to work together in a fashion transparent to the user. We demonstrate that this strategy can detect the majority of the corruptions, while incurring negligible overhead. We show that with the help of these detectors, applications can have up to 80% of coverage against data corruption.

97 MATHEMATICS AND COMPUTING↗