SEARCH · Engineering Papers

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 487 records · Page 27

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Intelligent robots for planetary exploration and construction

Robots capable of practical applications in planetary exploration and construction will require realtime sensory-interactive goal-directed control systems. A reference model architecture based on the NIST Real-time Control System (RCS) for real-time intelligent control systems is suggested. RCS partitions the control problem into four basic elements: behavior generation (or task decomposition), world modeling, sensory processing, and value judgment. It clusters these elements into computational nodes that have responsibility for specific subsystems, and arranges these nodes in hierarchical layers such that each layer has characteristic functionality and timing. Planetary exploration robots should have mobility systems that can safely maneuver over rough surfaces at high speeds. Walking machines and wheeled vehicles with dynamic suspensions are candidates. The technology of sensing and sensory processing has progressed to the point where real-time autonomous path planning and obstacle avoidance behavior is feasible. Map-based navigation systems will support long-range mobility goals and plans. Planetary construction robots must have high strength-to-weight ratios for lifting and positioning tools and materials in six degrees-of-freedom over large working volumes. A new generation of cable-suspended Stewart platform devices and inflatable structures are suggested for lifting and positioning materials and structures, as well as for excavation, grading, and manipulating a variety of tools and construction machinery.

Albus, James S.↗

NASA NTRS1994

The determination of the core mass at the helium flash in globular cluster stars

Evolutionary sequences for the red giant branch (RGB) phase of a representative globular cluster star have been computed in order to investigate the reliability of the current canonical values of the core mass M(sub c) at the helium flash. These computations were motivated by recent suggestions that the canonical values of M(sub c) may be systematically too small due to the numerical algorithms for shifting the hydrogen shell and advancing the chemical composition during the RGB phase. Our results show that these algorithms do not, in fact, introduce a significant error in the values of M(sub c). Moreover, we demonstrate that a procedure for advancing the chemical composition which is implicit only in the hydrogen abundance will systematically underestimate the amount of hydrogen fuel consumption between RGB models and therefore should not be used in RGB computations. Overall we estimate the uncertainty in the core masses of Sweigart & Gross (1978) due to numerical effects to be approximately equals 0.003 solar mass. From a consideration of the available canonical models we conclude that a change in the canonical values of M(sub c) by a few 10(exp -2) solar mass would require either a substantial change in the canonical input physics or some noncanonical effect such as rotation. Finally our models show that the use of short time steps can significantly increase the extent of the inner tail of the hydrogen shell. This effect may enhance the likelihood of hydrogen mixing following a helium shell flash in an asymptotic giant branch star.

Sweigart, Allen V.↗

NASA NTRS1994

On the Interaction of CO and NH3 with BH3 and BF3

BH3CO, BF3CO, BH3NH3, and BF3NH3 have been studied using density functional theory (DFT). The computed geometries are in reasonable agreement with experiment. BF3CO is found to be weakly bound. The binding energies of BH3CO, BH3NH3 , and BF3NH3 have also been computed using the coupled cluster singles and doubles level of theory, including a perturbational estimate of the connected triples [CCSD(T)]. These CCSD(T) calculations are performed using correlation consistent polarized-valence triple-zeta basis sets. These are expected to be the most accurate binding energies to date. The DFT binding energies are in good agreement with those obtained at the CCSD(T) level. The bonding is analyzed using the constrained space orbital variation (CSOV) technique. In addition to analyzing the bonding in BH3CO, BH3NH3, and BF3NH3, the CSOV approach is used to study why the bonding in BF3CO is so weak.

Bauschlicher, Charles W., Jr.↗

NASA NTRS2002

Experiences Using OpenMP Based on Compiler Directed Software DSM on a PC Cluster

In this work we report on our experiences running OpenMP (message passing) programs on a commodity cluster of PCs (personal computers) running a software distributed shared memory (DSM) system. We describe our test environment and report on the performance of a subset of the NAS (NASA Advanced Supercomputing) Parallel Benchmarks that have been automatically parallelized for OpenMP. We compare the performance of the OpenMP implementations with that of their message passing counterparts and discuss performance differences.

Hess, Matthias↗

NASA NTRS2005

Enhancements to PVM's BEOLIN architecture

.4.3 of PVM had previously been enhanced by the addition of a new architecture, BEOLIN, which allowed a PVM user to abstract a Beowulf class computer with a private network to appear as a single system, visible to the outside world, which could spawn tasks on different internal nodes.

BEOLIN↗

NASA NTRS2008

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗

DOE OSTI2020

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗

NASA NTRS1986

Head-on binary collisions in globular clusters

Collision probabilities between identical binaries of three different binding energies are computed for binaries in the cores of globular clusters. The more tightly bound a binary is, the smaller the chance is that it suffers a collision. It is found that a given binary in a globular cluster core probably does not suffer more than a very few collisions. If it is not broken up into single stars, it will become so tightly bound that collisions involving it are very rare. Since it is found that head-on collisions are so rare, the collisions which are probably more important in affecting the evolution of the cluster core are the long-range (large impact parameter) encounters.

Hoffer, James B.↗

NASA NTRS1994

Visualization of unsteady computational fluid dynamics

A brief summary of the computer environment used for calculating three dimensional unsteady Computational Fluid Dynamic (CFD) results is presented. This environment requires a super computer as well as massively parallel processors (MPP's) and clusters of workstations acting as a single MPP (by concurrently working on the same task) provide the required computational bandwidth for CFD calculations of transient problems. The cluster of reduced instruction set computers (RISC) is a recent advent based on the low cost and high performance that workstation vendors provide. The cluster, with the proper software can act as a multiple instruction/multiple data (MIMD) machine. A new set of software tools is being designed specifically to address visualizing 3D unsteady CFD results in these environments. Three user's manuals for the parallel version of Visual3, pV3, revision 1.00 make up the bulk of this report.

Haimes, Robert↗

DOE OSTI2025

COLUMBUS─An Efficient and General Program Package for Ground and Excited State Computations Including Spin–Orbit Couplings and Dynamics

The COLUMBUS program system provides the tools for performing high-level multireference (MR) computations, including the multireference configuration interaction (MRCI) method and its multireference averaged quadratic coupled cluster (MR-AQCC) extension, allowing computations on a wide range of fascinating atomic and molecular systems, including the treatment of open-shells and complicated excited state phenomena. The inclusion of spin−orbit coupling (SOC) directly within the MRCI step enables the description of systems containing heavy elements, such as lanthanides and actinides, whose properties are strongly influenced by SOC. Analytic energy gradients and nonadiabatic couplings at the correlated MRCI level provide the foundation for a variety of dynamics studies, giving insight into ultrafast photochemistry. New and ongoing method developments in COLUMBUS include the computation of spin densities, improved descriptions of ionic states, enhancements to the AQCC method, and the porting of COLUMBUS to graphical processing units (GPUs). New external interfaces enable an enhanced description of electronic resonances and molecules in strong laser fields. This work highlights these new developments while providing a detailed account of the diverse applications of COLUMBUS in recent years.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2019

Probing catalytic activity in defect sites in transition metal oxides and sulfides using cluster models: A combined experimental and theoretical approach

Our research program has combined experimental and computational methods to study a range of cluster models for heterogeneous catalytic materials. The focus of our studies has been transition metal oxide and sulfide clusters in non-traditional oxidation states, and their chemical and physical interactions with water, to model steps in the electrocatalytic or photocatalytic hydrogen evolution reaction (HER). In the closing year of this project, we have also begun to explore addition systems in preparation for future grant proposals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1981

Evaluation of SLAR and thematic mapper MSS data for forest cover mapping using computer-aided analysis techniques

Supervised and cluster block training statistics were used to analyze the thematic mapper simulation MSS data (both 1979 and 1980 data sets). Cover information classes identified on SAR imagery include: hardwood, pine, mixed pine hardwood, clearcut, pasture, crops, emergent crops, bare soil, urban, and water. Preliminary analysis of the HH and HV polarized SAR data indicate a high variance associated with each information class except for water and bare soil. The large variance for most spectral classes suggests that while the means might be statistically separable, an overlap may exist between the classes which could introduce a significant classification error. The quantitative values of many cover types are much larger on the HV polarization than on the HH, thereby indicating the relative nature of the digitized data values. The mean values of the spectral classes in the areas with larger look angles are greater than the means of the same cover type in other areas having steeper look angles. Difficulty in accurately overlaying the dual polarization of the SAR data was resolved.

Hoffer, R. M.↗

NASA NTRS2010

Device and method to enhance availability of cluster-based processing systems

An electronic computing device including at least one processing unit that implements a specific fault signal upon experiencing an associated fault, a control unit that generates a specific recovery signal upon receiving the fault signal from the at least one processing unit, and at least one input memory unit. The recovery signal initiates specific recovery processes in the at least one processing unit. The input memory buffers input data signals input to the at least one processing unit that experienced the fault during the recovery period.

Lupia, David J.↗

DOE OSTI2024

Deprotonated sulfamic acid and its homodimers: Does sulfamic acid adopt zwitterion during cluster growth?

Here we present a joint experimental and computational study on the geometric and electronic structures of deprotonated sulfamic acid (SA) clusters [(SA) n –H] – (n = 1, 2) employing negative ion photoelectron spectroscopy and high-level ab initio calculations. The photoelectron spectra provide the vertical/adiabatic detachment energy (VDE/ADE) of the sulfamate anion (SM – ) H 2 N•SO 3 – at 4.85 ± 0.05 and 4.58 ± 0.08 eV, respectively, and the VDE and ADE of the SM – •SA dimer at 6.41 ± 0.05 and 5.87 ± 0.08 eV, respectively. The significantly increased electron binding energies of the dimer confirm the enhanced electronic stability upon the addition of one SA molecule. The CCSD(T)-predicted VDEs/ADEs agree excellently with the experimental data, confirming the identified structures as the most stable ones. Two types of dimer isomers possessing different hydrogen bonding (HB) motifs are identified, corresponding to SM – binding to a zwitterionic SA (SM – •SA z ) and a canonical SA (SM – •SA c ), respectively. Two N–H$\cdots$O HBs and one superior O–H$\cdots$O HB are formed in the lowest-lying SM – •SA c , while SM – •SA z has three moderate N–H$\cdots$O HBs, with the former being 4.71 kcal/mol more stable. Further theoretical analyses reveal that the binding strength advantage of SM – •SA c over SM – •SA z arises from its significant contributions of orbital interactions between fragments, illustrating that sulfamate strongly interacts with its parent SA acid and preferably chooses the canonical SA in the subsequent cluster formations. Given the prominent presence of SA, this study provides the first evidence that the canonical dimer model of sulfamic acid should exist as a superior configuration during cluster growth.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Beyond real: alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers

Near-term quantum devices require wavefunction ansätze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While the unitary coupled cluster ansatz (e.g., UCCSD) has become a standard, the high gate count associated with the implementation of this limits its feasibility on noisy intermediate-scale quantum (NISQ) hardware. k -Fold unitary cluster Jastrow (uCJ) ansätze mitigate this challenge by providing O( kN 2 ) circuit scaling and favorable linear depth circuit implementation. Previous work has focused on the real orbitalrotation (Re-uCJ) variant of uCJ, which allows an exact (Trotter-free) implementation. Here we extend and generalize the k -fold uCJ framework by introducing two new variants, Im-uCJ and g-uCJ, which incorporate imaginary and fully complex orbital rotation operators, respectively. Similar to Re-uCJ, both of the new variants achieve quadratic gate-count scaling. Our results focus on the simplest k = 1 model, and show that the uCJ models frequently maintain energy errors within chemical accuracy (∼1 kcal mol −1 ). Both g-uCJ and Im-uCJ are more expressive in terms of capturing electron correlation and are also more accurate than the earlier Re-uCJ ansatz. We further show that Im-uCJ and g-uCJ circuits can also be implemented exactly, without any Trotter decomposition. Numerical tests using k = 1 on H 2 , H 3 + , Be 2 , C 2 H 4 , C 2 H 6 and C 6 H 6 in various basis sets confirm the practical feasibility of these shallow Jastrow-based ansätze for applications on near-term quantum hardware.

Tkachenko, Nikolay V. [University of California, B↗

DOE OSTI2022

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

The Development of Two Science Investigator-led Processing Systems (SIPS) for NASA's Earth Observation System (EOS)

In 2001, NASA Goddard Space Flight Center's Laboratory for Terrestrial Physics started the construction of a science Investigator-led Processing System (SIPS) for processing data from the Ozone Monitoring Instrument (OMI) which will launch on the Aura platform in mid 2004. The Ozone Monitoring Instrument (OMI) is a contribution of the Netherlands Agency for Aerospace Programs (NIVR) in collaboration with the Finnish Meteorological Institute (FMI) to the Earth Observing System (EOS) Aura mission. It will continue the Total Ozone Monitoring System (TOMS) record for total ozone and other atmospheric parameters related to ozone chemistry and climate. OMI measurements will be highly synergistic with the other instruments on the EOS Aura platform. The LTP previously developed the Moderate Resolution Imaging Spectrometer (MODIS) Data Processing System (MODAPS), which has been in full operations since the launches of the Terra and Aqua spacecrafts in December, 1999 and May, 2002 respectively. During that time, it has continually evolved to better support the needs of the MODIS team. We now run multiple instances of the system managing faster than real time reprocessings of the data as well as continuing forward processing. The new OMI Data Processing System (OMIDAPS) was adapted from the MODAPS. It will ingest raw data from the satellite ground station and process it to produce calibrated, geolocated higher level data products. These data products will be transmitted to the Goddard Distributed Active Archive Center (GDAAC) instance of the Earth Observing System (EOS) Data and Information System (EOSDIS) for long term archive and distribution to the public. The OMIDAPS will also provide data distribution to the OMI Science Team for quality assessment, algorithm improvement, calibration, etc. We have taken advantage of lessons learned from the MODIS experience and software already developed for MODIS. We made some changes in the hardware system organization, database and software to adapt the system for OMI. We replaced the fundamental database system, Sybase, with an Open Source RDBMS called PostgreSQL, and based the entire OMIDAPS on a cluster of Linux based commodity computers rather than the large SGI servers that MODAPS uses. Rather than relying on a central I/O server host, the new system distributes its data archive among multiple server hosts in the cluster. OMI is also customizing the graphical user interfaces and reporting structure to more closely meet the needs of the OMI Science Team. Prior to 2003, simulated OMI data and the science algorithms were not ready for production testing. We initially constructed a prototype system and tested using a 25 year dataset of Total Ozone Mapping Spectrometer (TOMS) and Solar Backscatter Ultraviolet Instrument (SBUV) data. This prototype system provided a platform to support the adaptation of the algorithms for OMI, and provided reprocessing of the historical data aiding in its analysis. In a recent reanalysis of the TOMS data, the OMIDAPS processed 108,000 full orbits of data through 4 processing steps per orbit, producing about 800,000 files (400 GiB) of level 2 and greater data files. More recently we have installed two instances of the OMIDAPS for integration and testing of OM1 science processes as they get delivered from the Science Team. A Test instance of the OMIDAPS has also supported a series of "Interface Confidence Tests" (ICTs) and End-to-End Ground System tests to ensure the launch readiness of the system. This paper will discuss the high-level hardware, software, and database organization of the OMIDAPS and how it builds on the MODAPS heritage system. It will also provide an overview of the testing and implementation of the production OMIDAPS.

Tilmes, Curt↗