Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Load Balancing”

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 505 records · Page 28

Space Shuttle Main Engine structural analysis and data reduction/evaluation. Volume 2: High pressure oxidizer turbo-pump turbine end bearing analysis

The high-pressure oxidizer turbopump (HPOTP) consists of two centrifugal pumps, on a common shaft, that are directly driven by a hot-gas turbine. Pump shaft axial thrust is balanced in that the double-entry main inducer/impeller is inherently balanced and the thrusts of the preburner pump and turbine are nearly equal but opposite. Residual shaft thrust is controlled by a self-compensating, non-rubbing, balance piston. Shaft hang-up must be avoided if the balance piston is to perform properly. One potential cause of shaft hang-up is contact between the Phase 2 bearing support and axial spring cartridge of the HPOTP main pump housing. The status of the bearing support/axial spring cartridge interface is investigated under current loading conditions. An ANSYS version 4.3, three-dimensional, finite element model was generated on Lockheed's VAX 11/785 computer. A nonlinear thermal analysis was then executed on the Marshall Space Flight Center Engineering Analysis Data System (EADS). These thermal results were then applied along with the interference fit and bolt preloads to the model as load conditions for a static analysis to determine the gap status of the bearing support/axial spring cartridge interface. For possible further analysis of the local regions of HPOTP main pump housing assembly, detailed ANSYS submodels were generated using I-DEAS Geomod and Supertab (Appendix A).

Sisk, Gregory A.↗

Comparison of Fuel Loading Pattern Optimization Results using Exhaustive Search for Fresh Fuels and Local Search for Burned Fuels

Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis

We present a novel distributed union-find algorithm that features asynchronous parallelism and k-d tree based load balancing for scalable visualization and analysis of scientific data. Applications of union-find include level set extraction and critical point tracking, but distributed union-find can suffer from high synchronization costs and imbalanced workloads across parallel processes. In this study, we prove that global synchronizations in existing distributed union-find can be eliminated without changing final results, allowing overlapped communications and computations for scalable processing. We also use a k-d tree decomposition to redistribute inputs, in order to improve workload balancing. We benchmark the scalability of our algorithm with up to 1,024 processes using both synthetic and application data. Here, we demonstrate the use of our algorithm in critical point tracking and super-level set extraction with high-speed imaging experiments and fusion plasma simulations, respectively.

97 MATHEMATICS AND COMPUTING↗

Self-Avoiding Walks Over Adaptive Triangular Grids

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

Mobile Thread Task Manager

The Mobile Thread Task Manager (MTTM) is being applied to parallelizing existing flight software to understand the benefits and to develop new techniques and architectural concepts for adapting software to multicore architectures. It allocates and load-balances tasks for a group of threads that migrate across processors to improve cache performance. In order to balance-load across threads, the MTTM augments a basic map-reduce strategy to draw jobs from a global queue. In a multicore processor, memory may be "homed" to the cache of a specific processor and must be accessed from that processor. The MTTB architecture wraps access to data with thread management to move threads to the home processor for that data so that the computation follows the data in an attempt to avoid L2 cache misses. Cache homing is also handled by a memory manager that translates identifiers to processor IDs where the data will be homed (according to rules defined by the user). The user can also specify the number of threads and processors separately, which is important for tuning performance for different patterns of computation and memory access. MTTM efficiently processes tasks in parallel on a multiprocessor computer. It also provides an interface to make it easier to adapt existing software to a multiprocessor environment.

Clement, Bradley J.↗

A finite element/level set model of polyurethane foam expansion and polymerization

Polyurethane foams are used widely for encapsulation and structural purposes because they are inexpensive, straightforward to process, amenable to a wide range of density variations (1 lb/ft3 - 50 lb/ft3), and able to fill complex molds quickly and effectively. Computational model of the filling and curing process are needed to reduce defects such as voids, out-of-specification density, density gradients, foam decomposition from high temperatures due to exotherms, and incomplete filling. This paper details the development of a computational fluid dynamics model of a moderate density PMDI structural foam, PMDI-10. PMDI is an isocyanate-based polyurethane foam, which is chemically blown with water. The polyol reacts with isocyanate to produces the polymer. PMDI- 10 is catalyzed giving it a short pot life: it foams and polymerizes to a solid within 5 minutes during normal processing. To achieve a higher density, the foam is over-packed to twice or more of its free rise density of 10 lb/ft3. The goal for modeling is to represent the expansion, filling of molds, and the polymerization of the foam. This will be used to reduce defects, optimize the mold design, troubleshoot the processed, and predict the final foam properties. A homogenized continuum model foaming and curing was developed based on reaction kinetics, documented in a recent paper; it uses a simplified mathematical formalism that decouples these two reactions. The chemo-rheology of PMDI is measured experimentally and fit to a generalized- Newtonian viscosity model that is dependent on the extent of cure, gas fraction, and temperature. The conservation equations, including the equations of motion, an energy balance, and three rate equations are solved via a stabilized finite element method. The equations are combined with a level set method to determine the location of the foam-gas interface as it evolves to fill the mold. Understanding the thermal history and loads on the foam due to exothermicity and oven curing is very important to the results, since the kinetics, viscosity, and other material properties are all sensitive to temperature. Results from the model are compared to experimental flow visualization data and post-test X-ray computed tomography (CT) data for the density. Several geometries are investigated including two configurations of a mock structural part and a bar geometry to specifically test the density model. We have found that the model predicts both average density and filling profiles well. However, it under predicts density gradients, especially in the gravity direction. Further model improvements are also discussed for future work.

36 MATERIALS SCIENCE↗

An extension of the local momentum theory to a distorted wake model of a hovering rotor

The local momentum theory is based on the instantaneous balance between the fluid momentum and the blade elemental lift at a local station in the rotor rotational plane. Therefore, the theory has the capability of evaluating time wise variations of air loading and induced velocity distributions along a helicopter blade span. Unlike a complex vortex theory, this theory was developed to analyze the instantaneous induced velocity distribution effectively. The boundaries of this theory and a computer program using this theory are discussed. A concept introduced into the theory is the effect of the rotor wake contraction in hovering flight. A comparison of this extended local momentum theory with a prescribed wake vortex theory is also presented. The results indicate that the extended local momentum theory has the capability of achieving a level of accuracy similar to that of the prescribed wake vortex theory over wide range variations of rotor geometrical parameters. It is also shown that the analytical results obtained using either theory are in reasonable agreement with experimental data.

Kawachi, K.↗

OLiMPS. OpenFlow Link-layer MultiPath Switching

The OLiMPS project’s goal was the development of an OpenFlow controller application allowing load balancing over multiple switched paths across a complex network topology. The second goal was to integrate the controller with Dynamic Circuit Network systems such as ESnet’s OSCARS. Both goals were achieved successfully, as laid out in this report.

97 MATHEMATICS AND COMPUTING↗

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗

HEPnOS: a Specialized Data Service for High Energy Physics Analysis

In this paper, we present HEPnOS, a distributed data service for managing data produced by high-energy physics (HEP) experiments. Using HEPnOS, HEP applications can use HPC resources more effciently than traditional fle-based applications. The fle-based model leads to a rigid, chunk-based allocation of computational resources and limits the number of cores that can be used concurrently by an HEP application. The fundamental problem is that organizing domain-specifc data into fles inadvertently introduces a single, artifcial, confated tuning parameter that puts key optimization goals into confict: larger fle sizes reduce metadata overhead and thus improve I/O effciency, but smaller fle sizes provide more opportunity for workfow parallelism and load balancing. In this work, we introduce a domain-specifc data service that decouples that constraint so that data can be accessed and processed in its natural granularity while still maintaining I/O effciency. By removing the constraints introduced by fle handling we are able to obtain better scaling and make effcient use of more cores for processing a fxed-sized data sample. We demonstrate the improved scalability by using an application developed in the fle-based paradigm and comparing it to a version modifed to use HEPnOS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Implementation of a fully-balanced periodic tridiagonal solver on a parallel distributed memory architecture

While parallel computers offer significant computational performance, it is generally necessary to evaluate several programming strategies. Two programming strategies for a fairly common problem - a periodic tridiagonal solver - are developed and evaluated. Simple model calculations as well as timing results are presented to evaluate the various strategies. The particular tridiagonal solver evaluated is used in many computational fluid dynamic simulation codes. The feature that makes this algorithm unique is that these simulation codes usually require simultaneous solutions for multiple right-hand-sides (RHS) of the system of equations. Each RHS solutions is independent and thus can be computed in parallel. Thus a Gaussian elimination type algorithm can be used in a parallel computation and the more complicated approaches such as cyclic reduction are not required. The two strategies are a transpose strategy and a distributed solver strategy. For the transpose strategy, the data is moved so that a subset of all the RHS problems is solved on each of the several processors. This usually requires significant data movement between processor memories across a network. The second strategy attempts to have the algorithm allow the data across processor boundaries in a chained manner. This usually requires significantly less data movement. An approach to accomplish this second strategy in a near-perfect load-balanced manner is developed. In addition, an algorithm will be shown to directly transform a sequential Gaussian elimination type algorithm into the parallel chained, load-balanced algorithm.

Eidson, T. M.↗

SC'11 Poster: A Highly Efficient MGPT Implementation for LAMMPS; with Strong Scaling

The MGPT potential has been implemented as a drop in package to the general molecular dynamics code LAMMPS. We implement an improved communication scheme that shrinks the communication layer thickness, and increases the load balancing. This results in unprecedented strong scaling, and speedup continuing beyond 1/8 atom/core. In addition, we have optimized the small matrix linear algebra with generic blocking (for all processors) and specific SIMD intrinsics for vectorization on Intel, AMD, and BlueGene CPUs.

97 MATHEMATICS AND COMPUTING↗

Application of Intelligent Load Control to Manage Building Loads to Support Rapid Growth of Distributed Renewable Generation

Electricity utilities are faced with the mounting challenge of providing a stable supply of power to meet the growing demand while also integrating rapid growth in distributed variable renewable generation. Traditional means of balancing short- and long-term supply and demand imbalance will be expensive. Alternative approaches of using flexible loads in buildings are needed to mitigate the imbalance at a lower cost. This paper shows how the intelligent load control (ILC) process can be used to manage loads in buildings by dynamically prioritizing loads for curtailment using both quantitative and qualitative criteria. The ILC process can be deployed on low-cost computing platforms without the need for any additional sensing. ILC was first validated in a simulation environment to provide two grid service use cases: (1) managing monthly peak electricity demand and (2) managing buildings’ electricity consumption during a capacity bidding event. After being successfully tested in a simulation environment, ILC was deployed on real buildings to manage electricity consumption to provide two different use cases under different outdoor operating conditions. Both the simulation tests and the real building experiments were deployed using VOLTTRON™, a distributed sensing and control platform. The results from the tests and experiments showed that ILC was able to manage the controllable loads (heat pumps) in the building to maintain the electricity consumption at the desired level without a significant impact on occupant comfort. Overall, the results demonstrate that the ILC allows coordination of the controllable loads and provides a more intelligent means of load management than the traditional duty-cycling approach.

Kim, Woohyun↗

Design of Unstructured Adaptive (UA) NAS Parallel Benchmark Featuring Irregular, Dynamic Memory Accesses

We describe the design of a new method for the measurement of the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. The method involves the solution of a stylized heat transfer problem on an unstructured, adaptive grid. A Spectral Element Method (SEM) with an adaptive, nonconforming mesh is selected to discretize the transport equation. The relatively high order of the SEM lowers the fraction of wall clock time spent on inter-processor communication, which eases the load balancing task and allows us to concentrate on the memory accesses. The benchmark is designed to be three-dimensional. Parallelization and load balance issues of a reference implementation will be described in detail in future reports.

Feng, Hui-Yu↗

Maximizing long-term biohydrogen production with Clostridium thermocellum for high solids conversion of lignocellulosic biomass

Biological hydrogen production from lignocellulosic biomass sustainably couples organic waste reduction with renewable energy generation. Efficient conversion is challenged by the structural complexity of lignocellulose and resulting recalcitrance to enzymatic degradation. Clostridium thermocellum natively breaks down biomass with highly effective hemi-/cellulases systems (i.e., cellulosomes) and generates hydrogen in anaerobic cultivation, creating a compelling platform for lignocellulosic biohydrogen production. Achieving commercially viable production rates requires balancing high biomass loading and throughput against uniform mixing conditions required for enzyme dispersion, pH and temperature control, and efficient hydrogen and metabolite removal in continuous operation. To address these barriers to process intensification, we implemented novel reactor and process designs for high-solids lignocellulosic biomass fermentations using the C. thermocellum KJC19-9 strain, genetically engineered for co-utilization of cellulose and hemicellulose sugars (i.e., xylose). Via computational fluid dynamics (CFD) modeling and experimental validation, we achieved a >50% improvement in biohydrogen production with an improved anchor-type impeller morphology, coupled to a threefold reduction in agitation rate. To further reduce rheological constraints and accumulation of toxic metabolites, we then transitioned the process to sequencing fed-batch operation. The resulting process generated 24.87 L H 2 L −1 from 160 g L −1 of deacetylated and mechanically refined (DMR)-pretreated corn stover biomass over 16 days while solubilizing >95% of influent cellulose and hemicellulose, setting a new performance benchmark for continuous production of biohydrogen from lignocellulose.

08 HYDROGEN↗

An architecture for real-time vision processing

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Chien, Chiun-Hong↗

RANS-MP: A Portable Parallel Navier-Stokes Solver

RANS-MP, a new implementation of a single-grid Navier-Stokes solver using the diagonalized Beam-Warming approximate-factorization scheme, is presented. This first release of the completely rewritten solver employs the following optimizations: (1) Bi-directional multi-partition method for the ADI solver part; this improves granularity and load balance; (2) Improved cache usage through elimination of non-unit-stride array access (possible in part due to multi-partitioning); (3) Preprocessing of communicating boundary conditions to streamline logic during time stepping; (4) Truly parallel, high-performance I/O using the newly-developed MPI-IO library; (5) Elimination of large amounts of redundant operations through efficient use of workspace. Results of some realistic wing computations on the IBM SP2 computer will be presented. We will demonstrate that excellent absolute performance and scalability are obtained with RANS-MP, even for relatively small grid sizes. Besides high performance, an outstanding feature of RANS-MP is its true portability, due to the use of the portable message passing and I/O libraries MPI and MPI-IO.

VanderWijngaart, Rob F.↗