SEARCH · Engineering Papers

Results for “Computer Systems”

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 613 records · Page 34

All sources NASA NTRS DOE OSTI

DOE OSTI2015

Hardware enabled performance counters with support for operating system context switching

A device for supporting hardware enabled performance counters with support for context switching include a plurality of performance counters operable to collect information associated with one or more computer system related activities, a first register operable to store a memory address, a second register operable to store a mode indication, and a state machine operable to read the second register and cause the plurality of performance counters to copy the information to memory area indicated by the memory address based on the mode indication.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Improved parallel performance of the CICE model in CESM1

The Los Alamos sea ice model, CICE, is a sophisticated finite difference grid point model. It has been a part of the National Science Foundation and Department of Energy community climate models (Community Climate System Model (CCSM) and Community Earth System Model (CESM)) for over a decade. It includes various physical and dynamical processes and is parallelized to run on large-scale computer systems. The CICE model was assessed in the CESM at different resolutions and target processor counts to better understand and optimize the performance. Several new decompositions and a new feature to reduce the halo cost were added to the model. The new decompositions better leverage land block elimination and take advantage of scaling opportunities in different computational kernels. As a result of these new features, the CICE model performance has been improved by up to 45% and has more flexibility to be run efficiently at arbitrary Message Passing Interface (MPI) task counts

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2015

Performance evaluation of radiant cooling system integrated with air system under different operational strategies

The paper describes a parametric study developed to estimate the energy savings potential of a radiant cooling system installed in a commercial building in India. The study is based on numerical modeling of a radiant cooling system installed in an Information Technology (IT) office building sited in the composite climate of Hyderabad. To evaluate thermal performance and energy consumption, simulations were carried out using the ANSYS FLUENT and EnergyPlus softwares, respectively. The building model was calibrated using the measured data for the installed radiant system. Then this calibrated model was used to simulate the energy consumption of a building using a conventional all-air system to determine the proportional energy savings. For proper handling of the latent load, a dedicated outside air system (DOAS) was used as an alternative to Fan Coil Unit (FCU). A comparison of energy consumption calculated that the radiant system was 17.5 % more efficient than a conventional all-air system and that a 30% savings was achieved by using a DOAS system compared with a conventional system. Computational Fluid Dynamics (CFD) simulation was performed to evaluate indoor air quality and thermal comfort. It was found that a radiant system offers more uniform temperatures, as well as a better mean air temperature range, than a conventional system. To further enhance the energy savings in the radiant system, different operational strategies were analyzed based on thermal analysis using EnergyPlus. Lastly, the energy savings achieved in this parametric run were more than 10% compared with a conventional all-air system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2019

High‐quality genome‐scale metabolic modelling of Pseudomonas putida highlights its broad metabolic capabilities

Summary Genome‐scale reconstructions of metabolism are computational species‐specific knowledge bases able to compute systemic metabolic properties. We present a comprehensive and validated reconstruction of the biotechnologically relevant bacterium Pseudomonas putida KT2440 that greatly expands computable predictions of its metabolic states. The reconstruction represents a significant reactome expansion over available reconstructed bacterial metabolic networks. Specifically, i JN1462 (i) incorporates several hundred additional genes and associated reactions resulting in new predictive capabilities, including new nutrients supporting growth; (ii) was validated by in vivo growth screens that included previously untested carbon (48) and nitrogen (41) sources; (iii) yielded gene essentiality predictions showing large accuracy when compared with a knock‐out library and Bar‐seq data; and (iv) allowed mapping of its network to 82 P . putida sequenced strains revealing functional core that reflect the large metabolic versatility of this species, including aromatic compounds derived from lignin. Thus, this study provides a thoroughly updated metabolic reconstruction and new computable phenotypes for P . putida , which can be leveraged as a first step toward understanding the pan metabolic capabilities of Pseudomonas .

Microbiology↗

DOE OSTI2019

Per-page control of physical address space distribution among memory modules

Systems, apparatuses, and methods for implementing per-page control of physical address space distribution among memory modules are disclosed. A computing system includes a plurality of processing units coupled to a plurality of memory modules. A determination is made as to which physical address space distribution granularity to implement for physical memory pages allocated for a first data structure. The determination can be made on a per-data-structure basis (e.g., file, page, block, etc.) or on a per-application-basis. A physical address space distribution granularity is encoded as a property of each physical memory page allocated for the first data structure, and physical memory pages of the first data structure distributed across the plurality of memory modules based on a selected physical address space distribution granularity. Page table entries (PTEs) may be annotated with the selected physical address space distribution granularity, using an addressing mapping granularity (AMG) field of a page table entry, where the granularity may be, for example, a fine-grain distribution granularity or a coarse-grain distribution granularity.

Jayasena, Nuwan S.↗

DOE OSTI2023

Community threat intelligence and visibility for operational technology networks

Techniques are provided for community threat intelligence for operational technology networks. For a plurality of OT networks, at least one monitoring device processes OT network traffic and collects telemetry data, and a telemetry sanitization system applies a sanitization process to the telemetry data to generate sanitized telemetry data that does not include sensitive data. A computer system receives sanitized telemetry data from the telemetry sanitization systems provided for the plurality of OT networks, maintains threat intelligence data generated based on the sanitized telemetry data, and provides access to at least one of the threat intelligence data and the sanitized telemetry data to a plurality of users.

Bladow, Garrett↗

DOE OSTI2022

Thermal measurement apparatus and methods for anisotropic thermal materials

A system for characterizing thermal properties of thermally anisotropic heterogeneous samples includes a heating element, a first temperature sensing device, a second temperature sensing device, and a computing system. The heating element is positioned at a first location within a sample and heats the sample. The first temperature sensing device outputs data indicative of temperatures of the first location to the computing device. The second temperature sensing device outputs data indicative of temperatures of the second location to the computing device. The computing device computes a thermal conductivity of the sample based upon the temperatures of the first location. The computing device further outputs an indication of a portion of the sample to which the thermal conductivity pertains based upon the second temperatures.

Reyes, Karla Rosa↗

DOE OSTI2023

Thermal measurement apparatus and methods for anisotropic thermal materials

Reyes, Karla Rosa↗

DOE OSTI2015

Accelerating k-NN Algorithm with Hybrid MPI and OpenSHMEM

Machine Learning algorithms are benefiting from the continuous improvement of programming models, including MPI, MapReduce and PGAS. k-Nearest Neighbors (k-NN) algorithm is a widely used machine learning algorithm, applied to supervised learning tasks such as classification. Several parallel implementations of k-NN have been proposed in the literature and practice. However, on high-performance computing systems with high-speed interconnects, it is important to further accelerate existing designs of the k-NN algorithm through taking advantage of scalable programming models. To improve the performance of k-NN on large-scale environment with InfiniBand network, this paper proposes several alternative hybrid MPI+OpenSHMEM designs and performs a systemic evaluation and analysis on typical workloads. The hybrid designs leverage the one-sided memory access to better overlap communication with computation than the existing pure MPI design, and propose better schemes for efficient buffer management. The implementation based on k-NN program from MaTEx with MVAPICH2-X (Unified MPI+PGAS Communication Runtime over InfiniBand) shows up to 9.0% time reduction for training KDD Cup 2010 workload over 512 cores, and 27.6% time reduction for small workload with balanced communication and computation. Experiments of running with varied number of cores show that our design can maintain good scalability.

Lin, Jian↗

DOE OSTI2022

Metaplastic and energy-efficient biocompatible graphene artificial synaptic transistors for enhanced accuracy neuromorphic computing

CMOS-based computing systems that employ the von Neumann architecture are relatively limited when it comes to parallel data storage and processing. In contrast, the human brain is a living computational signal processing unit that operates with extreme parallelism and energy efficiency. Although numerous neuromorphic electronic devices have emerged in the last decade, most of them are rigid or contain materials that are toxic to biological systems. In this work, we report on biocompatible bilayer graphene-based artificial synaptic transistors (BLAST) capable of mimicking synaptic behavior. The BLAST devices leverage a dry ion-selective membrane, enabling long-term potentiation, with ~50 aJ/µm 2 switching energy efficiency, at least an order of magnitude lower than previous reports on two-dimensional material-based artificial synapses. The devices show unique metaplasticity, a useful feature for generalizable deep neural networks, and we demonstrate that metaplastic BLASTs outperform ideal linear synapses in classic image classification tasks. With switching energy well below the 1 fJ energy estimated per biological synapse, the proposed devices are powerful candidates for bio-interfaced online learning, bridging the gap between artificial and biological neural networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

TH-A-19A-10: Fast Four Dimensional Monte Carlo Dose Computations for Proton Therapy of Lung Cancer

Purpose: To develop and validate a fast and accurate four dimensional (4D) Monte Carlo (MC) dose computation system for proton therapy of lung cancer and other thoracic and abdominal malignancies in which the delivered dose distributions can be affected by respiratory motion of the patient. Methods: A 4D computer tomography (CT) scan for a lung cancer patient treated with protons in our clinic was used to create a time dependent patient model using our in-house, MCNPX-based Monte Carlo system (“MC{sup 2}”). The beam line configurations for two passively scattered proton beams used in the actual treatment were extracted from the clinical treatment plan and a set of input files was created automatically using MC{sup 2}. A full MC simulation of the beam line was computed using MCNPX and a set of phase space files for each beam was collected at the distal surface of the range compensator. The particles from these phase space files were transported through the 10 voxelized patient models corresponding to the 10 phases of the breathing cycle in the 4DCT, using MCNPX and an accelerated (fast) MC code called “FDC”, developed by us and which is based on the track repeating algorithm. The accuracy of the fast algorithm was assessed by comparing the two time dependent dose distributions. Results: The error of less than 1% in 100% of the voxels in all phases of the breathing cycle was achieved using this method with a speedup of more than 1000 times. Conclusion: The proposed method, which uses full MC to simulate the beam line and the accelerated MC code FDC for the time consuming particle transport inside the complex, time dependent, geometry of the patient shows excellent accuracy together with an extraordinary speed.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2013

SLOAVx: Scalable LOgarithmic AlltoallV Algorithm for Hierarchical Multicore Systems

Scientific applications use collective communication operations in Message Passing Interface (MPI) for global synchronization and data exchanges. Alltoall and AlltoallV are two important collective operations. They are used by MPI jobs to exchange messages among all of MPI processes. AlltoallV is a generalization of Alltoall, supporting messages of varying sizes. However, the existing MPI AlltoallV implementation has linear complexity, i.e., each process has to send messages to all other processes in the job. Such linear complexity can result in sub optimal scalability of MPI applications when they are deployed on millions of cores. To address above challenge, in this paper, we introduce a new Scalable LOgarithmic AlltoallV algorithm, named SLOAV, for MPI AlltoallV collective operation. SLOAV aims to achieve global exchange of small messages of different sizes in a logarithmic number of rounds. Furthermore, given the prevalence of multicore systems with shared memory, we design a hierarchical AlltoallV algorithm based on SLOAV by leveraging the advantages of shared memory, which is referred to as SLOAVx. Compared to SLOAV, SLOAVx significantly reduces the inter-node communication, thus improving the entire system performance and mitigating the impact of message latency. We have implemented and embedded both algorithms in Open MPI. Our evaluation on large-scale computer systems shows that for the 8-byte and 1024-process MPI Alltoallv operation, the SLOAV can reduce the latency by as much as 86.4%, when compared to the state-of-the-art, and SLOAVx can further optimize the SLOAV by up to 83.1% in terms of message latency on multicore systems. In addition, experiments with NAS Parallel Benchmark (NPB) demonstrate that our algorithms are very effective for real-world applications.

Computer Science↗

DOE OSTI2024

Custom Accessors: Enabling Scalable Data Ingestion, (Re-)Organization, and Analysis on Distributed Systems

The emerging class of high velocity and high volume data analytic workflows comprise interwoven data ingestion, organization, and processing stages, with ingestion and organization steps often contributing comparable or even higher computational costs than actual processing steps. Since complex workflows consist of a variety of phases that view and use data differently, being able to construct efficient, scalable, distributed data structures (arrays, vectors, sets, maps, and multi-maps) is essential and requires custom methods to extend and shrink containers, analyze and position data, and, maintain globallyconsistent meta-data. In this paper, we propose a novel datastructure access paradigm based on the concept of Accessors. At a high level, accessors are customizable callable objects that can modify the behavior of insert, read, update, and delete operations for distributed containers while preserving atomicity guarantees. Accessors provide a very clean and natural way to implement a variety of programming patterns, e.g., conditional insertion/deletion and cascading computations, which would be otherwise hard (or even impossible) to express in parallel and distributed settings without using locks. We demonstrate the practicality and usefulness of our approach with two representative use cases and study the performance of these applications on a distributed High-Performance Computing system. Our analysis highlights that our proposed abstraction allows for an effective overlapping and concurrent execution of different workflow steps (e.g., data ingestion and analysis), which in a conventional analytics pipeline would execute sequentially, contributing cumulatively to the overall latency.

Castellana, Vito G. [BATTELLE (PACIFIC NW LAB)] (O↗

DOE OSTI2022

Systems, methods and computer program products for collaborative agent control

Systems, methods and unmanned agents for collaboratively controlling agents in a collaborative network by one or more agents continuously simulating numeric models of one or more other agents in the network to dramatically reduce the computational bandwidth required between agents, and improve the quality of shared estimates of the agent locations as well as the locations and characteristics of other objects of interest, e.g. targets. Bandwidth is reduced by using the models to intelligently filter data before communicating.

Buerger, Stephen↗

DOE OSTI2025

Genesis: A Compiler Framework for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers

We introduce Genesis, the first compiler designed to support Hamiltonian Simulation on hybrid continuous-variable (CV) and discrete-variable (DV) quantum computing systems. Genesis is a two-level compilation system. At the first level, it decomposes an input Hamiltonian into basis gates using the native instruction set of the target hybrid CV-DV quantum computer. At the second level, it tackles the mapping and routing of qumodes/qubits to implement long-range interactions for the gates decomposed from the first level. Rather than a typical implementation that relies on SWAP primitives similar to qubit-based (or DV-only) systems, we propose an integrated design of connectivity-aware gate synthesis and beamsplitter SWAP insertion tailored for hybrid CV-DV systems. We also introduce an OpenQASM-like domain-specific language (DSL) named CVDV-QASM to represent Hamiltonian in terms of Pauli-exponentials and basic gate sequences from the hybrid CVDV gate set. Genesis has successfully compiled several important Hamiltonians, including the Bose-Hubbard model, Z2−Higgs model, Hubbard-Holstein model, Heisenberg model and Electron-vibration coupling Hamiltonians, which are critical in domains like quantum field theory, condensed matter physics, and quantum chemistry. Our implementation is available at Genesis-CVDV-Compiler https://github.com/ruadapt/Genesis-CVDV-Compiler

Chen, Henry↗

DOE OSTI2019

Defense strategies and expected capacity of high performance computing infrastructures

We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.

Rao, Nageswara↗

DOE OSTI2019

Understanding the evolution of conditions data access through Frontier for the ATLAS Experiment

The ATLAS Distributed Computing system uses the Frontier system to access the Conditions, Trigger, and Geometry database data stored in the Oracle Offline Database at CERN by means of the HTTP protocol. All ATLAS computing sites use Squid web proxies to cache the data, greatly reducing the load on the Frontier servers and the databases. One feature of the Frontier client is that in the event of failure, it retries with different services. While this allows transient errors and scheduled maintenance to happen transparently, it does open the system up to cascading failures if the load is high enough. Throughout LHC Run 2 there has been an ever increasing demand on the Frontier service. There have been multiple incidents where parts of the service failed due to high load. A significant improvement in the monitoring of the Frontier service was required. The monitoring was needed to identify both problematic tasks, which could then be killed or throttled, and to identify failing site services as the consequence of a cascading failure is much higher. This presentation describes the implementation and features of the monitoring system.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Quantum simulation: From spin models to gauge-gravity correspondence

Quantum many-body systems with coherent and controllable interactions enable the realization of novel quantum materials, the quantum simulation of problems that cannot be simulated on classical computers, computational systems that are exponentially faster than existing classical algorithms, and the direct investigation of the conjectured duality between gravitational theories and quantum field theories. This project focusses on quantum phase transitions in strongly interacting many-body spin systems, and in particular on the dynamical evolution near the critical point and across the phase transition. The dynamics of a large quantum system containing more than 50 qubits is investigated in various critical regimes. In particular, the Kibble-Zurek transition has been characterized and critical exponents have been measured. Furthermore, quantum many-body scars have been observed and characterized for the first time. We are investigating the Kibble-Zurek mechanism in the quantum phase transition in one dimension from a disordered system to a system with ordering induced by Rydberg interactions between neighboring atoms. The Kibble-Zurek mechanism describes the formation of topological defects as a system evolves across a phase transitions, and is expected to apply to a large number of problems, including cosmology, where it should describe the structure of domain formation in the early universe.

74 ATOMIC AND MOLECULAR PHYSICS↗