Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic 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 181 records · Page 10

Scalable Parallel Methods for Analyzing Metagenomics Data at Extreme Scale

The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid development and deployment of numerous cost-effective, high-throughput next-generation sequencing technologies. The result is that the DNA and protein sequence repositories are being bombarded with new sequence information. Databases are continuing to report a Moore’s law-like growth trajectory in their database sizes, roughly doubling every 18 months. In what seems to be a paradigm-shift, individual projects are now capable of generating billions of raw sequence data that need to be analyzed in the presence of already annotated sequence information. While it is clear that data-driven methods, such as sequencing homology detection, are becoming the mainstay in the field of computational life sciences, the algorithmic advancements essential for implementing complex data analytics at scale have mostly lagged behind. Sequence homology detection is central to a number of bioinformatics applications including genome sequencing and protein family characterization. Given millions of sequences, the goal is to identify all pairs of sequences that are highly similar (or “homologous”) on the basis of alignment criteria. While there are optimal alignment algorithms to compute pairwise homology, their deployment for large-scale is currently not feasible; instead, heuristic methods are used at the expense of quality. In this dissertation, we present the design and evaluation of a parallel implementation for conducting optimal homology detection on distributed memory supercomputers. Our approach uses a combination of techniques from asynchronous load balancing (viz. work stealing, dynamic task counters), data replication, and exact-matching filters to achieve homology detection at scale. Results for a collection of 2.56M sequences show parallel efficiencies of ~75-100% on up to 8K cores, representing a time-to-solution of 33 seconds. We extend this work with a detailed analysis of single-node sequence alignment performance using the latest CPU vector instruction set extensions. Preliminary results reveal that current sequence alignment algorithms are unable to fully utilize widening vector registers.

59 BASIC BIOLOGICAL SCIENCES↗

NASA Space Communications and Navigation: One Network Evolution

The NASA Space Communications and Navigation (SCaN) Program is responsible for providing the essential connectivity to robotic and human space explorers. The missions relying on SCaN range from suborbital and balloon missions to those traveling beyond the edge of the solar system. The demands for communications and navigation services enabled by SCaN (and its affiliated partners) are projected to increase and outpace the current network capacity. At the same time, the Agency finds itself surrounded by a burgeoning commercial space marketplace, technological advancement, and other government agencies that share common interests in space resiliency, robustness, and performance. As a result, SCaN has begun pivoting toward commercial services and collaborating with partners to close capacity and capability gaps. Given these growing demands of the Agency there is increasing need for multi-network solutions. Future mission concepts will rely on both government and commercial capabilities, both Near Space Network capacity and Deep Space Network capacity. Integrating these diverse support services together from a technical, programmatic and implementation standpoint will be key to meet the growing needs of the future. To accomplish this, a more substantive shift is required, and SCaN is reshaping itself to be a customer-centric, service-oriented, high-performance leader in the space communications community. This paper outlines the SCaN One Team, One Mission, One Network approach, and provides a vision for future mission community experience that includes streamlined mission commitment interfaces and clear processes, dynamic network scheduling and load balancing, and higher efficiency data transport and delivery through the integration of cloud infrastructure and services.

Near Space Network↗

A Dynamic Calibration Method for Experimental and Analytical Hub Load Comparison

This paper presents the results from an ongoing effort to produce improved correlation between analytical hub force and moment prediction and those measured during wind-tunnel testing on the Aeroelastic Rotor Experimental System (ARES), a conventional rotor testbed commonly used at the Langley Transonic Dynamics Tunnel (TDT). A frequency-dependent transformation between loads at the rotor hub and outputs of the testbed balance is produced from frequency response functions measured during vibration testing of the system. The resulting transformation is used as a dynamic calibration of the balance to transform hub loads predicted by comprehensive analysis into predicted balance outputs. In addition to detailing the transformation process, this paper also presents a set of wind-tunnel test cases, with comparisons between the measured balance outputs and transformed predictions from the comprehensive analysis code CAMRAD II. The modal response of the testbed is discussed and compared to a detailed finite-element model. Results reveal that the modal response of the testbed exhibits a number of characteristics that make accurate dynamic balance predictions challenging, even with the use of the balance transformation.

Kreshock, Andrew R.↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

Automatic Cloud Bursting under FermiCloud

Cloud computing is changing the infrastructure upon which scientific computing depends from supercomputers and distributed computing clusters to a more elastic cloud-based structure. The service-oriented focus and elasticity of clouds can not only facilitate technology needs of emerging business but also shorten response time and reduce operational costs of traditional scientific applications. Fermi National Accelerator Laboratory (Fermilab) is currently in the process of building its own private cloud, FermiCloud, which allows the existing grid infrastructure to use dynamically provisioned resources on FermiCloud to accommodate increased but dynamic computation demand from scientists in the domains of High Energy Physics (HEP) and other research areas. Cloud infrastructure also allows to increase a private cloud’s resource capacity through “bursting” by borrowing or renting resources from other community or commercial clouds when needed. This paper introduces a joint project on building a cloud federation to support HEP applications between Fermi National Accelerator Laboratory and Korea Institution of Science and Technology Information, with technical contributions from the Illinois Institute of Technology. In particular, this paper presents two recent accomplishments of the joint project: (a) cloud bursting automation and (b) load balancer. Automatic cloud bursting allows computer resources to be dynamically reconfigured to meet users’ demands. The load balance algorithm which the cloud bursting depends on decides when and where new resources need to be allocated. Our preliminary prototyping and experiments have shown promising success, yet, they also have opened new challenges to be studied

Wu, Hao↗

Apparatus and method for optimal phase balancing using dynamic programming with spatial consideration

Provided are an apparatus and method for load-balancing of a three-phase electric power distribution system having a multi-phase feeder, including obtaining topology information of the feeder identifying supply points for customer loads and feeder sections between the supply points, obtaining customer information that includes peak customer load at each of the points between each of the feeder sections, performing a phase balancing analysis, and recommending phase assignment at the customer load supply points.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Exploring dynamic load imbalance solutions with the CoMD proxy application

Proxy applications are developed to simplify studying parallel performance of scientific simulations and to test potential solutions for performance problems. However, proxy applications are typically too simple to allow work migration or to represent the load imbalance of their parent applications. To study the ability of load balancing solutions to balance work effectively, we enable work migration in one of the Exascale Co-design Center for Materials in Extreme Environments (ExMatEx) [1] applications, CoMD. We design a methodology to parameterize three key aspects necessary for studying load imbalance correction: (1) the granularity with which work can be migrated; (2) the initial load imbalance; (3) the dynamic load imbalance (how quickly the load changes over time). Finally, we present a study of the impact of flexibility in work migration in CoMD on load balance and the associated rebalancing costs for a wide range of initial and dynamic load imbalance scenarios.

97 MATHEMATICS AND COMPUTING↗

Split torque transmission load sharing

Split torque transmissions are attractive alternatives to conventional planetary designs for helicopter transmissions. The split torque designs can offer lighter weight and fewer parts but have not been used extensively for lack of experience, especially with obtaining proper load sharing. Two split torque designs that use different load sharing methods have been studied. Precise indexing and alignment of the geartrain to produce acceptable load sharing has been demonstrated. An elastomeric torque splitter that has large torsional compliance and damping produces even better load sharing while reducing dynamic transmission error and noise. However, the elastomeric torque splitter as now configured is not capable over the full range of operating conditions of a fielded system. A thrust balancing load sharing device was evaluated. Friction forces that oppose the motion of the balance mechanism are significant. A static analysis suggests increasing the helix angle of the input pinion of the thrust balancing design. Also, dynamic analysis of this design predicts good load sharing and significant torsional response to accumulative pitch errors of the gears.

Krantz, T. L.↗

Intelligent load pattern modeling and denoising using improved variational mode decomposition for various calendar periods

This paper proposes a novel approach to identify the load patterns considering calendar impact and denoising process, which advances the state of art of load identification and load forecasting to a more flexible and adaptive extent by revealing the correlation between load profile and the substantial influence factors. With the rapid development and the promising application of energy intemet and grid modernization, the accurate load modeling and forecasting especially by load pattern modeling (LPM) have become more and more critical to observe and estimate load profile so as to optimize the operation efficiency of the power grid. Traditional methods mostly focus on the static LPM itself which are unable to account the non-linear and highly dynamic load fluctuations in order to balance the demand of the power grid during various calendar period (VCP) scheduling. In this paper, a load pattern modeling method for power grid considering the impact of typical calendar effects is proposed using a combination of improved variational mode decomposition (IVMD) and deep belief network (DBN) algorithm. Firstly, an index of load curve curvature (LCC) is proposed to improve the selection of value K in the conventional VMD algorithm. The value K of the intrinsic modality is determined by adopting LCC to better quantify the average instantaneous frequency of the modal decomposition of the VMD and to reduce the elevated stochasticity of k. Secondly, an optimization formulation is developed based on adaptive segmented loop decomposition of the typical correlation coefficient to suppress the edge effect in VMD decomposition, which would enable the reconstructed curve to incorporate the variabilities from the initial data. Finally, the IVMD and DBN algorithms are jointly implemented to optimize the accuracy of VCP load pattern modeling curve regression. Numerical examples have been performed with the results proving that the proposed method significantly outperforms the state-of-art in reducing the modeling error of VCP load curve, improving the overall forecasting accuracy, and reducing load dispatching cost.

deep belief network↗

Agricultural demand response for decarbonizing the electricity grid

Historically, the focus of the agricultural industry has been increasing profit through maximizing crop yield. Costs for energy and water are small compared to equipment and personnel, and are thus often overlooked. However, energy costs for irrigation are increasing and could be exacerbated with declining water levels in many Western states. This trend has motivated many farmers to explore sustainable irrigation water and energy management practices. Additionally, much of this new focus has been directed towards the adoption of new agricultural technologies with a misplaced assumption that technology alone will inherently bring all the benefits. On one hand, farms are going through a paradigm shift, and are turning into net electricity generators, and on the other, higher penetration of intermittent renewable sources into the electricity grid, require dynamic loads to help the grid balance its intra-hour variability and short duration ramps. The agricultural industry could be restructured to utilize larger amounts of renewable energy such as wind and solar and provide a great deal of flexibility to the grid. As emerging producers of clean energy, farmers are required to learn and speak the complex language of the electricity grid in order to monetize their energy generation while making the renewable electricity grid more resilient and reliable. In this paper, we develop a foundational approach for understanding and connecting three important concepts that can help the agricultural industry during this critical transition period. Those three concepts are: (a) current and future needs of the electricity grid, (b) available electricity market mechanisms through which farms can provide services to the grid, and (c) understanding electricity consuming/generating equipment on farms. Finally, defining these concepts and condensing them into a standardized framework, can remove a significant barrier for enabling farms to provide services to the electricity grid while improving their bottom line.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Microgrid Modeling for Stability Analysis

Here this document is a summary of a report prepared by the IEEE PES Task Force (TF) on Microgrid (MG) Dynamic Modeling, IEEE Power and Energy Society, Tech. Rep. PES-TR106, 2023. In this paper, the major issues and challenges in microgrid modeling for stability analysis are discussed, and a review of state-of-the-art modeling approaches and trends is presented. In the context of the IEEE 1547 standard, the document covers issues associated with component models for MG dynamic studies and simulations, including generator and grid modeling, full and average converter models, unbalanced and balanced system conditions, dynamic and static loads, protection requirements, and detailed and simplified controls considering communications delays, packet losses, and security issues. Considering the future integration of grids and MGs to form broad integrated networks, a discussion is presented of the use of phasor vis-à-vis electromagnetic transient simulation tools for MG dynamic stability studies, as well as modeling scale-up issues and MG equivalent models. Specifically white-, grey-, and black-box models, are presented. This TF paper and companion report constitute a modeling guide for R&D groups working on developments and standards of MGs with a focus on stability issues.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel DSMC Solution of Three-Dimensional Flow Over a Finite Flat Plate

This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.

Nance, Robert P.↗

Load Balancing Sequences of Unstructured Adaptive Grids

Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. This paper makes several important additions to our previous work. First, a new remapping cost model is presented and empirically validated on an SP2. Next, our load balancing strategy is applied to sequences of dynamically adapted unstructured grids. Results indicate that our framework is effective on many processors for both steady and unsteady problems with several levels of adaption. Additionally, we demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required for a fine initial mesh. Finally, we show that the data remapping overhead can be significantly reduced by applying our heuristic processor reassignment algorithm.

Biswas, Rupak↗

Influence of Strain-Gage Balance Characteristics on the Precision Error of the Drag Coefficient

Improvements and results of a new method are presented that computes a pre-test estimate of the precision error of the drag coefficient of a wind tunnel model. The error estimate is defined as the part of the drag coefficient's precision error that is primarily associated with the precision error of the angle of attack measurement and physical characteristics of the chosen strain-gage balance. The method indirectly describes the precision error of the angle of attack measurement by using an assumed balance gage output variation of one microV/V. The physical characteristics of the balance, on the other hand, are described by partial derivatives of the axial and normal forces with respect to the strain-gage outputs. These derivatives can directly be obtained from the data reduction matrix of the balance. The precision error estimate itself is calculated by applying a simple explicit equation that uses the model reference area, the dynamic pressure, the angle of attack, the coefficients of the linear terms of the data reduction matrix, and the electrical output variation of one microvolt per volt as input. Precision errors at constant angle of attack may be visualized as contour plots by plotting them, for example, versus the Mach number and the total pressure. Characteristics of NASA's MC60E balance are used in combination with the reference area of a generic wind tunnel model in order to demonstrate that error estimates are independent of both the balance load format and the units chosen for the description of balance loads, model reference area, and the dynamic pressure. Finally, experimental data from a wind tunnel test of the Ames Check Standard Model in the NASA Ames 11-foot Transonic Wind Tunnel illustrates the application of the method to real-world test data.

precision error↗

Load Balancing for Multiphysics. In: AIAA 2013-2856,

Coupled Multi-Physics simulations, such as hybrid CFD-MD simulations, represent an increasingly important class of scientific applications. Often the physical problems of interest demand the use of high-end computers, such as TeraGrid resources, which are often accessible only via batch-queues. Batch-queue systems are not developed to natively support the coordinated scheduling of jobs – which in turn is required to support the concurrent execution required by coupled multi-physics simulations. In this paper we develop and demonstrate a novel approach to overcome the lack of native support for coordinated job submission requirement associated with coupled runs. We establish the performance advantages arising from our solution, which is a generalization of the Pilot-Job concept – which in of itself is not new, but is being applied to coupled simulations for the first time. Our solution not only overcomes the initial co-scheduling problem, but also provides a dynamic resource allocation mechanism. Support for such dynamic resources is critical for a load balancing mechanism, which we develop and demonstrate to be effective at reducing the total time-to-solution of the problem. We establish that the performance advantage of using Big Jobs is invariant with the size of the machine as well as the size of the physical model under investigation. The Pilot-Job abstraction is developed using SAGA, which provides an infrastructure agnostic implementation, and which can seamlessly execute and utilize distributed resources.

Lohner, Rainald↗

Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications. In this paper, we present task-based implementations of a recently developed data-parallel graph-based approach to the SP2 algorithm, G-SP2. We represent the density matrix P as an undirected graph and use graph partitioning techniques to divide the computation into smaller independent tasks. The partitions thus obtained are generally not of equal size and give rise to undesirable load imbalances in standard MPI-based implementations. This load-balancing challenge can be mitigated by dynamically scheduling parallel computations at runtime using task-based programming models. We develop task-based implementations of the data-parallel G-SP2 algorithm using both Intel's Concurrent Collections (CnC) as well as the Charm++ programming model and evaluate these implementations for future use. Scaling and performance results of our implementations are investigated for representative segments of QMD simulations for solvated protein systems containing more than 10,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Data Partitioning and Load Balancing in Parallel Disk Systems

Parallel disk systems provide opportunities for exploiting I/O parallelism in two possible waves, namely via inter-request and intra-request parallelism. In this paper we discuss the main issues in performance tuning of such systems, namely striping and load balancing, and show their relationship to response time and throughput. We outline the main components of an intelligent, self-reliant file system that aims to optimize striping by taking into account the requirements of the applications and performs load balancing by judicious file allocation and dynamic redistributions of the data when access patterns change. Our system uses simple but effective heuristics that incur only little overhead. We present performance experiments based on synthetic workloads and real-life traces.

Scheuermann, Peter↗