Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

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

At least 289 records · Page 16

Online Monitoring of Medium Voltage Cable Systems with Spread Spectrum Time Domain and Frequency Domain Reflectometry

In-service failures of wave energy convertor (WEC) cable systems can have a significant cost and power availability impact. Close parallel research 2019 data showed > 1B£ and 9 Terra-Watt-Hours associated with global off-shore wind (OSW) cable failures (Strang-Moran 2020). OSW is a closely related technology but currently is significantly cheaper than WEC technology. For wave energy to compete, the problem of reliable cable transmission must be mitigated. This project develops isolation technology to allow online high frequency reflectometry testing of medium voltage cables (1 to 10 kV and higher) without arcing or damage to the test instrument. Online spread spectrum time domain reflectometry (SSTDR) testing has been established for low voltage cable systems in the aircraft and rail industry and the ability to detect and locate cable flaws of interest is well understood. Extending reflectometry testing to medium voltage systems could enable detection of cable damage before failures occur thereby allowing repair and replacement of damaged cable segments to be scheduled and managed. The seedling project succeeded to pass and receive high frequency SSTDR signals onto a cable up to 1 kV using a parallel trace isolation circuit board that can be connected onto the test cable. The approach used a novel circuit design for which an invention disclosure has been filed. A proposed sapling project would extend the technology toward the higher operating voltages used by WEC systems, thereby enabling online SSTDR cable monitoring. The goal of the seedling project was to extend the capability of the ARENA cable/motor test bed to address medium voltages and to develop a high pass filter isolation architecture to protect the reflectometry instrument from the low frequency (DC – 60 Hz) line voltage while allowing the high frequency diagnostic signal to pass to and from the test instrument to the live line. Initial efforts focused on passive LCR filter circuits to reduce 60 Hz levels below 10 volts from a 10 kV line while allowing the MHz high frequency chirps to pass onto the cables and for mV signals to be detected. We discovered that the parasitic loss behavior of real high voltage components precluded this approach from working. An alternate approach was adapted for the electric field to couple between two parallel traces on a printed circuit board much like a radio-frequency coupler. The challenge here was and is to have the parallel traces close enough to each other to effectively pass the high frequency chirp onto the live line and receive any reflected signal from any encountered impedance change along the cable. This reflected signal will be in the mV range. The traces however must be far enough apart to not allow arcing on the board. A design with 3 mm spacing was determined to allow the high frequency signal to pass onto the live line and receive the mV signal back into the instrument while reducing the 60 Hz voltage amplitude by >80 dB (more than a factor of 10,000) without allowing arcing from across the parallel traces. This was confirmed by simulation and test.

16 TIDAL AND WAVE POWER↗

Adaptive Spatially Aware I/O for Multiresolution Particle Data Layouts

Large-scale simulations on nonuniform particle distributions that evolve over time are widely used in cosmology, molecular dynamics, and engineering. Such data are often saved in an unstructured format that neither preserves spatial locality nor provides metadata for accelerating spatial or attribute subset queries, leading to poor performance of visualization tasks. Furthermore, the parallel I/O strategy used typically writes a file per process or a single shared file, neither of which is portable or scalable across different HPC systems. We present a portable technique for scalable, spatially aware adaptive aggregation that preserves spatial locality in the output. We evaluate our approach on two supercomputers, Stampede2 and Summit, and demonstrate that it outperforms prior approaches at scale, achieving up to 2.5× faster writes and reads for nonuniform distributions. Furthermore, the layout written by our method is directly suitable for visual analytics, supporting low-latency reads and attribute-based filtering with little overhead.

Usher, Will↗

ExaHDF5: Delivering Efficient Parallel I/O on Exascale Computing Systems

Scientific applications at exascale generate and analyze massive amounts of data. A critical requirement of these applications is the capability to access and manage this data efficiently on exascale systems. As such, parallel I/O, the key technology enables moving data between compute nodes and storage, faces monumental challenges from new applications, memory, and storage architectures considered in the designs of exascale systems. As the storage hierarchy is expanding to include node-local persistent memory, burst buffers, etc., as well as disk-based storage, data movement among these layers must be efficient. Parallel I/O libraries of the future should be capable of handling file sizes of many terabytes and beyond. In this paper, we describe new capabilities we have developed in Hierarchical Data Format version 5 (HDF5), the most popular parallel I/O library for scientific applications. HDF5 is one of the most used libraries at the leadership computing facilities for performing parallel I/O on existing HPC systems. The state-of-the-art features we describe include: Virtual Object Layer (VOL), Data Elevator, asynchronous I/O, full-featured single-writer and multiple-reader (Full SWMR), and parallel querying. In this paper, we introduce these features, their implementations, and the performance and feature benefits to applications and other libraries.

97 MATHEMATICS AND COMPUTING↗

Parallel, Asynchronous Executive (PAX): System concepts, facilities, and architecture

The Parallel, Asynchronous Executive (PAX) is a software operating system simulation that allows many computers to work on a single problem at the same time. PAX is currently implemented on a UNIVAC 1100/42 computer system. Independent UNIVAC runstreams are used to simulate independent computers. Data are shared among independent UNIVAC runstreams through shared mass-storage files. PAX has achieved the following: (1) applied several computing processes simultaneously to a single, logically unified problem; (2) resolved most parallel processor conflicts by careful work assignment; (3) resolved by means of worker requests to PAX all conflicts not resolved by work assignment; (4) provided fault isolation and recovery mechanisms to meet the problems of an actual parallel, asynchronous processing machine. Additionally, one real-life problem has been constructed for the PAX environment. This is CASPER, a collection of aerodynamic and structural dynamic problem simulation routines. CASPER is not discussed in this report except to provide examples of parallel-processing techniques.

Jones, W. H.↗

An operating system for future aerospace vehicle computer systems

The requirements for future aerospace vehicle computer operating systems are examined in this paper. The computer architecture is assumed to be distributed with a local area network connecting the nodes. Each node is assumed to provide a specific functionality. The network provides for communication so that the overall tasks of the vehicle are accomplished. The O/S structure is based upon the concept of objects. The mechanisms for integrating node unique objects with node common objects in order to implement both the autonomy and the cooperation between nodes is developed. The requirements for time critical performance and reliability and recovery are discussed. Time critical performance impacts all parts of the distributed operating system; e.g., its structure, the functional design of its objects, the language structure, etc. Throughout the paper the tradeoffs - concurrency, language structure, object recovery, binding, file structure, communication protocol, programmer freedom, etc. - are considered to arrive at a feasible, maximum performance design. Reliability of the network system is considered. A parallel multipath bus structure is proposed for the control of delivery time for time critical messages. The architecture also supports immediate recovery for the time critical message system after a communication failure.

Foudriat, E. C.↗

Database Reorganization in Parallel Disk Arrays with I/O Service Stealing

We present a model for data reorganization in parallel disk systems that is geared towards load balancing in an environment with periodic access patterns. Data reorganization is performed by disk cooling, i.e. migrating files or extents from the hottest disks to the coldest ones. We develop an approximate queueing model for determining the effective arrival rates of cooling requests and discuss its use in assessing the costs versus benefits of cooling.

Zabback, Peter↗

Scalable filesystem enumeration and metadata operations

Systems, apparatus, and methods are disclosed for performing scalable operations in a file system, including POSIX-like file systems. Metadata entries in a namespace or directory tree are sharded across multiple file metadata servers. An enumeration operation, such as listing a directory, is parallelized across the multiple file metadata servers, while retaining standard functionality transparently to clients. Other enumeration operations include no-output operations such as changing file attributes or deleting a file, and cumulative operations such as counting total disk space usage. The parallelization is compatible with tree-level parallelization and storage-level parallelization. Disclosed technologies can be applied to other fields requiring scalable enumeration, such as database and network applications.

Grider, Gary A.↗

How fast can one resize a distributed file system?

Efficient resource utilization becomes a major concern as large-scale distributed computing infrastructures keep growing in size. Malleability, the possibility for resource managers to dynamically increase or decrease the amount of resources allocated to a job, is a promising way to save energy and costs. However, state-of-the-art parallel and distributed storage systems have not been designed with malleability in mind. The reason is mainly the supposedly high cost of data transfers required by resizing operations. Nevertheless, as network and storage technologies evolve, old assumptions about potential bottlenecks can be revisited. In this study, we evaluate the viability of malleability as a design principle for a distributed storage system. We specifically model the minimal duration of the commission and decommission operations. To show how our models can be used in practice, we evaluate the performance of these operations in HDFS, a relevant state-of-the-art distributed file system. We show that the existing decommission mechanism of HDFS is good when the network is the bottleneck, but can be accelerated by up to a factor 3 when storage is the limiting factor. We also show that the commission in HDFS can be substantially accelerated. With the highlights provided by our model, we suggest improvements to speed both operations in HDFS. We discuss how the proposed models can be generalized for distributed file systems with different assumptions and what perspectives are open for the design of efficient malleable distributed file systems.

97 MATHEMATICS AND COMPUTING↗

Extreme-scale scripting : opportunities for large task-parallel applications on petascale computers.

Parallel scripting is a loosely-coupled programming model in which applications are composed of highly parallel scripts of program invocations that process and exchange data via files. We characterize here the applications that can benefit from parallel scripting on petascale-class machines, describe the mechanisms that make this feasible on such systems, and present results achieved with parallel scripts on currently available petascale computers.

97 MATHEMATICS AND COMPUTING↗

Scalable augmented enumeration and metadata operations for large filesystems

Systems, apparatus, and methods are disclosed for performing scalable operations in a file system. Metadata entries in a namespace or directory tree are sharded across multiple file metadata servers. An augmented enumeration operation, such as listing a directory, is parallelized across the multiple file metadata servers, transparently to clients. Exemplary augmentation features can include filtering and sorting. Augmentation features can be executed concurrently with enumeration, prior to enumeration, after enumeration, or as a combination of these, and can utilize pre-built index structures or holding structures for intermediate results. Augmented enumeration operations can also include no-output operations such as changing file attributes or deleting a file, and cumulative operations such as counting total disk space usage. The parallelization is compatible with tree-level parallelization and storage-level parallelization. Disclosed technologies can be applied to other fields requiring scalable enumeration, such as database and network applications.

Grider, Gary A.↗

Improving I/O Performance for Exascale Applications through Online Data Layout Reorganization

The applications being developed within the U.S. Exascale Computing Project (ECP) to run on imminent Exascale computers will generate scientific results with unprecedented fidelity and record turn-around time. Many of these codes are based on particle-mesh methods and use advanced algorithms, especially dynamic load-balancing and mesh-refinement, to achieve high performance on Exascale machines. Yet, as such algorithms improve parallel application efficiency, they raise new challenges for I/O logic due to their irregular and dynamic data distributions. Thus, while the enormous data rates of Exascale simulations already challenge existing file system write strategies, the need for efficient read and processing of generated data introduces additional constraints on the data layout strategies that can be used when writing data to secondary storage. We review these I/O challenges and introduce two online data layout reorganization approaches for achieving good tradeoffs between read and write performance. We demonstrate the benefits of using these two approaches for the ECP particle-in-cell simulation WarpX, which serves as a motif for a large class of important Exascale applications. Here, we show that by understanding application I/O patterns and carefully designing data layouts we can increase read performance by more than 80 percent.

97 MATHEMATICS AND COMPUTING↗

Evolution of the ROOT Tree I/O

The ROOT TTree data format encodes hundreds of petabytes of High Energy and Nuclear Physics events. Its columnar layout drives rapid analyses, as only those parts (“branches”) that are really used in a given analysis need to be read from storage. Its unique feature is the seamless C++ integration, which allows users to directly store their event classes without explicitly defining data schemas. In this contribution, we present the status and plans of the future ROOT 7 event I/O. Along with the ROOT 7 interface modernization, we aim for robust, where possible compile-time safe C++ interfaces to read and write event data. On the performance side, we show first benchmarks using ROOT’s new experimental I/O subsystem that combines the best of TTrees with recent advances in columnar data formats. A core ingredient is a strong separation of the high-level logical data layout (C++ classes) from the low-level physical data layout (storage backed nested vectors of simple types). We show how the new, optimized physical data layout speeds up serialization and deserialization and facilitates parallel, vectorized and bulk operations. This lets ROOT I/O run optimally on the upcoming ultra-fast NVRAM storage devices, as well as file-less storage systems such as object stores.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

3D Torus Routing Engine Module for OFA OpenSM v. 1.0

This OpenFabrics Alliance (OFA) OpenSM routing engine module provides credit-loop-free routing while supporting two quality of service (QoS) levels for an InfiniBand fabric with a 3D torus topology. In addition it is able to route around multiple failed fabric links or a single failed fabric switch without introducing credit loops, and without changing path Service Level (SL) values granted before the failure.This OFA OpenSM routing engine module improves the operational characteristics of a parallel computer built using an InfiniBand fabric with a 3D torus topology. By providing two QoS levels, it allows system administrators to prevent application interprocess communication and file system communication from impacting each other. By providing the capability to route traffic around failed fabric components, it enables repair of failed components without impacting jobs running on the computer system.

SCHUTT, JAMES↗

3D Torus Routing Engine Module for OFA OpenSM v. 1.0

This OpenFabrics Alliance (OFA) OpenSM routing engine module provides credit-loop-free routing while supporting two quality of service (QoS) levels for an InfiniBand fabric with a 3D torus topology. In addition it is able to route around multiple failed fabric links or a single failed fabric switch without introducing credit loops, and without changing path Service Level (SL) values granted before the failure.This OFA OpenSM routing engine module improves the operational characteristics of a parallel computer built using an InfiniBand fabric with a 3D torus topology. By providing two QoS levels, it allows system administrators to prevent application interprocess communication and file system communication from impacting each other. By providing the capability to route traffic around failed fabric components, it enables repair of failed components without impacting jobs running on the computer system.

SCHUTT, JAMES↗

Microscopic and magnetic properties of template assisted electrodeposited iron nanowires

Nanowires of magnetic materials such as Iron, nickel, cobalt, and alloys of them are one of the most widely investigated structures because of their possible applications in high density magnetic recording media, sensor elements, and building blocks in biological transport systems. In this work, Iron nanowires have been prepared by electrodeposition technique using Anodized Aluminium Oxide (AAO) templates. The electrolyte used consisted of FeSO{sub 4.}6H{sub 2}O buffered with H{sub 3}BO{sub 3} and acidized by dilute H{sub 2}SO{sub 4}. FESEM analysis shows that the asdeposited nanowires are parallel to one another and have high aspect ratio with a reasonably high pore-filing factor. To fabricate the working electrode, a thin film of copper (∼ 220 nm thick) was coated on back side of AAO template by e-beam evaporation system to create electrical contact with the external circuit. The TEM results show that electrodeposited nanowires have diameter around 100 nm and are polycrystalline in structure. Magnetic properties show the existence of anisotropy for in and out of plane configuration. These nanowires have potential applications in magnetic data storage, catalysis and magnetic sensor applications.

36 MATERIALS SCIENCE↗

Parallel Event Selection on HPC Systems

In their recent measurement of the neutrino oscillation parameters,NOvA uses a sample of approximately 25 million reconstructed spills to searchfor electron-neutrino appearance events. These events are stored in an n-tupleformat, in 250 thousand ROOT files. File sizes range from a few hundred KiB toa few MiB; the full dataset is approximately 1.4 TiB. These millions of eventsare reduced to a few tens of events by the application of strict event selectioncriteria, and then summarized by a handful of numbers each, which are used inthe extraction of the neutrino oscillation parameters.The NOvA event selection code is currently a serial C++ program that readsthese n-tuples. The current table data format and organization and the selection/reduction processing involved provides us with an opportunity to explorealternate approaches to represent the data and implement the processing. Werepresent our n-tuple data in HDF5 format that is optimized for the HPC environmentand which allows us to use the machine’s high-performance parallelI/O capabilities. We use MPI, numpy and h5py to implement our approach andcompare the performance with the existing approach. We study the performanceimplications of using thousands of small files of different sizes as comparedwith one large file using HPC resources. This work has been done as part of theSciDAC project, “HEP analytics on HPC” in collaboration with the ASCR teamsat ANL and LBNL.

Paterno, Marc↗

Modelling I and C systems with relays for simulation, adapting CIM standards - 243

As the nuclear power plants are in operation for many years, a main issue is to integrate simulation activities in parallel to the present I and C design process in order to limit impacts on current operating I and C engineering process and commissioning activities. The objective is to keep the existing I and C data and diagrams format. EDF chose to build an intermediate file independent of the tool used for simulation to exchange and store data. This file has been created adapting CIM standards (IEC 61968-13 and IEC 61970-301). It is an XML file built according to an RDF schema. CIM standards are intended to model transport or distribution electrical networks and used to facilitate system integration and information exchanges. We chose to adapt CIM to model EDF electromechanical relay circuitries in order to re-use all methods and tools developed around CIM standards such as RDF schema and RiseClipse, an open source tool developed by EDF and SUPELEC engineering school that will be used to verify exported I and C data according to a data model and to EDF engineering rules. This paper will describe the ongoing project on simulation in parallel to current I and C design process, focusing on how I and C electromechanical relays data are modelled based on CIM standards, and what benefits that model provides to I and C Verification and Validation activities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

HSLOT: The HERCULES Scriptable Loop Transformations Engine

HSLOT arms users with a rich set of configurable transformation directives, to be used as-they-are or to be specialized and combined into powerful custom transformations. We offer a plethora of loop transformations, which includes both the classic set (unroll, fuse, fission, tile, and so on) as well as unique ones (specialize, swap nest, split, fork, and so on) that are not found in other state-of-the-art systems. We show how HSLOT enables more transformations such as merging two loops that cannot be fused because of data dependencies and how HSLOT can be used in a simple and systematic fashion to improve memory accesses and expose better parallelism. To use our system, users simply annotate loops with the transformations sequence and compile with our Open64-based HSLOTimplementing Fortran compiler, HSLF90, which produces both object files and optionally source. We describe our experiment results using a set of scientific kernels written in Fortran with HSLOT directives on AMD 32 core system.

Kartsaklis, Christos↗