Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “hierarchical system”

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 19 records

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗

Demonstrating Hierarchical System Development With the Common Community Physics Package Single‐Column Model: A Case Study Over the Southern Great Plains

This study demonstrates a specific application of the hierarchical system development (HSD) approach to investigate, analyze, and attribute model issues within the Unified Forecast System (UFS), with a focus on process isolation. By evaluating a non‐precipitating, shallow cumulus case at the Atmospheric Radiation Measurement Southern Great Plains site in the UFS global forecast against the observation, the investigation identifies a warmer and deeper daytime convective planetary boundary layer (PBL) and misrepresented nocturnal PBL transition. Hypothesis testing, which employs the Common Community Physics Package (CCPP) single‐column model (SCM) and uses the same physics as the UFS global model, confirms that these issues are attributed to the model physics and initialization. Specifically, misrepresented PBL processes are linked to problematic surface condition and a lack of cloud formation, which may stem from deficiencies in PBL and cloud microphysics parameterizations and their interactions. The UFS initial condition contributes to an earlier, excessively collapsed daytime convective boundary layer and a lack of decoupling between the stable boundary layer and residual layer late in the afternoon. This work introduces an avenue for the community to engage with the application of HSD, along with the CCPP and CCPP SCM, to understand the interplay of model physics, disentangle the roles of model components, as well as facilitate model and forecast improvement.

54 ENVIRONMENTAL SCIENCES↗

Optimizing Blocking and Nonblocking Reduction Operations for Multicore Systems: Hierarchical Design and Implementation

Many scientific simulations, using the Message Passing Interface (MPI) programming model, are sensitive to the performance and scalability of reduction collective operations such as MPI Allreduce and MPI Reduce. These operations are the most widely used abstractions to perform mathematical operations over all processes that are part of the simulation. In this work, we propose a hierarchical design to implement the reduction operations on multicore systems. This design aims to improve the efficiency of reductions by 1) tailoring the algorithms and customizing the implementations for various communication mechanisms in the system 2) providing the ability to configure the depth of hierarchy to match the system architecture, and 3) providing the ability to independently progress each of this hierarchy. Using this design, we implement MPI Allreduce and MPI Reduce operations (and its nonblocking variants MPI Iallreduce and MPI Ireduce) for all message sizes, and evaluate on multiple architectures including InfiniBand and Cray XT5. We leverage and enhance our existing infrastructure, Cheetah, which is a framework for implementing hierarchical collective operations to implement these reductions. The experimental results show that the Cheetah reduction operations outperform the production-grade MPI implementations such as Open MPI default, Cray MPI, and MVAPICH2, demonstrating its efficiency, flexibility and portability. On Infini- Band systems, with a microbenchmark, a 512-process Cheetah nonblocking Allreduce and Reduce achieves a speedup of 23x and 10x, respectively, compared to the default Open MPI reductions. The blocking variants of the reduction operations also show similar performance benefits. A 512-process nonblocking Cheetah Allreduce achieves a speedup of 3x, compared to the default MVAPICH2 Allreduce implementation. On a Cray XT5 system, a 6144-process Cheetah Allreduce outperforms the Cray MPI by 145%. The evaluation with an application kernel, Conjugate Gradient solver, shows that the Cheetah reductions speeds up total time to solution by 195%, demonstrating the potential benefits for scientific simulations.

Gorentla Venkata, Manjunath↗

Optimizing blocking and nonblocking reduction operations for multicore systems: Hierarchical design and implementation

Many scientific simulations, using the Message Passing Interface (MPI) programming model, are sensitive to the performance and scalability of reduction collective operations such as MPI_Allreduce and MPI_Reduce. These operations are the most widely used abstractions to perform mathematical operations over all processes that are part of the simulation. In this work, we propose a hierarchical design to implement the reduction operations on multicore systems. This design aims to improve the efficiency of reductions by 1) tailoring the algorithms and customizing the implementations for various communication mechanisms in the system 2) providing the ability to configure the depth of hierarchy to match the system architecture, and 3) providing the ability to independently progress each of this hierarchy. Using this design, we implement MPI_Allreduce and MPI_Reduce operations (and its nonblocking variants MPI_Iallreduce and MPI_Ireduce) for all message sizes, and evaluate on multiple architectures including InfiniBand and Cray XT5. We leverage and enhance our existing infrastructure, Cheetah, which is a framework for implementing hierarchical collective operations to implement these reductions. The experimental results show that the Cheetah reduction operations outperform the production-grade MPI implementations such as Open MPI default, Cray MPI, and MVAPICH2, demonstrating its efficiency, flexibility and portability. On Infini-Band systems, with a microbenchmark, a 512-process Cheetah nonblocking Allreduce and Reduce achieves a speedup of 23x and 10x, respectively, compared to the default Open MPI reductions. The blocking variants of the reduction operations also show similar performance benefits. A 512-process nonblocking Cheetah Allreduce achieves a speedup of 3x, compared to the default MVAPICH2 Allreduce implementation. On a Cray XT5 system, a 6144-process Cheetah Allreduce outperforms the Cray MPI by 145%. The evaluation with an application kernel, Conjugate Gradient solver, shows that the Cheetah reductions speeds up total time to solution by 195%, demonstrating the potential benefits for scientific simulations.

Venkata, Manjunath Gorentla↗

Large eccentricity, low mutual inclination: the three-dimensional architecture of a hierarchical system of giant planets

We establish the three-dimensional architecture of the Kepler-419 (previously KOI-1474) system to be eccentric yet with a low mutual inclination. Kepler-419b is a warm Jupiter at semi-major axis a=0.370{sub −0.006}{sup +0.007} AU with a large eccentricity (e = 0.85{sub −0.07}{sup +0.08}) measured via the 'photoeccentric effect'. It exhibits transit timing variations (TTVs) induced by the non-transiting Kepler-419c, which we uniquely constrain to be a moderately eccentric (e = 0.184 ± 0.002), hierarchically separated (a = 1.68 ± 0.03 AU) giant planet (7.3 ± 0.4 M {sub Jup}). We combine 16 quarters of Kepler photometry, radial-velocity (RV) measurements from the HIgh Resolution Echelle Spectrometer on Keck, and improved stellar parameters that we derive from spectroscopy and asteroseismology. From the RVs, we measure the mass of the inner planet to be 2.5 ± 0.3 M {sub Jup} and confirm its photometrically measured eccentricity, refining the value to e = 0.83 ± 0.01. The RV acceleration is consistent with the properties of the outer planet derived from TTVs. We find that despite their sizable eccentricities, the planets are coplanar to within 9{sub −6}{sup +8} degrees, and therefore the inner planet's large eccentricity and close-in orbit are unlikely to be the result of Kozai migration. Moreover, even over many secular cycles, the inner planet's periapse is most likely never small enough for tidal circularization. Finally, we present and measure a transit time and impact parameter from four simultaneous ground-based light curves from 1 m class telescopes, demonstrating the feasibility of ground-based follow-up of Kepler giant planets exhibiting large TTVs.

79 ASTRONOMY AND ASTROPHYSICS↗

Determining the Bayesian optimal sampling strategy in a hierarchical system.

Consider a classic hierarchy tree as a basic model of a 'system-of-systems' network, where each node represents a component system (which may itself consist of a set of sub-systems). For this general composite system, we present a technique for computing the optimal testing strategy, which is based on Bayesian decision analysis. In previous work, we developed a Bayesian approach for computing the distribution of the reliability of a system-of-systems structure that uses test data and prior information. This allows for the determination of both an estimate of the reliability and a quantification of confidence in the estimate. Improving the accuracy of the reliability estimate and increasing the corresponding confidence require the collection of additional data. However, testing all possible sub-systems may not be cost-effective, feasible, or even necessary to achieve an improvement in the reliability estimate. To address this sampling issue, we formulate a Bayesian methodology that systematically determines the optimal sampling strategy under specified constraints and costs that will maximally improve the reliability estimate of the composite system, e.g., by reducing the variance of the reliability distribution. This methodology involves calculating the 'Bayes risk of a decision rule' for each available sampling strategy, where risk quantifies the relative effect that each sampling strategy could have on the reliability estimate. A general numerical algorithm is developed and tested using an example multicomponent system. The results show that the procedure scales linearly with the number of components available for testing.

99 GENERAL AND MISCELLANEOUS↗

The Case for A Hierarchal System Model for Linux Clusters

The computer industry today is no longer driven, as it was in the 40s, 50s and 60s, by High-performance computing requirements. Rather, HPC systems, especially Leadership class systems, sit on top of a pyramid investment mode. Figure 1 shows a representative pyramid investment model for systems hardware. At the base of the pyramid is the huge investment (order 10s of Billions of US Dollars per year) in semiconductor fabrication and process technologies. These costs, which are approximately doubling with every generation, are funded from investments multiple markets: enterprise, desktops, games, embedded and specialized devices. Over and above these base technology investments are investments for critical technology elements such as microprocessor, chipsets and memory ASIC components. Investments for these components are spread across the same markets as the base semiconductor processes investments. These second tier investments are approximately half the size of the lower level of the pyramid. The next technology investment layer up, tier 3, is more focused on scalable computing systems such as those needed for HPC and other markets. These tier 3 technology elements include networking (SAN, WAN and LAN), interconnects and large scalable SMP designs. Above these is tier 4 are relatively small investments necessary to build very large, scalable systems high-end or Leadership class systems. Primary among these are the specialized network designs of vertically integrated systems, etc.

99 GENERAL AND MISCELLANEOUS↗

Optimizing checkpoint data placement with guaranteed burst buffer endurance in large-scale hierarchical storage systems

Non-volatile devices, such as SSDs, will be an integral part of the deepening storage hierarchy on large-scale HPC systems. These devices can be on the compute nodes as part of a distributed burst buffer service or they can be external. Wherever they are located in the hierarchy, one critical design issue is the SSD endurance under the write-heavy workloads, such as the checkpoint I/O for scientific applications. For these environments, it is widely assumed that checkpoint operations can occur once every 60 min and for each checkpoint step as much as half of the system memory can be written out. Unfortunately, for large-scale HPC applications, the burst buffer SSDs can be worn out much more quickly given the extensive amount of data written at every checkpoint step. One possible solution is to control the amount of data written by reducing the checkpoint frequency. However, a direct effect caused by reduced checkpoint frequency is the increased vulnerability window of system failures and therefore potentially wasted computation time, especially for large-scale compute jobs.

Computer Science↗

Predicting the performance uncertainty of a 1-MW pilot-scale carbon capture system after hierarchical laboratory-scale calibration and validation

A challenging problem in designing pilot-scale carbon capture systems is to predict, with uncertainty, the adsorber performance and capture efficiency under various operating conditions where no direct experimental data exist. Motivated by this challenge, we previously proposed a hierarchical framework in which relevant parameters of physical models were sequentially calibrated from different laboratory-scale carbon capture unit (C2U) experiments. Specifically, three models of increasing complexity were identified based on the fundamental physical and chemical processes of the sorbent-based carbon capture technology. Results from the corresponding laboratory experiments were used to statistically calibrate the physical model parameters while quantifying some of their inherent uncertainty. The parameter distributions obtained from laboratory-scale C2U calibration runs are used in this study to facilitate prediction at a larger scale where no corresponding experimental results are available. In this paper, we first describe the multiphase reactive flow model for a sorbent-based 1-MW carbon capture system then analyze results from an ensemble of simulations with the upscaled model. The simulation results are used to quantify uncertainty regarding the design’s predicted efficiency in carbon capture. In particular, we determine the minimum gas flow rate necessary to achieve 90% capture efficiency with 95% confidence.

bubbling bed↗

1SWASP J093010.78+533859.5: A possible hierarchical quintuple system

Among quadruples or higher multiplicity stars, only a few doubly eclipsing binary systems have been discovered. They are important targets for understanding the formation and evolution of multiple stellar systems because we can obtain accurate stellar parameters from photometric and spectroscopic studies. We present the observational results of this kind of rare object, 1SWASP J093010.78+533859.5, for which the doubly eclipsing feature had been detected previously from the SuperWASP photometric archive. Individual point-spread function photometry for two objects with a separation of about 1.''9 was performed for the first time in this study. Our time-series photometric data confirms the finding of Lohr et al. that the bright object A is an Algol-type detached eclipsing binary and the fainter B is a W UMa-type contact eclipsing. Using high-resolution optical spectra, we obtained well-defined radial velocity variations of system A. Furthermore, stationary spectral lines were detected that must have originated from a further, previously unrecognized stellar component. It was confirmed by the third object contribution from the light-curve analysis. No spectral feature of system B was detected, probably due to motion blur by long exposure times. We obtained the binary parameters and the absolute dimensions of systems A and B from light-curve synthesis with and without radial velocities, respectively. The primary and secondary components of system A have a spectral type of K1 and K5 main sequences, respectively. Two components of system B have nearly the same type of K3 main sequence. Light variations for both binaries are satisfactorily modeled by using two-spot models with one starspot on each component. We estimated the distances to systems A and B individually. Two systems may have similar distances of about 70 pc and seem to be gravitationally bound with a separation of about 130 AU. In conclusion, we suggest that 1SWASP J093010.78+533859.5 is a quintuple stellar system with a hierarchical structure of a triple system A(ab)c and a binary system B(ab).

79 ASTRONOMY AND ASTROPHYSICS↗

SharP: Towards Programming Extreme-Scale Systems with Hierarchical Heterogeneous Memory

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. Along with hierarchical-heterogeneous memory, the system typically has a high-performing network and a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. In this work, we propose and develop the programming abstraction called SHARed data-structure centric Programming abstraction (SharP) to address both of these goals, i.e., provide (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications. To evaluate SharP, we implement a Stencil benchmark using SharP, port QMCPack, a petascale-capable application, and adapt Memcached ecosystem, a popular Big-Data framework, to use SharP, and quantify the performance and productivity advantages. Additionally, we demonstrate the simplicity of using SharP on different memories including DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM).

97 MATHEMATICS AND COMPUTING↗

Dynamic Non-Hierarchical File Systems for Exascale Storage

This constitutes the final report for “Dynamic Non-Hierarchical File Systems for Exascale Storage”. The ultimate goal of this project was to improve data management in scientific computing and high-end computing (HEC) applications, and to achieve this goal we proposed: to develop the first, HEC-targeted, file system featuring rich metadata and provenance collection, extreme scalability, and future storage hardware integration as core design goals, and to evaluate and develop a flexible non-hierarchical file system interface suitable for providing more powerful and intuitive data management interfaces to HEC and scientific computing users. Data management is swiftly becoming a serious problem in the scientific community – while copious amounts of data are good for obtaining results, finding the right data is often daunting and sometimes impossible. Scientists participating in a Department of Energy workshop noted that most of their time was spent “...finding, processing, organizing, and moving data and it’s going to get much worse”. Scientists should not be forced to become data mining experts in order to retrieve the data they want, nor should they be expected to remember the naming convention they used several years ago for a set of experiments they now wish to revisit. Ideally, locating the data you need would be as easy as browsing the web. Unfortunately, existing data management approaches are usually based on hierarchical naming, a 40 year-old technology designed to manage thousands of files, not exabytes of data. Today’s systems do not take advantage of the rich array of metadata that current high-end computing (HEC) file systems can gather, including content-based metadata and provenance1 information. As a result, current metadata search approaches are typically ad hoc and often work by providing a parallel management system to the “main” file system, as is done in Linux (the locate utility), personal computers, and enterprise search appliances. These search applications are often optimized for a single file system, making it difficult to move files and their metadata between file systems. Users have tried to solve this problem in several ways, including the use of separate databases to index file properties, the encoding of file properties into file names, and separately gathering and managing provenance data, but none of these approaches has worked well, either due to limited usefulness or scalability, or both. Our research addressed several key issues: High-performance, real-time metadata harvesting: extracting important attributes from files dynamically and immediately updating indexes used to improve search; Transparent, automatic, and secure provenance capture: recording the data inputs and processing steps used in the production of each file in the system; Scalable indexing: indexes that are optimized for integration with the file system; Dynamic file system structure: our approach provides dynamic directories similar to those in semantic file systems, but these are the native organization rather than a feature grafted onto a conventional system. In addition to these goals, our research effort will include evaluating the impact of new storage technologies on the file system design and performance. In particular, the indexing and metadata harvesting functions can potentially benefit from the performance improvements promised by new storage class memories.

42 ENGINEERING↗

Secular Resonances in Nonrestricted Hierarchical Triple Systems

In this paper, the averaged Hamiltonian of a nonrestricted hierarchical triple system truncated at the third order is investigated. First, each secular resonant term is studied. For the well-studied secular quadrupole theory, it is analytically reformulated in a different manner in our work. The resonance width is numerically determined and displayed on the √(1−e{sub 1}{sup 2})−√(1−e{sub 2}{sup 2}) plane (also denoted as the e-tilde {sub 1}− e-tilde {sub 2} plane). In terms of the octupole terms, we show that for a near-planar configuration of the system, considerable variations of both the eccentricities of the inner and outer orbits can be generated by a single resonant term. The resonance width for every secular resonant angle from the octupole terms is also numerically determined and displayed on the e-tilde {sub 1}− e-tilde {sub 2} plane. The results show that an orbit flip with a near-perpendicular initial mutual inclination is possible for each secular resonance. By displaying the resonance widths of different resonant terms on the same e-tilde {sub 1}− e-tilde {sub 2} plane, we intuitively show the overlap of different secular resonances. Then, the full averaged Hamiltonian with both quadrupole and octupole terms is investigated using the Poincaré surface of section, with a special focus on the orbit flip. For the cases we exploited, we find that the near-planar flip of the inner orbit can be either regular or chaotic while the outer orbit flip is generally chaotic.

79 ASTRONOMY AND ASTROPHYSICS↗