Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster computer”

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 523 records · Page 29

The methodology of multi-viewpoint clustering analysis

One of the greatest challenges facing the software engineering community is the ability to produce large and complex computer systems, such as ground support systems for unmanned scientific missions, that are reliable and cost effective. In order to build and maintain these systems, it is important that the knowledge in the system be suitably abstracted, structured, and otherwise clustered in a manner which facilitates its understanding, manipulation, testing, and utilization. Development of complex mission-critical systems will require the ability to abstract overall concepts in the system at various levels of detail and to consider the system from different points of view. Multi-ViewPoint - Clustering Analysis MVP-CA methodology has been developed to provide multiple views of large, complicated systems. MVP-CA provides an ability to discover significant structures by providing an automated mechanism to structure both hierarchically (from detail to abstract) and orthogonally (from different perspectives). We propose to integrate MVP/CA into an overall software engineering life cycle to support the development and evolution of complex mission critical systems.

Mehrotra, Mala↗

Reconfigurable Software for Controlling Formation Flying

Software for a system to control the trajectories of multiple spacecraft flying in formation is being developed to reflect underlying concepts of (1) a decentralized approach to guidance and control and (2) reconfigurability of the control system, including reconfigurability of the software and of control laws. The software is organized as a modular network of software tasks. The computational load for both determining relative trajectories and planning maneuvers is shared equally among all spacecraft in a cluster. The flexibility and robustness of the software are apparent in the fact that tasks can be added, removed, or replaced during flight. In a computational simulation of a representative formation-flying scenario, it was demonstrated that the following are among the services performed by the software: Uploading of commands from a ground station and distribution of the commands among the spacecraft, Autonomous initiation and reconfiguration of formations, Autonomous formation of teams through negotiations among the spacecraft, Working out details of high-level commands (e.g., shapes and sizes of geometrically complex formations), Implementation of a distributed guidance law providing autonomous optimization and assignment of target states, and Implementation of a decentralized, fuel-optimal, impulsive control law for planning maneuvers.

Mueller, Joseph B.↗

NCSTRL+: Adding Multi-Discipline and Multi-Genre Support to the Dienst Protocol Using Clusters and Buckets

We describe NCSTRL+, a unified, canonical digital library for scientific and technical information (STI). NCSTRL+ is based on the Networked Computer Science Technical Report Library (NCSTRL), a World Wide Web (WWW) accessible digital library (DL) that provides access to over 100 university departments and laboratories. NCSTRL+ implements two new technologies: cluster functionality and publishing buckets. We have extended Dienst, the protocol underlying NCSTRL, to provide the ability to cluster independent collections into a logically centralized digital library based upon subject category classification, type of organization, and genres of material. The bucket construct provides a mechanism for publishing and managing logically linked entities with multiple data forms as a single object. The NCSTRL+ prototype DL contains the holdings of NCSTRL and the NASA Technical Report Server (NTRS). The prototype demonstrates the feasibility of publishing into a multi-cluster DL, searching across clusters, and storing and presenting buckets of information.

Nelson, Michael L.↗

Linear-scaling quadruple excitations in local pair natural orbital coupled-cluster theory

Here, we present a fast, asymptotically linear-scaling implementation of the perturbative quadruples energy correction in coupled-cluster theory using local natural orbitals. Our work follows the domain-based local pair natural orbital (DLPNO) approach previously applied to lower levels of excitations in coupled-cluster theory. Our DLPNO-CCSDT(Q) algorithm uses converged doubles and triples amplitudes from a preceding DLPNO-CCSDT computation to compute the quadruples amplitude and energy in the quadruples natural orbital (QNO) basis. We demonstrate the compactness of the QNO space, showing that more than 95% of the (Q) correction can be recovered using relatively loose natural orbital cutoffs, compared to the tighter cutoffs used in pair and triples natural orbitals at lower levels of coupled-cluster theory. We also highlight the accuracy of our algorithm in the computation of relative energies, which yields deviations of sub-kJ mol −1 in relative energy compared to the canonical CCSDT(Q). Timings are conducted on a series of growing linear alkanes (up to 10 carbons and 608 basis functions) and water clusters (up to 49 water molecules and 2842 basis functions) to establish the asymptotic linear-scaling of our DLPNO-(Q) algorithm.

Auxiliary functions↗

Electromagnetic observables of open-shell nuclei from coupled-cluster theory

Here we develop a new method to describe electromagnetic observables of open-shell nuclei with two nucleons outside a closed shell. This approach combines the equation-of-motion coupled-cluster method for such systems and the Lorentz integral transform technique, expanding the applicability of coupled-cluster theory for electromagnetic observables beyond closed-(sub)shell nuclei. To validate this new approach, we compute the non-energy-weighted dipole sum rule and the dipole polarizability of 16,24 ⁢O in both the closed-(sub)shell and the new equation-of-motion coupled-cluster frameworks, finding agreement within error bars. We then analyze the evolution of the dipole polarizability along the oxygen and calcium isotopic chains. Our predictions agree well with available experimental data and other available theoretical calculations for the closed-(sub)shell 16,22 ⁢O and the open-shell 18 O. In the calcium isotopes, we observe that our dipole polarizability predictions for open-shell nuclei are lower than those of closed-(sub)shell nuclei. We expect that our predictions for 24 O and 54,56 ⁢Ca will motivate future experimental studies at the drip line.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Monopole Fluctuations in Galaxy Surveys

Galaxy clustering provides a powerful way to probe cosmology. This requires understanding of the background mean density of galaxy samples, which is estimated from the survey itself by averaging the observed galaxy number density over the angular position. The angle average includes not only the background mean density but also the monopole fluctuation at each redshift. Here for the first time we compute the monopole fluctuations in galaxy surveys and investigate their impact on galaxy clustering. The monopole fluctuations vary as a function of redshift, and it is correlated with other fluctuations, affecting the two-point correlation function measurements. In an idealized all-sky survey, the rms fluctuation at z = 0.5 can be as large as 7% of the two-point correlation function in amplitude at the baryonic acoustic oscillation scale, and it becomes smaller than 1% at z > 2. The monopole fluctuations are unavoidable, but they can be modeled. We discuss its relation to the integral constraint and the implications for the galaxy clustering analysis.

Baryon acoustic oscillations↗

Computation and parallel implementation for early vision

The problem of early vision is to transform one or more retinal illuminance images-pixel arrays-to image representations built out of such primitive visual features such as edges, regions, disparities, and clusters. These transformed representations form the input to later vision stages that perform higher level vision tasks including matching and recognition. Researchers developed algorithms for: (1) edge finding in the scale space formulation; (2) correlation methods for computing matches between pairs of images; and (3) clustering of data by neural networks. These algorithms are formulated for parallel implementation of SIMD machines, such as the Massively Parallel Processor, a 128 x 128 array processor with 1024 bits of local memory per processor. For some cases, researchers can show speedups of three orders of magnitude over serial implementations.

Gualtieri, J. Anthony↗

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Future Generation High Performance Computing Center (FG-HPCC): RFI Technical Considerations

Lawrence Livermore National Security, LLC (LLNS) is interested in receiving information about technologies that could be available in the 2029-2030 timeframe that may serve to enable the vision for a Future Generation High Performance Computing (HPC) Center (FG-HPCC) described in this document. The future HPC Center vision has been conceived to meet the future mission needs of the Advanced Simulation and Computing (ASC) Program within the National Nuclear Security Administration (NNSA). LLNS envisions a center composed not of many independent clusters, but of heterogeneous elements accessible to users as a single system. The capabilities will be integrated to create a scalable, flexible, yet tightly coupled computing center capable of integrated HPC, AI, and cloud-like workloads.

97 MATHEMATICS AND COMPUTING↗

Using Clustering to Establish Climate Regimes from PCM Output

A multivariate statistical clustering technique--based on the k-means algorithm of Hartigan has been used to extract patterns of climatological significance from 200 years of general circulation model (GCM) output. Originally developed and implemented on a Beowulf-style parallel computer constructed by Hoffman and Hargrove from surplus commodity desktop PCs, the high performance parallel clustering algorithm was previously applied to the derivation of ecoregions from map stacks of 9 and 25 geophysical conditions or variables for the conterminous U.S. at a resolution of 1 sq km. Now applied both across space and through time, the clustering technique yields temporally-varying climate regimes predicted by transient runs of the Parallel Climate Model (PCM). Using a business-as-usual (BAU) scenario and clustering four fields of significance to the global water cycle (surface temperature, precipitation, soil moisture, and snow depth) from 1871 through 2098, the authors' analysis shows an increase in spatial area occupied by the cluster or climate regime which typifies desert regions (i.e., an increase in desertification) and a decrease in the spatial area occupied by the climate regime typifying winter-time high latitude perma-frost regions. The patterns of cluster changes have been analyzed to understand the predicted variability in the water cycle on global and continental scales. In addition, representative climate regimes were determined by taking three 10-year averages of the fields 100 years apart for northern hemisphere winter (December, January, and February) and summer (June, July, and August). The result is global maps of typical seasonal climate regimes for 100 years in the past, for the present, and for 100 years into the future. Using three-dimensional data or phase space representations of these climate regimes (i.e., the cluster centroids), the authors demonstrate the portion of this phase space occupied by the land surface at all points in space and time. Any single spot on the globe will exist in one of these climate regimes at any single point in time. By incrementing time, that same spot will trace out a trajectory or orbit between and among these climate regimes (or atmospheric states) in phase (or state) space. When a geographic region enters a state it never previously visited, a climatic change is said to have occurred. Tracing out the entire trajectory of a single spot on the globe yields a 'manifold' in state space representing the shape of its predicted climate occupancy. This sort of analysis enables a researcher to more easily grasp the multivariate behavior of the climate system.

Oglesby, Robert↗

Globular cluster winds with central accretion by a massive compact object or subcluster

Steady-state isothermal wind flows are computed with accretion by a central mass concentration in spherically symmetric systems of gas-losing stars. Solutions are uniquely determined by two dimensionless parameters lambda and m, where lambda is approximately equal to the square of the ratio of the central escape velocity to the sound speed and m is approximately equal to the ratio of the central point mass to the cluster core mass. The models are applied to globular clusters for two types of central mass concentration - a single massive black hole and a subcluster of massive stars. A hard (greater than a keV) X-ray source due to a central black hole fed by clusterwide inflow does not provide a consistent model for globular cluster X-ray sources. However, in the case of hot (T being greater than or approximately equal to 2 x 10 to the 5th K) winds, gas trapping by a central subcluster of neutron stars or of binaries containing white dwarfs could explain recent UV and H-alpha observations. Similar applications to elliptical galaxies are discussed.

Durisen, R. H.↗

On the formation of swelling and related flaws in laser powder bed fusion

Process monitoring in laser powder bed fusion additive manufacturing can provide insights into stochastic anomalies, melt pool and plume dynamics, and part quality. Swelling, a build anomaly where overbuilt material protrudes through the powder layer after recoating, is readily detectable in post-recoat visible light images of the powder bed. Here, this work identifies several of the underlying mechanisms driving swelling formation by analyzing the influence of processing parameters, laser scan paths, and build plate locations on the presence of swelling detected in situ. Swelling near the edge of the part and swelling in the internal region of the part are shown to correlate with different process conditions. Edge and internal swelling may be driven by different phenomena, with edge swelling predominately occurring on the edge of a part facing the laser module and correlated to clusters of near-surface voids (detected with X-ray computed tomography). A larger spot size, higher laser power, and lower scan velocity also increased the presence of edge swelling. Laser spot size and scan path influenced internal swelling, which occurred preferentially with a larger spot size and in regions with large melt pools, caused by localized heat accumulation due to non-optimal processing parameters or scan path strategies. For coupons processed with a slicer-defined maximum scan vector length, swelling seldom occurred at internal vector-stripe boundaries. These results provide a mechanistic understanding of how swelling can be linked to material flaws, insight into how some instances of swelling can be avoided, and evidence supporting the use of swelling as an in situ indicator for quality assurance and part qualification.

Anomaly↗

Quantitative characterization of spatial distribution of particles in materials: Application to materials processing

Most engineering materials contain second phase particles or fibers which serve to reinforce the matrix phase. The effect of reinforcements on material properties is usually analyzed in terms of the average volume fraction and spacing of reinforcements, quantities which are global microstructural characteristics. However, material properties can also depend on local microstructural characteristics; for example, on how uniformly the reinforcing phase is distributed in the material. The analysis method will then be applied to a materials processing problem to discover how processing parameters can be selected to maximize redistribution of the reinforcing phase during processing. Several mathematical analysis methods could be adapted to the problem of characterizing the distribution of particles in materials. A tessellation-based method was selected. In the first phase of the investigation, a software package was written to automate the analysis. Typical results are shown. The analysis technique allows the degree to which particles are clustered together, the size and spacing of particle clusters, and the particle density in clusters to be found. The analysis methods were applied to computer-generated distributions and to a few real particle-containing materials. Methods for analyzing a nonuniform particle distribution in a material can be applied to two broad classes of materials science problems: understanding how the resulting particle distribution affects properties. The analysis method described is applied to a materials processing problem: how to select extrusion conditions to maximize the redistribution of reinforcing particles that are initially nonuniformly distributed. In addition, the tessellation-based method to analyze star distributions in spiral galaxies was adapted, illustrating the diverse types of problems to which the analysis method can be applied.

Parse, J. B.↗

GENIE(++): A Multi-Block Structured Grid System

The computer code GENIE++ is a continuously evolving grid system containing a multitude of proven geometry/grid techniques. The generation process in GENIE++ is based on an earlier version. The process uses several techniques either separately or in combination to quickly and economically generate sculptured geometry descriptions and grids for arbitrary geometries. The computational mesh is formed by using an appropriate algebraic method. Grid clustering is accomplished with either exponential or hyperbolic tangent routines which allow the user to specify a desired point distribution. Grid smoothing can be accomplished by using an elliptic solver with proper forcing functions. B-spline and Non-Uniform Rational B-splines (NURBS) algorithms are used for surface definition and redistribution. The built in sculptured geometry definition with desired distribution of points, automatic Bezier curve/surface generation for interior boundaries/surfaces, and surface redistribution is based on NURBS. Weighted Lagrance/Hermite transfinite interpolation methods, interactive geometry/grid manipulation modules, and on-line graphical visualization of the generation process are salient features of this system which result in a significant time savings for a given geometry/grid application.

Williams, Tonya↗

Parallel NPARC: Implementation and Performance

Version 3 of the NPARC Navier-Stokes code includes support for large-grain (block level) parallelism using explicit message passing between a heterogeneous collection of computers. This capability has the potential for significant performance gains, depending upon the block data distribution. The parallel implementation uses a master/worker arrangement of processes. The master process assigns blocks to workers, controls worker actions, and provides remote file access for the workers. The processes communicate via explicit message passing using an interface library which provides portability to a number of message passing libraries, such as PVM (Parallel Virtual Machine). A Bourne shell script is used to simplify the task of selecting hosts, starting processes, retrieving remote files, and terminating a computation. This script also provides a simple form of fault tolerance. An analysis of the computational performance of NPARC is presented, using data sets from an F/A-18 inlet study and a Rocket Based Combined Cycle Engine analysis. Parallel speedup and overall computational efficiency were obtained for various NPARC run parameters on a cluster of IBM RS6000 workstations. The data show that although NPARC performance compares favorably with the estimated potential parallelism, typical data sets used with previous versions of NPARC will often need to be reblocked for optimum parallel performance. In one of the cases studied, reblocking increased peak parallel speedup from 3.2 to 11.8.

Townsend, S. E.↗

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗

Phase-Retrieval Uncertainty Estimation and Algorithm Comparison for the JWST-ISIM Test Campaign

Phase retrieval, the process of determining the exitpupil wavefront of an optical instrument from image-plane intensity measurements, is the baseline methodology for characterizing the wavefront for the suite of science instruments (SIs) in the Integrated Science Instrument Module (ISIM) for the James Webb Space Telescope (JWST). JWST is a large, infrared space telescope with a 6.5-meter diameter primary mirror. JWST is currently NASA's flagship mission and will be the premier space observatory of the next decade. ISIM contains four optical benches with nine unique instruments, including redundancies. ISIM was characterized at the Goddard Space Flight Center (GSFC) in Greenbelt, MD in a series of cryogenic vacuum tests using a telescope simulator. During these tests, phase-retrieval algorithms were used to characterize the instruments. The objective of this paper is to describe the Monte-Carlo simulations that were used to establish uncertainties (i.e., error bars) for the wavefronts of the various instruments in ISIM. Multiple retrieval algorithms were used in the analysis of ISIM phase-retrieval focus-sweep data, including an iterativetransform algorithm and a nonlinear optimization algorithm. These algorithms emphasize the recovery of numerous optical parameters, including low-order wavefront composition described by Zernike polynomial terms and high-order wavefront described by a point-by-point map, location of instrument best focus, focal ratio, exit-pupil amplitude, the morphology of any extended object, and optical jitter. The secondary objective of this paper is to report on the relative accuracies of these algorithms for the ISIM instrument tests, and a comparison of their computational complexity and their performance on central and graphical processing unit clusters. From a phase-retrieval perspective, the ISIM test campaign includes a variety of source illumination bandwidths, various image-plane sampling criteria above and below the Nyquist- Shannon critical sampling value, various extended object sizes, and several other impactful effects.

Design Analysis↗

Software Testing and Verification in Climate Model Development

Over the past 30 years most climate models have grown from relatively simple representations of a few atmospheric processes to a complex multi-disciplinary system. Computer infrastructure over that period has gone from punch card mainframes to modem parallel clusters. Model implementations have become complex, brittle, and increasingly difficult to extend and maintain. Existing verification processes for model implementations rely almost exclusively upon some combination of detailed analysis of output from full climate simulations and system-level regression tests. In additional to being quite costly in terms of developer time and computing resources, these testing methodologies are limited in terms of the types of defects that can be detected, isolated and diagnosed. Mitigating these weaknesses of coarse-grained testing with finer-grained "unit" tests has been perceived as cumbersome and counter-productive. In the commercial software sector, recent advances in tools and methodology have led to a renaissance for systematic fine-grained testing. We discuss the availability of analogous tools for scientific software and examine benefits that similar testing methodologies could bring to climate modeling software. We describe the unique challenges faced when testing complex numerical algorithms and suggest techniques to minimize and/or eliminate the difficulties.

Clune, Thomas L.↗