SEARCH · Search NASA

Results for “Cluster Computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 847 records · Page 47

All sources NASA NTRS DOE OSTI

NASA NTRS1992

The fuzzy C spherical shells algorithm - A new approach

The fuzzy c spherical shells (FCSS) algorithm is specially designed to search for clusters that can be described by circular arcs or, more generally, by shells of hyperspheres. In this paper, a new approach to the FCSS algorithm is presented. This algorithm is computationally and implementationally simpler than other clustering algorithms that have been suggested for this purpose. An unsupervised algorithm which automatically finds the optimum number of clusters is also proposed. This algorithm can be used when the number of clusters is not known. It uses a cluster validity measure to identify good clusters, merges all compatible clusters, and eliminates spurious clusters to achieve the final result. Experimental results on several data sets are presented.

Krishnapuram, Raghu↗

NASA NTRS1992

A comparison of neural network and fuzzy clustering techniques in segmenting magnetic resonance images of the brain

Magnetic resonance (MR) brain section images are segmented and then synthetically colored to give visual representations of the original data with three approaches: the literal and approximate fuzzy c-means unsupervised clustering algorithms and a supervised computational neural network, a dynamic multilayered perception trained with the cascade correlation learning algorithm. Initial clinical results are presented on both normal volunteers and selected patients with brain tumors surrounded by edema. Supervised and unsupervised segmentation techniques provide broadly similar results. Unsupervised fuzzy algorithms were visually observed to show better segmentation when compared with raw image data for volunteer studies. However, for a more complex segmentation problem with tumor/edema or cerebrospinal fluid boundary, where the tissues have similar MR relaxation behavior, inconsistency in rating among experts was observed.

Hall, Lawrence O.↗

NASA NTRS2000

Climate Ocean Modeling on a Beowulf Class System

With the growing power and shrinking cost of personal computers. the availability of fast ethernet interconnections, and public domain software packages, it is now possible to combine them to build desktop parallel computers (named Beowulf or PC clusters) at a fraction of what it would cost to buy systems of comparable power front supercomputer companies. This led as to build and assemble our own sys tem. specifically for climate ocean modeling. In this article, we present our experience with such a system, discuss its network performance, and provide some performance comparison data with both HP SPP2000 and Cray T3E for an ocean Model used in present-day oceanographic research.

Cheng, B. N.↗

NASA NTRS2004

TopMaker: A Technique for Automatic Multi-Block Topology Generation Using the Medial Axis

A two-dimensional multi-block topology generation technique has been developed. Very general configurations are addressable by the technique. A configuration is defined by a collection of non-intersecting closed curves, which will be referred to as loops. More than a single loop implies that holes exist in the domain, which poses no problem. This technique requires only the medial vertices and the touch points that define each vertex. From the information about the medial vertices, the connectivity between medial vertices is generated. The physical shape of the medial edge is not required. By applying a few simple rules to each medial edge, the multiblock topology is generated with no user intervention required. The resulting topologies contain only the level of complexity dictated by the configurations. Grid lines remain attached to the boundary except at sharp concave turns where a change in index family is introduced as would be desired. Keeping grid lines attached to the boundary is especially important in the area of computational fluid dynamics where highly clustered grids are used near no-slip boundaries. This technique is simple and robust and can easily be incorporated into the overall grid generation process.

Heidmann, James D.↗

NASA NTRS2004

TopMaker: Technique Developed for Automatic Multiblock Topology Generation Using the Medial Axis

The TopMaker technique was developed in an effort to reduce the time required for grid generation in complex numerical studies. Topology generation accounts for much of the man-hours required for structured multiblock grids. With regard to structured multiblock grids, topology refers to how the blocks are arranged and connected. A two-dimensional multiblock topology generation technique has been developed at the NASA Glenn Research Center. Very general configurations can be addressed by the technique. A configuration is defined by a collection of non-intersecting closed curves, which will be referred to as loops. More than a single loop implies that holes exist in the domain, which poses no problem. This technique requires only the medial vertices and the touch points that define each vertex. From the information about the medial vertices, the connectivity between medial vertices is generated. The physical shape of the medial edge is not required. By applying a few simple rules to each medial edge, a multiblock topology can be generated without user intervention. The resulting topologies contain only the level of complexity dictated by the configurations. Grid lines remain attached to the boundary except at sharp concave turns, where a change in index family is introduced as would be desired. Keeping grid lines attached to the boundary is especially important in computational fluid dynamics, where highly clustered grids are used near no-slip boundaries. This technique is simple and robust and can easily be incorporated into the overall grid-generation process.

Rigby, David L.↗

NASA NTRS2014

Dynamic Airspace Configuration

In air traffic management systems, airspace is partitioned into regions in part to distribute the tasks associated with managing air traffic among different systems and people. These regions, as well as the systems and people allocated to each, are changed dynamically so that air traffic can be safely and efficiently managed. It is expected that new air traffic control systems will enable greater flexibility in how airspace is partitioned and how resources are allocated to airspace regions. In this talk, I will begin by providing an overview of some previous work and open questions in Dynamic Airspace Configuration research, which is concerned with how to partition airspace and assign resources to regions of airspace. For example, I will introduce airspace partitioning algorithms based on clustering, integer programming optimization, and computational geometry. I will conclude by discussing the development of a tablet-based tool that is intended to help air traffic controller supervisors configure airspace and controllers in current operations.

airspace↗

NASA NTRS2019

Cluster Analysis of Spectroscopic Line Profiles and EUV Emission in RMHD Simulations and Observations of the Solar Atmosphere

Spatially-resolved observations from the IRIS, SDO/AIA, and other space mission and ground-based telescopes, coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar atmosphere. To better understand the dynamical and thermodynamic properties in the simulation data and their connection to observations, it is essential to determine similarities in the behaviors of the synthesized and observed emission. However, the complexity of observational data and physical processes makes comparison of observations and modeling results difficult. In this work, we show the initial results of application of K-Means clustering (unsupervised machine learning) algorithm to two different problems: 1) recognition of the typical spectroscopic line profiles observed by IRIS during solar flares and their typical dynamic behavior; 2) recognition of shocks and heating events in synthetic AIA emission data obtained from StellarBox quiet-Sun simulations. The average silhouette width technique for the KMeans algorithm is utilized in different ways to obtain optimal numbers of clusters. We discuss application of the emission clustering to visualizations of the computational volume, understanding its evolutionary trends and behavior patterns, and inversion (reconstruction) of physical properties of the solar atmosphere from synthesizes emission data.

Sadykov, Viacheslav↗

NASA NTRS2022

Observational Signatures of Coronal Heating in Magnetohydrodynamic Simulations without Radiation or a Lower Atmosphere

It is extremely difficult to simulate the details of coronal heating and also make meaningful predictions of the emitted radiation. Thus, testing realistic models with observations is a major challenge. Observational signatures of coronal heating depend crucially on radiation, thermal conduction, and the exchange of mass and energy with the transition region and chromosphere below. Many magnetohydrodynamic simulation studies do not include these effects, opting instead to devote computational resources to the magnetic aspects of the problem. We have developed a simple method of accounting approximately for the missing effects. It is applied to the simulation output ex post facto and therefore may be a valuable tool for many studies. We have used it to predict the emission from a model corona that is driven by vortical boundary motions meant to represent photospheric convection. We find that individual magnetic strands experience short-term brightenings, both scattered throughout the computational volume and in localized clusters. The former may explain the diffuse component of the observed corona, while the latter may explain bright coronal loops. Several observed properties of loops are reproduced reasonably well: width, lifetime, and quasi-circular cross section (aspect ratio not high). Our results lend support to the idea that loops are multistranded structures heated by "storms" of nanoflares.

James A. Klimchuk↗

DOE OSTI2015

Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

Smith, IV, Amos M↗

DOE OSTI2017

The FabrIc for Frontier Experiments Project at Fermilab: Computing for Experiments

The FabrIc for Frontier Experiments (FIFE) project is a major initiative within the Fermilab Scientific Computing Division designed to steer the computing model for non-LHC experiments at Fermilab. The FIFE project enables close collaboration between experimenters and computing professionals to serve high-energy physics experiments of differing scope and physics area of study. The project also tracks and provides feedback on the development of common tools for job submission, identity management, software and data distribution, job monitoring, and databases for project tracking. The computing needs of the experiments under the FIFE umbrella continue to increase, and present a complex list of requirements to their service providers. To meet these requirements, recent advances in the FIFE toolset include a new identity management infrastructure, significantly upgraded job monitoring tools, and a workflow management system. We have also upgraded existing tools to access remote computing resources such as GPU clusters and sites outside the United States. We will present these recent advances, highlight the nature of collaboration between the diverse set of experimenters and service providers, and discuss the project's future directions.

43 PARTICLE ACCELERATORS↗

DOE OSTI2017

ML-GA

ML-GA is a software that can be used to expedite design optimization process combining machine learning and genetic algorithm approaches. It employs a machine learning (ML) model (any ML algorithm can be incorporated) to predict the quality (merit) of a design from the input parameters. Then, a stochastic global optimization genetic algorithm (GA) is used, with the machine learning model as the objective function, to optimize the input parameters based on the merit function. ML-GA is scalable to higher computational platforms like supercomputers and clusters enabling optimization to be performed in significantly short time frames (e.g., in a day).

PAL, PINAKI↗

DOE OSTI2019

Accelerating the Global Arrays ComEx Runtime using Multiple Progress Ranks

Partitioned Global Address Space (PGAS) models are part of system software that are being designed to support communication runtime for exascale applications. Suitability of using MPI as a scalable PGAS communication subsystem has been shown as a viable option due to its standardization and higher performance. We used MPI two-sided semantics with a combination of automatic and user defined splitting of MPI communicators to achieve asynchronous progress. Our implementation can make use of multiple asynchronous progress ranks (PR) per node that can be mapped to the computing architecture of a node in a distributed cluster. We are able to show significant speed up of over 2.0X and scaling of communication bound computational chemistry application over 1024 nodes of state- of-the-art HPC clusters. Our results show that while running a communication bound application workload on a certain number of cluster nodes, a use of optimum number of ranks dedicated for communication may be used to achieve asynchronous communication progress and obtain highest performance.

PGAS, global-arrays, NWCHEM, NWChemEx, HPC, GPGPU↗

DOE OSTI2014

Quantum partition functions of composite particles in a hydrogen-helium plasma via path integral Monte Carlo

We compute two- and three-body cluster functions that describe contributions of composite entities, like hydrogen atoms, ions H{sup −}, H{sub 2}{sup +}, and helium atoms, and also charge-charge and atom-charge interactions, to the equation of state of a hydrogen-helium mixture at low density. A cluster function has the structure of a truncated virial coefficient and behaves, at low temperatures, like a usual partition function for the composite entity. Our path integral Monte Carlo calculations use importance sampling to sample efficiently the cluster partition functions even at low temperatures where bound state contributions dominate. We also employ a new and efficient adaptive discretization scheme that allows one not only to eliminate Coulomb divergencies in discretized path integrals, but also to direct the computational effort where particles are close and thus strongly interacting. The numerical results for the two-body function agree with the analytically known quantum second virial coefficient. The three-body cluster functions are compared at low temperatures with familiar partition functions for composite entities.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1989

Report from magnetospheric science

By the early 1990s, magnetospheric physics will have progressed primarily through observations made from Explorer-class spacecraft, sounding rockets, ground based facilities, and shuttle based experiments. The global geospace science (GGS) element of the International Solar Terrestrial Physics program, when combined with contributions to the ESA Cluster mission and ground based and computer modeling programs, will form the basis for a major U.S. initiative in magnetospheric physics. The scientific objectives of the GGS program involve the study of energy transport throughout geospace. The Cluster mission will investigate turbulence and boundary phenomena in geospace, particularly at high latitudes on the dayside and in the region of the neutral sheet at geocentric distances of about 20 earth radii on the night side of the earth. The current state of knowledge is reviewed and the goals of these missions are briefly discussed.

Burch, J. L.↗

NASA NTRS1975

Computer-aided analysis of Landsat-1 MSS data - A comparison of three approaches, including a 'modified clustering' approach

Three approaches for analyzing Landsat-1 data from Ludwig Mountain in the San Juan Mountain range in Colorado are considered. In the 'supervised' approach the analyst selects areas of known spectral cover types and specifies these to the computer as training fields. Statistics are obtained for each cover type category and the data are classified. Such classifications are called 'supervised' because the analyst has defined specific areas of known cover types. The second approach uses a clustering algorithm which divides the entire training area into a number of spectrally distinct classes. Because the analyst need not define particular portions of the data for use but has only to specify the number of spectral classes into which the data is to be divided, this classification is called 'nonsupervised'. A hybrid method which selects training areas of known cover type but then uses the clustering algorithm to refine the data into a number of unimodal spectral classes is called the 'modified-supervised' approach.

Fleming, M. D.↗

DOE OSTI2015

Hartree-Fock calculation of the differential photoionization cross sections of small Li clusters

Cross sections and angular distribution parameters for the single-photon ionization of all electron orbitals of Li{sub 2−8} are systematically computed in a broad interval of the photoelectron kinetic energies for the energetically most stable geometry of each cluster. Calculations of the partial photoelectron continuum waves in clusters are carried out by the single center method within the Hartree-Fock approximation. We study photoionization cross sections per one electron and analyze in some details general trends in the photoionization of inner and outer shells with respect to the size and geometry of a cluster. The present differential cross sections computed for Li{sub 2} are in a good agreement with the available theoretical data, whereas those computed for Li{sub 3−8} clusters can be considered as theoretical predictions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Novel Wavefunction Approaches for Studying Actinides and Other Heavy Elements (Final Report (2012-2020))

The theoretical characterization of actinide molecules is a crucial complement to their experimental study; actinides are vital to issues of national security and energy, but they are expensive and hazardous to study experimentally. However, because actinides contain a large number of electrons and are often strongly correlated, their theoretical description is difficult. We have had success studying actinide chemistry and physics using density functional theoretical approaches over the past several years, but we have found that such methods are incapable of treating strong correlations adequately. We thus shifted our research focus to the development of tractable wavefunction methods for strong correlations of actinides. Our early wavefunction-based approaches focused on extending symmetry-adapted, single-reference coupled cluster for treating strong correlations with feasible computational cost. While we have had some success along these lines, we have recently developed spin-projected unrestricted coupled cluster, which is essentially a black-box multi-reference coupled cluster theory that is superior to unrestricted coupled cluster for small- to medium-sized systems across practically all physical correlation strengths, yet preserves good quantum numbers. For actinides, however, where spin-orbit coupling is often nonnegligible, spin is no longer a fundamental symmetry. We thus propose to develop time reversal and point group projected coupled cluster, which will preserve the fundamental symmetries for actinides. Time reversal projection is achieved via the product of half-spin projection, or spin flip, and complex conjugation projection. Along with point group, these are discrete symmetries, i.e. non-continuous quantum numbers, which, in addition to being the correct symmetries for actinides, can be implemented in lower computational cost than full spin projection. We propose the development of these theories within a synergistic collaboration to use the new methods to elucidate difficult actinide chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

A circuit-generated quantum subspace algorithm for the variational quantum eigensolver

Recent research has shown that wavefunction evolution in real and imaginary time can generate quantum subspaces with significant utility for obtaining accurate ground state energies. Inspired by these methods, we propose combining quantum subspace techniques with the variational quantum eigensolver (VQE). In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies. We call this technique the circuit subspace variational quantum eigensolver (CSVQE) algorithm. By benchmarking CSVQE on a range of quantum chemistry problems, we show that it can achieve significant error reduction in the best case compared to conventional VQE, particularly for poorly optimized circuits, greatly improving convergence rates. Furthermore, we demonstrate that when applied to circuits trapped at local minima, CSVQE can produce energies close to the global minimum of the energy landscape, making it a potentially powerful tool for diagnosing local minima.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗