Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioning algorithms”

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 595 records · Page 33

Parallel Computation of Unsteady Flows on a Network of Workstations

Parallel computation of unsteady flows requires significant computational resources. The utilization of a network of workstations seems an efficient solution to the problem where large problems can be treated at a reasonable cost. This approach requires the solution of several problems: 1) the partitioning and distribution of the problem over a network of workstation, 2) efficient communication tools, 3) managing the system efficiently for a given problem. Of course, there is the question of the efficiency of any given numerical algorithm to such a computing system. NPARC code was chosen as a sample for the application. For the explicit version of the NPARC code both two- and three-dimensional problems were studied. Again both steady and unsteady problems were investigated. The issues studied as a part of the research program were: 1) how to distribute the data between the workstations, 2) how to compute and how to communicate at each node efficiently, 3) how to balance the load distribution. In the following, a summary of these activities is presented. Details of the work have been presented and published as referenced.

Source record↗

Linear-Scaling Coupled Cluster with Perturbative Triple Excitations: The Divide–Expand–Consolidate CCSD(T) Model

Here, we propose a reformulation of the traditional (T) triples correction to the coupled cluster singles and doubles (CCSD) energy in terms of local Hartree–Fock (HF) orbitals such that its structural form aligns with our recently developed linear-scaling divide–expand–consolidate (DEC) coupled cluster family of local correlation methods. In a DEC-CCSD(T) calculation, a basis of local occupied and virtual HF orbitals is used to partition the correlated calculation on the full system into a number of independent atomic fragment and pair fragment calculations, each performed within a truncated set of the complete orbital space. In return, this leads to a massively parallel algorithm for the evaluation of the DEC-CCSD(T) correlation energy, which formally scales linearly with the size of the full system and has a tunable precision with respect to a conventional CCSD(T) calculation via a single energy-based input threshold. The theoretical developments are supported by proof of concept DEC-CCSD(T) calculations on a series of medium-sized molecular systems.

Algorithms↗

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or an implicit direct integration method. A principle feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗

The nondeterministic divide

The nondeterministic divide partitions a vector into two non-empty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-and-conquer sequential algorithm on one or more vectors of the same range, whose division point for a new pair of recursive calls is chosen nondeterministically before any computation is performed and whose recursive calls are made immediately after the choice of division point; also, access to vector components is only permitted during activations in which the vector parameters have unit length. The notion of diva algorithm is formulated precisely as a diva call, a restricted call on a sequential procedure. Diva calls are proven to be intimately related to associativity. Numerous applications of diva calls are given and strategies are described for translating a diva call into code for a variety of parallel computers. Thus diva algorithms separate logical correctness concerns from implementation concerns.

Charlesworth, Arthur↗

Some practicable applications of quadtree data structures/representation in astronomy

Development of quadtree as hierarchical data structuring technique for representing spatial data (like points, regions, surfaces, lines, curves, volumes, etc.) has been motivated to a large extent by storage requirements of images, maps, and other multidimensional (spatially structured) data. For many spatial algorithms, time-efficiency of quadtrees in terms of execution may be as important as their space-efficiency concerning storage conditions. Briefly, the quadtree is a class of hierarchical data structures which is based on the recursive partition of a square region into quadrants and sub-quadrants until a predefined limit. Beyond the wide applicability of quadtrees in image processing, spatial information analysis, and building digital databases (processes becoming ordinary for the astronomical community), there may be numerous further applications in astronomy. Some of these practicable applications based on quadtree representation of astronomical data are presented and suggested for further considerations. Examples are shown for use of point as well as region quadtrees. Statistics of different leaf and non-leaf nodes (homogeneous and heterogeneous sub-quadrants respectively) at different levels may provide useful information on spatial structure of astronomical data in question. By altering the principle guiding the decomposition process, different types of spatial data may be focused on. Finally, a sampling method based on quadtree representation of an image is proposed which may prove to be efficient in the elaboration of sampling strategy in a region where observations were carried out previously either with different resolution or/and in different bands.

Pasztor, L.↗

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗

Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters

Abstract Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the database and query among thousands of processor nodes. However, the optimality of the partitioning method was not studied. Unlike BLAST performance models proposed in the literature that usually have problem size and hardware configuration as the only variables, the execution time of a BLAST job is a function of database size, query size, and hardware capability. In this work, the nucleotide BLAST application BLASTN was profiled using three methods: shell-level profiling with the Unix “time” command, code-level profiling with the built-in “profiler” module, and system-level profiling with the Unix “gprof” program. The runtimes were measured for six node types, using six different database files and 15 query files, on a heterogeneous HPC cluster with 500+ nodes. The empirical measurement data were fitted with quadratic functions to develop performance models that were used to guide the data parallelization for BLASTN jobs. Results Profiling results showed that BLASTN contains more than 34,500 different functions, but a single function, RunMTBySplitDB, takes 99.12% of the total runtime. Among its 53 child functions, five core functions were identified to make up 92.12% of the overall BLASTN runtime. Based on the performance models, static load balancing algorithms can be applied to the BLASTN input data to minimize the runtime of the longest job on an HPC cluster. Four test cases being run on homogeneous and heterogeneous clusters were tested. Experiment results showed that the runtime can be reduced by 81% on a homogeneous cluster and by 20% on a heterogeneous cluster by re-distributing the workload. Discussion Optimal data partitioning can improve BLASTN’s overall runtime 5.4-fold in comparison with dividing the database and query into the same number of fragments. The proposed methodology can be used in the other applications in the BLAST+ suite or any other application as long as source code is available.

59 BASIC BIOLOGICAL SCIENCES↗

Multi-Reactor Transmutation Analysis Utility (MRTAU,alpha1): Verification

Multi-Reactor Transmutation Utility (MRTAU) is a general depletion/decay algorithm under development at INL to support quick assessment of off-normal fuel cycle scenarios of similar nature to well studied reactor and fuel cycle concepts for which isotopic and cross-section data exists. MRTAU has been used in the past for scoping calculations to determine actinide composition evolution over the course of multiple recycles in Light Water Reactor Mixed Oxide and Sodium cooled Fast Reactor. In these applications, various actinide partitioning scenarios of interest were considered. The code has recently been expanded to include fission product generation, depletion and isotopic evolution over multiple recycles. The capability was added to investigate potential partial separations and/or limited recycling technologies such as Melt-Refining, AIROX, DUPIC or other fuel recycle technology where the recycled fuel stream is not completely decontaminated of fission products prior to being re-irradiated in a subsequent reactor pass. This report documents the code's solution methodology and algorithm as well as its solution accuracy compared to the SCALE6.0 software suite.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Jacobian-scaled K-means clustering for physics-informed segmentation of reacting flows

This work introduces Jacobian-scaled K-means (JSK-means) clustering, which is a physicsinformed clustering strategy centered on the K-means framework. The method allows for the injection of underlying physical knowledge into the clustering procedure through a distance function modification: instead of leveraging conventional Euclidean distance vectors, the JSKmeans procedure operates on distance vectors scaled by matrices obtained from dynamical system Jacobians evaluated at the cluster centroids. The goal of this work is to show how the JSKmeans algorithm - without modifying the input dataset - produces clusters that capture regions of dynamical similarity, in that the clusters are redistributed towards high-sensitivity regions in phase space and are described by similarity in the source terms of samples instead of the samples themselves. The algorithm is demonstrated on a complex reacting flow simulation dataset (a channel detonation configuration), where the dynamics in the thermochemical composition space are known through the highly nonlinear and stiff Arrhenius-based chemical source terms. Interpretations of cluster partitions in both physical space and composition space reveal how JSK-means shifts clusters produced by standard K-means towards regions of high chemical sensitivity (e.g., towards regions of peak heat release rate near the detonation reaction zone). Furthermore, the findings presented here illustrate the benefits of utilizing Jacobian-scaled distances in clustering techniques, and the JSK-means method in particular displays promising potential for improving former partition-based modeling strategies in reacting flow (and other multi-physics) applications.

Clustering↗

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗

A whole-path importance-sampling scheme for Feynman path integral calculations of absolute partition functions and free energies

Using Feynman path integrals, a molecular partition function can be written as a double integral with the inner integral involving all closed paths centered at a given molecular configuration, and the outer integral involving all possible molecular configurations. In previous work employing Monte Carlo methods to evaluate such partition functions, we presented schemes for importance sampling and stratification in the molecular configurations that constitute the path centroids, but we relied on free-particle paths for sampling the path integrals. At low temperatures, the path sampling is expensive because the paths can travel far from the centroid configuration. In this paper, we now present a scheme for importance sampling of whole Feynman paths based on harmonic information from an instantaneous normal mode calculation at the centroid configuration, which we refer to as harmonically guided whole-path importance sampling (WPIS). We obtain paths conforming to our chosen importance function by rejection sampling from a distribution of free-particle paths. Sample calculations on CH 4 demonstrate that at a temperature of 200 K, about 99.9% of the free-particle paths can be rejected without integration, and at 300 K, about 98% can be rejected. Finally, we also show that it is typically possible to reduce the overhead associated with the WPIS scheme by sampling the paths using a significantly lower-order path discretization than that which is needed to converge the partition function.

74 ATOMIC AND MOLECULAR PHYSICS↗

Deep Reinforcement Learning Enabled Physical-Model-Free Two-Timescale Voltage Control Method for Active Distribution Systems

Active distribution networks are being challenged by frequent and rapid voltage violations due to renewable energy integration. Conventional model-based voltage control methods rely on accurate parameters of the distribution networks, which are difficult to achieve in practice. This paper proposes a novel physical-model-free two-timescale voltage control framework for active distribution systems. To achieve fast control of PV inverters, the whole network is first partitioned into several subnetworks using voltage-reactive power sensitivity. Then, the scheduling of PV inverters in the multiple sub-networks is formulated as Markov games and solved by a multi-agent soft actor-critic (MASAC) algorithm, where each subnetwork is modeled as an intelligent agent. All agents are trained in a centralized manner to learn a coordinated strategy while being executed based on only local information for fast response. For the slower time-scale control, OLTCs and switched capacitors are coordinated by a single agent-based SAC algorithm using the global information with considering control behaviors of the inverters. Particularly, the two-level agents are trained concurrently with information exchange according to the reward signal calculated from the data-driven surrogate model. Comparative tests with different benchmark methods on IEEE 33-and 123-bus systems and 342-node low voltage distribution system demonstrate that the proposed method can effectively mitigate the fast voltage violations and achieve systematical coordination of different voltage regulation assets without the knowledge of accurate system model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Real-time optical laboratory solution of parabolic differential equations

An optical laboratory matrix-vector processor is used to solve parabolic differential equations (the transient diffusion equation with two space variables and time) by an explicit algorithm. This includes optical matrix-vector nonbase-2 encoded laboratory data, the combination of nonbase-2 and frequency-multiplexed data on such processors, a high-accuracy optical laboratory solution of a partial differential equation, new data partitioning techniques, and a discussion of a multiprocessor optical matrix-vector architecture.

Casasent, David↗

Locally bound constrained Newton-Raphson solution algorithms

This paper develops strategies which enable the automatic adjustment of the constraint surfaces recently used to extend the range and numerical stability/efficiency of nonlinear finite-element equation solvers. In addition to handling kinematic and material induced nonlinearity, both pre- and postbuckling behavior can be treated. The scheme developed employs localized bounds on various hierarchical partitions of the field variables. These are used to resize, shape, and orient the global constraint surface, thereby enabling essentially automatic load/deflection incrementation. Due to the generality of the approach taken, it can be implemented in conjunction with constraints of arbitrary functional type. To benchmark the method, several numerical experiments are presented. These include problems involving kinematic and material nonlinearity, as well as, pre- and postbuckling characteristics.

Padovan, J.↗

Development of parallel algorithms for electrical power management in space applications

The application of parallel techniques for electrical power system analysis is discussed. The Newton-Raphson method of load flow analysis was used along with the decomposition-coordination technique to perform load flow analysis. The decomposition-coordination technique enables tasks to be performed in parallel by partitioning the electrical power system into independent local problems. Each independent local problem represents a portion of the total electrical power system on which a loan flow analysis can be performed. The load flow analysis is performed on these partitioned elements by using the Newton-Raphson load flow method. These independent local problems will produce results for voltage and power which can then be passed to the coordinator portion of the solution procedure. The coordinator problem uses the results of the local problems to determine if any correction is needed on the local problems. The coordinator problem is also solved by an iterative method much like the local problem. The iterative method for the coordination problem will also be the Newton-Raphson method. Therefore, each iteration at the coordination level will result in new values for the local problems. The local problems will have to be solved again along with the coordinator problem until some convergence conditions are met.

Berry, Frederick C.↗

Calculating Free Energies Using Scaled-Force Molecular Dynamics Algorithm

One common objective of molecular simulations in chemistry and biology is to calculate the free energy difference between different states of the system of interest. Examples of problems that have such an objective are calculations of receptor-ligand or protein-drug interactions, associations of molecules in response to hydrophobic, and electrostatic interactions or partition of molecules between immiscible liquids. Another common objective is to describe evolution of the system towards a low energy (possibly the global minimum energy), 'native' state. Perhaps the best example of such a problem is folding of proteins or short RNA molecules. Both types of problems share the same difficulty. Often, different states of the system are separated by high energy barriers, which implies that transitions between these states are rare events. This, in turn, can greatly impede exploration of phase space. In some instances this can lead to 'quasi non-ergodicity', whereby a part of phase space is inaccessible on timescales of the simulation. A host of strategies has been developed to improve efficiency of sampling the phase space. For example, some Monte Carlo techniques involve large steps which move the system between low-energy regions in phase space without the need for sampling the configurations corresponding to energy barriers (J-walking). Most strategies, however, rely on modifying probabilities of sampling low and high-energy regions in phase space such that transitions between states of interest are encouraged. Perhaps the simplest implementation of this strategy is to increase the temperature of the system. This approach was successfully used to identify denaturation pathways in several proteins, but it is clearly not applicable to protein folding. It is also not a successful method for determining free energy differences. Finally, the approach is likely to fail for systems with co-existing phases, such as water-membrane systems, because it may lead to spontaneous mixing. A similar difficulty may be encountered in any method relying on global modifications of phase space.

Darve, Eric↗

Flexible single molecule simulation of reaction-diffusion processes

An algorithm is developed for simulation of the motion and reactions of single molecules at a microscopic level. The molecules diffuse in a solvent and react with each other or a polymer and molecules can dissociate. Such simulations are of interest e.g. in molecular biology. The algorithm is similar to the Green's function reaction dynamics (GFRD) algorithm by van Zon and ten Wolde where longer time steps can be taken by computing the probability density functions (PDFs) and then sample from the distribution functions. Our computation of the PDFs is much less complicated than GFRD and more flexible. The solution of the partial differential equation for the PDF is split into two steps to simplify the calculations. The sampling is without splitting error in two of the coordinate directions for a pair of molecules and a molecule-polymer interaction and is approximate in the third direction. The PDF is obtained either from an analytical solution or a numerical discretization. The errors due to the operator splitting, the partitioning of the system, and the numerical approximations are analyzed. The method is applied to three different systems involving up to four reactions. Comparisons with other mesoscopic and macroscopic models show excellent agreement.

97 MATHEMATICS AND COMPUTING↗

Self adaptive solution strategies: Locally bound constrained Newton Raphson solution algorithms

A summary is given of strategies which enable the automatic adjustment of the constraint surfaces recently used to extend the range and numerical stability/efficiency of nonlinear finite element equation solvers. In addition to handling kinematic and material induced nonlinearity, both pre-and postbuckling behavior can be treated. The scheme employs localized bounds on various hierarchical partitions of the field variables. These are used to resize, shape, and orient the global constraint surface, thereby enabling essentially automatic load/deflection incrementation. Due to the generality of the approach taken, it can be implemented in conjunction with the constraints of an arbitrary functional type. To benchmark the method, several numerical experiments are presented. These include problems involving kinematic and material nonlinearity, as well as pre- and postbuckling characteristics. Also included is a list of papers published in the course of the work.

Padovan, Joe↗