SEARCH · Engineering Papers

Results for “scalable 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.

SourceResearch connectionFrom yearThrough year

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

At least 991 records · Page 55

All sources NASA NTRS DOE OSTI

DOE OSTI2013

The portals 4.0.1 network programming interface.

This report presents a specification for the Portals 4.0 network programming interface. Portals 4.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4.0 is well suited to massively parallel processing and embedded systems. Portals 4.0 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia s Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4.0 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities. 3

Barrett, Brian W.↗

DOE OSTI2018

The Portals 4.2 Network Programming Interface

This report presents a specification for the Portals 4 network programming interface. Portals 4 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4 is well suited to massively parallel processing and embedded systems. Portals 4 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

A High-Fidelity Approach for the Simulation of Flow-Induced Vibration

Flow-induced vibration (FIV) is a widespread problem in energy systems becausethey rely on fluid movement for energy conversion. Vibrating structures may be damaged as fatigue or wear occur. Given the importance of reliable components in the nuclear industry, flow-induced vibrations have long been a major concern in the safety and operation of nuclear reactors. In particular,nuclear fuel and steam generators have been known to suffer from flow-induced vibrations and related failures. Over the past five years, the Nuclear EnergyAdvanced Modeling and Simulation program has developed the integrated multiphysics code suite SHARP. The goal of developing such a tool is to perform multiphysics modeling of the components inside a reactor core, the full reactor core or portions of it, and be able to achieve that with various levelsof fidelity. This flexibility allows users to select the appropriate level of fidelity for their computational resources and design constraints.In particular SHARP contains high-fidelity single-physics codes for structural mechanics and fluid mechanics calculations: the structural mechanics implicit code Diablo and the computational fluid dynamics spectral element code Nek5000. Both codes are state-of-the-art.highly scalable (up to millions of processors in the case of Nek5000) tools that have been extensively validated. These tools form a strong basis on which to build an FIV modeling capability.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2014

The Portals 4.0.2 Networking Programming Interface

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

The Portals 4.3 Network Programming Interface

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

SciDAC ISEP: Integrated Simulation of Energetic Particles in Burning Plasmas

The objective of the SciDAC Center for Integrated Simulation of Energetic Particles in Burning Plasmas (ISEP) is to improve physics understanding of energetic particle (EP) confinement and EP interactions with burning thermal plasmas through large-scale simulations. The ISEP center will develop a multiscale and multiphysics ISEP framework for a predictive capability of EP physics and deliver an EP module incorporating both first-principles simulations and high fidelity reduced transport models to the fusion whole device modeling (WDM) project. The ISEP framework will enable us to perform long time, global kinetic simulations of EP physics in burning plasmas, by utilizing the full power of the next generation supercomputers. Our research and development activities will build on fruitful collaborations with computer scientists and applied mathematicians to offer enabling technologies for performance scalability, portability, solvers, coupling for integration with the fusion WDM project, and long-term preservation of data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS2003

Chapman-1024 Processor Shared Memory

NASA has developed new technology that improves upon weakness in current mainstream supercomputer designs: those of "scalability," "humadmachine interface," and "load balancing." The system simplifies running large computer simulations of national and international importance like climate prediction and space vehicle design.

Ciotii, Robert↗

DOE OSTI2020

CDFG Extraction Tool for LLVM

With the dawn of the exascale era, computer scientists and engineers are faced with tremendous challenges across all facets of the HPC system - scalability, performance, reliability, and power consumption. In particular, the power-performance benefit from one processor generation to the next is seeing ever-diminishing returns and will require fundamental changes in the way we approach computation. In fact, it is likely that different applications will require different types of accelerators in order to meet power, performance, and reliability requirements at scale. One potential type of accelerator, a dataflow architecture, diverges from the traditional sequentially executed instruction model into one that reflects the inherent instruction-level parallelism in a program. This work presents the initial steps toward a tool that can extract the control-dataflow graph from an application.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

FOX: A Fault Oblivious Extreme-Scale Execution Environment

The FOX project, funded under the ASCR X-stack I program, developed systems software and runtime libraries for a new approach to the data and work distribution for massively parallel, fault oblivious application execution. Our work was motivated by the premise that exascale computing systems will provide a thousand-fold increase in parallelism and a proportional increase in failure rate relative to today’s machines. To deliver the capability of exascale hardware, the systems software must provide the infrastructure to support existing applications while simultaneously enabling efficient execution of new programming models that naturally express dynamic, adaptive, irregular computation; coupled simulations; and massive data analysis in a highly unreliable hardware environment with billions of threads of execution. Our OS research has prototyped new methods to provide efficient resource sharing, synchronization, and protection in a many-core compute node. We have experimented with alternative task/dataflow programming models and shown scalability in some cases to hundreds of thousands of cores. Much of our software is in active development through open source projects. Concepts from FOX are being pursued in next generation exascale operating systems. Our OS work focused on adaptive, application tailored OS services optimized for multi → many core processors. We developed a new operating system NIX that supports role-based allocation of cores to processes which was released to open source. We contributed to the IBM FusedOS project, which promoted the concept of latency-optimized and throughput-optimized cores. We built a task queue library based on distributed, fault tolerant key-value store and identified scaling issues. A second fault tolerant task parallel library was developed, based on the Linda tuple space model, that used low level interconnect primitives for optimized communication. We designed fault tolerance mechanisms for task parallel computations employing work stealing for load balancing that scaled to the largest existing supercomputers. Finally, we implemented the Elastic Building Blocks runtime, a library to manage object-oriented distributed software components. To support the research, we won two INCITE awards for time on Intrepid (BG/P) and Mira (BG/Q). Much of our work has had impact in the OS and runtime community through the ASCR Exascale OS/R workshop and report, leading to the research agenda of the Exascale OS/R program. Our project was, however, also affected by attrition of multiple PIs. While the PIs continued to participate and offer guidance as time permitted, losing these key individuals was unfortunate both for the project and for the DOE HPC community.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1995

Runtime volume visualization for parallel CFD

This paper discusses some aspects of design of a data distributed, massively parallel volume rendering library for runtime visualization of parallel computational fluid dynamics simulations in a message-passing environment. Unlike the traditional scheme in which visualization is a postprocessing step, the rendering is done in place on each node processor. Computational scientists who run large-scale simulations on a massively parallel computer can thus perform interactive monitoring of their simulations. The current library provides an interface to handle volume data on rectilinear grids. The same design principles can be generalized to handle other types of grids. For demonstration, we run a parallel Navier-Stokes solver making use of this rendering library on the Intel Paragon XP/S. The interactive visual response achieved is found to be very useful. Performance studies show that the parallel rendering process is scalable with the size of the simulation as well as with the parallel computer.

Ma, Kwan-Liu↗

DOE OSTI2023

Data transfer for STAR grid jobs

The Solenoidal Tracker at RHIC (STAR) is a multipurpose experiment at the Relativistic Heavy Ion Collider (RHIC) with the primary goal to study the formation and properties of the quark-gluon plasma. STAR is an international collaboration of member institutions and laboratories from around the world. Yearly data-taking period produces PBytes of raw data collected by the experiment. STAR primarily uses its dedicated facility at BNL to process this data, but has routinely leveraged distributed systems, both high throughput (HTC) and high performance (HPC) computing clusters, to significantly augment the processing capacity available to the experiment. The ability to automate the efficient transfer of large data sets on reliable, scalable, and secure infrastructure is critical for any large-scale distributed processing campaign. For more than a decade, STAR computing has relied upon GridFTP with its x509-based authentication to build such data transfer systems and integrate them into its larger production workflow. The end of support by the community for both GridFTP and the x509 standard requires STAR to investigate other approaches to meet its distributed processing needs. In this study we investigate two multi-purpose data distribution systems, Globus.org and XRootD, as alternatives to GridFTP. We compare both their performance and the ease by which each service is integrated into the type of secure and automated data transfer systems STAR has previously built using GridFTP. The presented approach and study may be applicable to other distributed data processing use cases beyond STAR.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2018

Scalable energy-efficient magnetoelectric spin–orbit logic

Since the early 1980s, most electronics have relied on the use of complementary metal–oxide–semiconductor (CMOS) transistors. However, the principles of CMOS operation, involving a switchable semiconductor conductance controlled by an insulating gate, have remained largely unchanged, even as transistors are miniaturized to sizes of 10 nanometres. We investigated what dimensionally scalable logic technology beyond CMOS could provide improvements in efficiency and performance for von Neumann architectures and enable growth in emerging computing such as artifical intelligence. Such a computing technology needs to allow progressive miniaturization, reduce switching energy, improve device interconnection and provide a complete logic and memory family. Here we propose a scalable spintronic logic device that operates via spin–orbit transduction (the coupling of an electron’s angular momentum with its linear momentum) combined with magnetoelectric switching. The device uses advanced quantum materials, especially correlated oxides and topological states of matter, for collective switching and detection. We describe progress in magnetoelectric switching and spin–orbit detection of state, and show that in comparison with CMOS technology our device has superior switching energy (by a factor of 10 to 30), lower switching voltage (by a factor of 5) and enhanced logic density (by a factor of 5). Additionally, its non-volatility enables ultralow standby power, which is critical to modern computing. The properties of our device indicate that the proposed technology could enable the development of multi-generational computing.

42 ENGINEERING↗

DOE OSTI2024

SPARC-X: Quantum simulations at extreme scale - reactive dynamics from first principles

We have developed the massively parallel electronic structure code SPARC-X: a computational framework for performing Kohn-Sham Density Functional Theory (DFT) calculations that can scale linearly with the number of atoms in the system, while being able to leverage petascale and emerging exascale parallel computers to study chemical phenomena at unprecedented length and time scales. SPARC-X exploits a recent breakthrough in electronic structure methodologies: systematically improvable, strictly local, orthonormal, discontinuous real-space bases that efficiently and systematically capture the local chemistry of the system. With further adaptation using new machine-learning techniques and the use of the massively parallel Spectral Quadrature (SQ) electronic structure method, the algorithmic complexity and prefactor associated with DFT calculations involving semilocal as well as hybrid functionals are dramatically reduced. Using petascale computational resources, SPARC-X enables quantum mechanical simulations at length and time scales previously accessible only by empirical approaches, e.g., 1,000,000 atoms for a few picoseconds using semilocal functionals or 1,000 atoms for a few picoseconds using hybrid functionals. Using exascale resources, the sizes and times targeted are two orders of magnitude larger. Such a capability has applications in a wide variety of chemical sciences, including reactive interfaces where large length- and/or long time-scales are needed and traditional force fields fail. This is particularly important in dynamic catalysis, where bond breaking and formation must be understood in detail. We developed, tested, and employed the SPARC-X framework to understand the photocatalytic properties of TiO 2 nanoparticles, revealing finite size effects that cannot be captured with standard model systems or functionals. This integrated development and application strategy ensures that SPARC-X remains a robust, efficient, and scalable software package for quantum simulations on current petascale and emerging exascale computing resources.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Automated construction of clear-sky dictionary from all-sky imager data

All-sky imagers (ASIs) have significant promise as scalable sensors for short-term solar irradiance forecasting. Many of the current computational techniques that use ASIs for this purpose rely on collections of clear-sky images indexed by time of day, solar angle, or both, called clear-sky dictionaries (CSDs). These CSDs act as baselines against which images can be compared to locate and classify clouds within the image frame. CSDs are often compiled by hand, where individuals visually inspect collections of images one at a time to find clear-sky images. This process is not scalable, and it is prone to error. This paper proposes an automated, nonparametric alternative that uses the principles of digital image processing to find clear-sky images within a set of images taken over several days. We use ground-truth measurements of the clearness index to assess the performance of our method, and we show that the images it selects accurately correspond to clear-sky images. We also compare our proposal, which is nonparametric, with a state-of-the-art parametric method. The numerical results indicate that the performance of the method proposed here is superior.

14 SOLAR ENERGY↗

DOE OSTI2015

CRADA: Data Acquisition and Tomographic Software Development

Dr. Raymond R. Raylman, Professor and Vice Chair for Research, Radiology Department at WVU was the Principal Investigator for the project. The Jefferson Lab partner on this project was the Radiation Detector and Imaging Group in the Physics Division, led by Dr. Drew Weisenberger who was the coordinator of the project execution and the chief contact with WVU. The responsibility of Jefferson Lab was to facilitate optimization of data acquisition software, conversion of JLab Fortran iterative positron emission mammography computer code to C++ and to act as a computer code repository. During the two year project interactions and exchange of information was directed by Dr. Raylman and Dr. Wesienberger. WVU provided the expertise that allowed JLab to continue development of the current JLab data acquisition software referred to as JDAQ. JDAQ is a highly flexible Java language based data acquisition tool that helps to minimize software induced dead-time while maintaining the highest possible data rates from a JLab built FPGA based analog-to-digital convertor (ADC). JDAQ interfaces directly with the FPGA based multi-channel ADCs. Using JDAQ it is possible process data from a number of different detector types such as the PET systems at WVU. Because of the inherent flexibility of our processing software, we are also able adjust detector readout parameters during operation to provide the best possible data presentation and calibration parameters. To accommodate the high rate nature of PET detector systems JDAQ was designed to be scalable across an Ethernet network as well as for multi-cpu computer systems, and it also has the capability to synchronize many ADCs connected to multiple computers. During the project WVU will provided iterative reconstruction algorithm expertise and Fortran programming assistance to facilitate the conversion to C++ of a JLab developed Fortran positron emission mammography (PEM) reconstruction code. Also WVU provided acceptance testing of the new C++ based PEM reconstruction code. The PEM code is a maximization (MLEM) image reconstruction program that created images from the list-mode data acquired from the PET system.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Tuyere: Enabling Scalable Memory Workloads for System Exploration

Memory technologies are under active development. Meanwhile, workloads on contemporary computing systems are increasing rapidly in size and diversity. Such dynamics in hardware and software further widen the gap between memory system design and performance evaluation. In this work, we propose a data-centric abstraction of high-performance computing applications for fast exploration of new memory technologies. We also provide a framework that uses a formal modeling language to describe the abstraction, automatically translates abstractions into memory traffic, and directly interfaces with cycle-accurate simulators. We evaluated the framework using 20 workloads and validated the memory traffic profile, the simulation results, and the relative memory changes of four memory technologies. Our results show that the data-centric abstraction can accurately capture application behavior adaptable to different input problems and can expedite system exploration.

Peng, Ivy Bo↗

DOE OSTI2016

Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms

Graph representations are pervasive in scientific and social computing. They serve as vital tools to model the interplay among different interacting entities. In this paper, we visit the problem of community detection, which is one of the most widely used graph operations toward scientific discovery. Community detection refers to the process of identifying tightly-knit subgroups of vertices in a large graph. These sub-groups (or communities) represent vertices that are tied together through common structure or function. Identification of communities could help in understanding the modular organization of complex networks. However, owing to large data sizes and high computational costs, performing community detection at scale has become increasingly challenging. Here, we present a detailed review and analysis of some of the leading computational methods and implementations developed for executing community detection on modern day multicore and manycore architectures. Our goals are to: a) define the problem of community detection and highlight its scientific significance; b) relate to challenges in parallelizing the operation on modern day architectures; c) provide a detailed report and taxonomical classification of the approaches that have been designed for various architectures; and d) finally, provide insights into the strengths and suitability of different architectures for community detection, and a preview into the future trends of the area. It is our hope that this detailed treatment of community detection on parallel architectures can serve as an exemplar study for extending the application of modern day multicore and manycore architectures to other complex graph applications.

community detection, multithreaded platforms↗