Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing applications”

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 487 records · Page 27

Autonomic Management of Application Workflows on Hybrid Computing Infrastructure

In this paper, we present a programming and runtime framework that enables the autonomic management of complex application workflows on hybrid computing infrastructures. The framework is designed to address system and application heterogeneity and dynamics to ensure that application objectives and constraints are satisfied. The need for such autonomic system and application management is becoming critical as computing infrastructures become increasingly heterogeneous, integrating different classes of resources from high-end HPC systems to commodity clusters and clouds. For example, the framework presented in this paper can be used to provision the appropriate mix of resources based on application requirements and constraints. The framework also monitors the system/application state and adapts the application and/or resources to respond to changing requirements or environment. To demonstrate the operation of the framework and to evaluate its ability, we employ a workflow used to characterize an oil reservoir executing on a hybrid infrastructure composed of TeraGrid nodes and Amazon EC2 instances of various types. Specifically, we show how different applications objectives such as acceleration, conservation and resilience can be effectively achieved while satisfying deadline and budget constraints, using an appropriate mix of dynamically provisioned resources. Our evaluations also demonstrate that public clouds can be used to complement and reinforce the scheduling and usage of traditional high performance computing infrastructure.

Kim, Hyunjoo↗

A layered 2D computational framework: Theory and applications to nuclear fuel behavior

Nuclear fuel performance computer codes have been developed over the last 50 years to analyze fuel behavior under various operating conditions. Traditionally, these codes used quasi-two-dimensional (also commonly known as 1.5D) representations of the fuel rod, which model the rod using a set of one-dimensional axisymmetric models that represent the behavior at specific axial positions on the rod. Modern fuel performance codes have the ability to investigate full three-dimensional (3D) effects and couple to other physics-based codes for true multiphysics simulations. However, with increasing complexity comes increasing computational costs. Many phenomena of interest involve azimuthally-varying behavior that cannot be represented using the aforementioned quasi-two-dimensional approach, but do not require the use of a full 3D model. To efficiently address these problems, there is a need for a computational framework that provides a compromise between the quasi-two-dimensional and full 3D models. In this paper, we present a new quasi-three-dimensional approach that represents the fuel as a set of 2D planar models that represent the behavior of the fuel cross-section at various axial positions. Presented here are the theory behind the methodology, test cases to illustrate proper implementation, and practical applications of its use in the BISON fuel performance code for a variety of cases in nuclear fuel analysis, such as fuel fracture, axial fuel relocation, and cladding distension and oxidation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Using architecture information and real-time resource state to reduce power consumption and communication costs in parallel applications.

As computer systems grow in both size and complexity, the need for applications and run-time systems to adjust to their dynamic environment also grows. The goal of the RAAMP LDRD was to combine static architecture information and real-time system state with algorithms to conserve power, reduce communication costs, and avoid network contention. We devel- oped new data collection and aggregation tools to extract static hardware information (e.g., node/core hierarchy, network routing) as well as real-time performance data (e.g., CPU uti- lization, power consumption, memory bandwidth saturation, percentage of used bandwidth, number of network stalls). We created application interfaces that allowed this data to be used easily by algorithms. Finally, we demonstrated the benefit of integrating system and application information for two use cases. The first used real-time power consumption and memory bandwidth saturation data to throttle concurrency to save power without increasing application execution time. The second used static or real-time network traffic information to reduce or avoid network congestion by remapping MPI tasks to allocated processors. Results from our work are summarized in this report; more details are available in our publications [2, 6, 14, 16, 22, 29, 38, 44, 51, 54].

Brandt, James M.↗

Event heap: a coordination infrastructure for dynamic heterogeneous application interactions in ubiquitous computing environments

An efficient and adaptive middleware infrastructure called the Event Heap system dynamically coordinates application interactions and communications in a ubiquitous computing environment, e.g., an interactive workspace, having heterogeneous software applications running on various machines and devices across different platforms. Applications exchange events via the Event Heap. Each event is characterized by a set of unordered, named fields. Events are routed by matching certain attributes in the fields. The source and target versions of each field are automatically set when an event is posted or used as a template. The Event Heap system implements a unique combination of features, both intrinsic to tuplespaces and specific to the Event Heap, including content based addressing, support for routing patterns, standard routing fields, limited data persistence, query persistence/registration, transparent communication, self-description, flexible typing, logical/physical centralization, portable client API, at most once per source first-in-first-out ordering, and modular restartability.

97 MATHEMATICS AND COMPUTING↗

Reducing power consumption during execution of an application on a plurality of compute nodes

Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: executing, by each compute node, an application, the application including power consumption directives corresponding to one or more portions of the application; identifying, by each compute node, the power consumption directives included within the application during execution of the portions of the application corresponding to those identified power consumption directives; and reducing power, by each compute node, to one or more components of that compute node according to the identified power consumption directives during execution of the portions of the application corresponding to those identified power consumption directives.

97 MATHEMATICS AND COMPUTING↗

Data communications in a parallel active messaging interface of a parallel computer

Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer composed of compute nodes that execute a parallel application, each compute node including application processors that execute the parallel application and at least one management processor dedicated to gathering information regarding data communications. The PAMI is composed of data communications endpoints, each endpoint composed of a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources. Embodiments function by gathering call site statistics describing data communications resulting from execution of data communications instructions and identifying in dependence upon the call cite statistics a data communications algorithm for use in executing a data communications instruction at a call site in the parallel application.

97 MATHEMATICS AND COMPUTING↗

Applications in Data-Intensive Computing

This book chapter, to be published in Advances in Computers, Volume 78, in 2010 describes applications of data intensive computing (DIC). This is an invited chapter resulting from a previous publication on DIC. This work summarizes efforts coming out of the PNNL's Data Intensive Computing Initiative. Advances in technology have empowered individuals with the ability to generate digital content with mouse clicks and voice commands. Digital pictures, emails, text messages, home videos, audio, and webpages are common examples of digital content that are generated on a regular basis. Data intensive computing facilitates human understanding of complex problems. Data-intensive applications provide timely and meaningful analytical results in response to exponentially growing data complexity and associated analysis requirements through the development of new classes of software, algorithms, and hardware.

99 GENERAL AND MISCELLANEOUS↗

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A semidefinite program solver for the conformal bootstrap

We introduce SDPB: an open-source, parallelized, arbitrary-precision semidefinite program solver, designed for the conformal bootstrap. SDPB significantly outperforms less specialized solvers and should enable many new computations. As an example application, we compute a new rigorous high-precision bound on operator dimensions in the 3d Ising CFT, Δ σ = 0.518151(6), Δ ϵ = 1.41264(6).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A sharp interface Lagrangian-Eulerian method for rigid-body fluid-structure interaction

Herein this paper introduces a sharp interface method to simulate fluid-structure interaction (FSI) involving rigid bodies immersed in viscous incompressible fluids. The capabilities of this methodology are benchmarked using a range of test cases and demonstrated using large-scale models of biomedical FSI. The numerical approach developed herein, which we refer to as an immersed Lagrangian-Eulerian (ILE) method, integrates aspects of partitioned and immersed FSI formulations by solving separate momentum equations for the fluid and solid subdomains, as in a partitioned formulation, while also using non-conforming discretizations of the dynamic fluid and structure regions, as in an immersed formulation. A simple Dirichlet-Neumann coupling scheme is used, in which the motion of the immersed solid is driven by fluid traction forces evaluated along the fluid-structure interface, and the motion of the fluid along that interface is constrained to match the solid velocity and thereby satisfy the no-slip condition. To develop a practical numerical method, we adopt a penalty approach that approximately imposes the no-slip condition along the fluid-structure interface. In the coupling strategy, a separate discretization of the fluid-structure interface is tethered to the volumetric solid mesh via stiff spring-like penalty forces. Our fluid-structure coupling scheme relies on an immersed interface method (IIM) for discrete geometries, which enables the accurate determination of both velocities and stresses along complex internal interfaces. Numerical methods for FSI can suffer from instabilities related to the added mass effect, but computational tests indicate that the methodology introduced here remains stable for selected test cases across a broad range of solid-fluid mass density ratios, including extremely small, nearly equal, equal, and large density ratios. Biomedical FSI demonstration cases include results obtained using this method to simulate the dynamics of a bileaflet mechanical heart valve in a pulse duplicator, and to model transport of blood clots in a patient-averaged anatomical model of the inferior vena cava.

97 MATHEMATICS AND COMPUTING↗

Visualizing Twenty Years of Applications

This issue of IEEE Computer Graphics and Applications marks the 20th anniversary of the Applications department as a regular feature of the magazine. We thought it might be interesting to look back at the 20 years of Applications department articles to assess its evolution over that time. By aggregating all twenty years of articles and applying a little statistical and visual analytics, we’ve uncovered some interesting characteristics and trends we thought we’d share to mark this 20 year milestone.

Applications↗

Locality Aware Concurrent Start for Stencil Applications

Stencil computations are at the heart of many physical simulations used in scientific codes. Thus, there exists a plethora of optimization efforts for this family of computations. Among these techniques, tiling techniques that allow concurrent start have proven to be very efficient in providing better performance for these critical kernels. Nevertheless, with many core designs being the norm, these optimization techniques might not be able to fully exploit locality (both spatial and temporal) on multiple levels of the memory hierarchy without compromising parallelism. It is no longer true that the machine can be seen as a homogeneous collection of nodes with caches, main memory and an interconnect network. New architectural designs exhibit complex grouping of nodes, cores, threads, caches and memory connected by an ever evolving network-on-chip design. These new designs may benefit greatly from carefully crafted schedules and groupings that encourage parallel actors (i.e. threads, cores or nodes) to be aware of the computational history of other actors in close proximity. In this paper, we provide an efficient tiling technique that allows hierarchical concurrent start for memory hierarchy aware tile groups. Each execution schedule and tile shape exploit the available parallelism, load balance and locality present in the given applications. We demonstrate our technique on the Intel Xeon Phi architecture with selected and representative stencil kernels. We show improvement ranging from 5.58% to 31.17% over existing state-of-the-art techniques.

Locality Aware execution, jagged tiling↗

AI Meets Exascale Computing: Advancing Cancer Research With Large-Scale High Performance Computing

The application of data science in cancer research has been boosted by major advances in three primary areas: (1) Data: diversity, amount, and availability of biomedical data; (2) Advances in Artificial Intelligence (AI) and Machine Learning (ML) algorithms that enable learning from complex, large-scale data; and (3) Advances in computer architectures allowing unprecedented acceleration of simulation and machine learning algorithms. These advances help build in silico ML models that can provide transformative insights from data including: molecular dynamics simulations, next-generation sequencing, omics, imaging, and unstructured clinical text documents. Unique challenges persist, however, in building ML models related to cancer, including: (1) access, sharing, labeling, and integration of multimodal and multi-institutional data across different cancer types; (2) developing AI models for cancer research capable of scaling on next generation high performance computers; and (3) assessing robustness and reliability in the AI models. In this paper, we review the National Cancer Institute (NCI) -Department of Energy (DOE) collaboration, Joint Design of Advanced Computing Solutions for Cancer (JDACS4C), a multi-institution collaborative effort focused on advancing computing and data technologies to accelerate cancer research on three levels: molecular, cellular, and population. This collaboration integrates various types of generated data, pre-exascale compute resources, and advances in ML models to increase understanding of basic cancer biology, identify promising new treatment options, predict outcomes, and eventually prescribe specialized treatments for patients with cancer.

60 APPLIED LIFE SCIENCES↗

Advanced Artificial Science. The development of an artificial science and engineering research infrastructure to facilitate innovative computational modeling, analysis, and application to interdisciplinary areas of scientific investigation.

This is a final report of the DOE award DE-SC0001132, Advanced Artificial Science. The development of an artificial science and engineering research infrastructure to facilitate innovative computational modeling, analysis, and application to interdisciplinary areas of scientific investigation. This document describes the achievements of the goals, and resulting research made possible by this award.

97 MATHEMATICS AND COMPUTING↗

Magellan: experiences from a Science Cloud

Cloud resources promise to be an avenue to address new categories of scientific applications including data-intensive science applications, on-demand/surge computing, and applications that require customized software environments. However, there is a limited understanding on how to operate and use clouds for scientific applications. Magellan, a project funded through the Department of Energy?s (DOE) Advanced Scientific Computing Research (ASCR) program, is investigating the use of cloud computing for science at the Argonne Leadership Computing Facility (ALCF) and the National Energy Research Scientific Computing Facility (NERSC). In this paper, we detail the experiences to date at both sites and identify the gaps and open challenges from both a resource provider as well as application perspective.

97 MATHEMATICS AND COMPUTING↗