Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Multiple processors”

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 703 records · Page 39

Monte Carlo explicitly correlated second-order many-body perturbation theory

A stochastic algorithm is proposed and implemented that computes a basis-set-incompleteness (F12) correction to an ab initio second-order many-body perturbation energy as a short sum of 6- to 15-dimensional integrals of Gaussian-type orbitals, an explicit function of the electron-electron distance (geminal), and its associated excitation amplitudes held fixed at the values suggested by Ten-no. The integrals are directly evaluated (without a resolution-of-the-identity approximation or an auxiliary basis set) by the Metropolis Monte Carlo method. Applications of this method to 17 molecular correlation energies and 12 gas-phase reaction energies reveal that both the nonvariational and variational formulas for the correction give reliable correlation energies (98% or higher) and reaction energies (within 2 kJ mol -1 with a smaller statistical uncertainty) near the complete-basis-set limits by using just the aug-cc-pVDZ basis set. The nonvariational formula is found to be 2–10 times less expensive to evaluate than the variational one, though the latter yields energies that are bounded from below and is, therefore, slightly but systematically more accurate for energy differences. Being capable of using virtually any geminal form, the method confirms the best overall performance of the Slater-type geminal among 6 forms satisfying the same cusp conditions. Lastly, not having to precompute lower-dimensional integrals analytically, to store them on disk, or to transform them in a nonscalable dense-matrix-multiplication algorithm, the method scales favorably with both system size and computer size; the cost increases only as O(n 4 ) with the number of orbitals (n), and its parallel efficiency reaches 99.9% of the ideal case on going from 16 to 4096 computer processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advanced communications technologies for image processing

It is essential for image analysts to have the capability to link to remote facilities as a means of accessing both data bases and high-speed processors. This can increase productivity through enhanced data access and minimization of delays. New technology is emerging to provide the high communication data rates needed in image processing. These developments include multi-user sharing of high bandwidth (60 megabits per second) Time Division Multiple Access (TDMA) satellite links, low-cost satellite ground stations, and high speed adaptive quadrature modems that allow 9600 bit per second communications over voice-grade telephone lines.

Likens, W. C.↗

Experimenting With Multiprocessor Simulator Concepts

Multiple microcomputer system used to investigate application of parallel processing to real-time simulation. With dual-base architecture, each microcomputer communicates with corresponding microcomputer on opposite bus through dual-port interface memory. Transfers of data to and from front-end processor occur on interactive information bus. Transfers of data related to simulation calculations occur on real-time-information bus. System, called the real-time multiprocessor simulator (RTMPS), is tool for developing low-cost, portable, user-friendly simulators.

Blech, Richard A.↗

ACTS Ka-Band Earth Stations: Technology, Performance, and Lessons Learned

The Advanced Communications Technology Satellite (ACTS) Project invested heavily in prototype Ka-band satellite ground terminals to conduct an experiments program with the ACTS satellite. The ACTS experiment's program proposed to validate Ka-band satellite and ground station technology. demonstrate future telecommunication services. demonstrate commercial viability and market acceptability of these new services, evaluate system networking and processing technology, and characterize Ka-band propagation effects, including development of techniques to mitigate signal fading. This paper will present a summary of the fixed ground terminals developed by the NASA Glenn Research Center and its industry partners, emphasizing the technology and performance of the terminals (Part 1) and the lessons learned throughout their six year operation including the inclined orbit phase of operations (Full Report). An overview of the Ka-band technology and components developed for the ACTS ground stations is presented. Next. the performance of the ground station technology and its evolution during the ACTS campaign are discussed to illustrate the technical tradeoffs made during the program and highlight technical advances by industry to support the ACTS experiments program and terminal operations. Finally. lessons learned during development and operation of the user terminals are discussed for consideration of commercial adoption into future Ka-band systems. The fixed ground stations used for experiments by government, academic, and commercial entities used reflector based offset-fed antenna systems ranging in size from 0.35m to 3.4m antenna diameter. Gateway earth stations included two systems, referred to as the NASA Ground Station (NGS) and the Link Evaluation Terminal (LET). The NGS provides tracking, telemetry, and control (TT&C) and Time Division Multiple Access (TDMA) network control functions. The LET supports technology verification and high data rate experiments. The ground stations successfully demonstrated many services and applications at Ka-band in three different modes of operation: circuit switched TDMA using the satellite on-board processor, satellite switched SS-TDMA applications using the on-board Microwave Switch Matrix (MSM), and conventional transponder (bent-pipe) operation. Data rates ranged from 4.8 kbps up to 622 Mbps. Experiments included: 1) low rate (4.8- 1 00's kbps) remote data acquisition and control using small earth stations, 2) moderate rate (1-45 Mbps) experiments included full duplex voice and video conferencing and both full duplex and asymmetric data rate protocol and network evaluation using mid-size ground stations, and 3) link characterization experiments and high data rate (155-622 Mbps) terrestrial and satellite interoperability application experiments conducted by a consortium of experimenters using the large transportable ground stations.

Reinhart, Richard C.↗

Qualification of the ITER CS Quench Detection System using Numerical Modeling

Abstract The ITER Central Solenoid (CS) magnet needs to be protected against overheating of the conductor in the event of the occurrence of a normal zone (NZ). Due to a large amount of stored energy and slow NZ propagation, the NZ needs to be detected and the switchyard needs to open the breakers within 2 s after detection of the NZ. The CS will be discharged on a dump resistor with a time constant of 7.5 s. During operation of the CS and its interaction with the poloidal field (PF) coils and plasma current, the CS experiences large inductive voltages from multiple sources, including nonlinear signals from eddy currents in the vacuum vessel and plasma current variation, that make the task of detecting the resistive signal even more difficult. This inductive voltage needs to be cancelled by quench detection (QD) hardware (e.g., bridges, converters, filters, processors) and appropriate processing of the QD signals to reliably detect NZ initiation and propagation. Two redundant schemes are proposed as the baseline for the CS QD System: 1) A scheme with Regular Voltage Taps (RVT) from triads of Double Pancakes (DP) supplemented by Central Difference Averaging (CDA) and by digital suppression of the inductive voltage from all active coils (the CS and PF coils). Voltage taps are taken from helium outlets at the CS outer diameter. 2)A scheme with Cowound Voltage Taps (CVT) taken from cowound wires routed from the helium inlet at the CS inner diameter. Summary of results of the numerical modeling of the performance of both baseline CS QD systems is presented in this paper. Index Terms Quench detection, Central Solenoid, ITER

Martovetsky, Nicolai N↗

An Engineering Data Management System for Ipad

An overview of the capabilities and software architecture of the IPAD information processor (IPIP) is presented. IPIP is a state-of-the-art data base management system that satisfies engineering requirements not addressed by present day commercial systems. It also significantly advances a number of capabilities that are offered commercially. IPIP capabilities range from support for multiple schemas and data models to support for distributed processing, configuration control, and data inventory management. IPIP exploits semantic commonality in features offered in various forms at different user interfaces in today's commercial systems. An integrated software architecture supports all user interfaces: programming languages, interactive data manipulation, and schema languages. This approach promotes simplicity and compactness in software and permits features to be offered symmetrically across all appropriate user interfaces.

H R Johnson↗

Application of concurrent processing to structural dynamic response computations

Described are the experiences gained from solving for the dynamic response of two simple structures on an experimental Multiple Instruction Multiple Data (MIMD) computer called the finite element machine. Introduced are MIMD computing concepts, describing how the concurrent algorithmic techniques implemented and giving results for the two example problems. The results show computational speedups of up to 7.83 using eight of the finite element machine processors and indicate that significant computational speedups are possible for large order structural computations.

Ransom, J.↗

Extended testing of a general contextual classifier using the massively parallel processor - Preliminary results and test plans

Earlier encouraging test results of a contextual classifier that combines spatial and spectral information employing a general statistical approach are expanded. The earlier results were of limited meaning because they were produced from small (50-by-50 pixel) data sets. An implementation of the contextual classifier on NASA Goddard's Massively Parallel Processor (MPP) is presented; for the first time the MPP makes feasible the testing of the classifier on large data sets (a 12-hour test on a VAX-11/780 minicomputer now takes 5 minutes on the MPP). The MPP is a Single-Instruction, Multiple Data Stream computer, consisting of 16,384 bit serial microprocessors connected in a 128-by-128 mesh array with each element having data transfer connections with its four nearest neighbors so that the MPP is capable of billions of operations per second. Preliminary results are given (with more expected for the conference) and plans are mentioned for extended testing of the contextual classifier on Thematic Mapper data sets.

Tilton, J. C.↗

Vector performance analysis of three supercomputers - Cray-2, Cray Y-MP, and ETA10-Q

Results are presented of a series of experiments to study the single-processor performance of three supercomputers: Cray-2, Cray Y-MP, and ETA10-Q. The main object of this study is to determine the impact of certain architectural features on the performance of modern supercomputers. Features such as clock period, memory links, memory organization, multiple functional units, and chaining are considered. A simple performance model is used to examine the impact of these features on the performance of a set of basic operations. The results of implementing this set on these machines for three vector lengths and three memory strides are presented and compared. For unit stride operations, the Cray Y-MP outperformed the Cray-2 by as much as three times and the ETA10-Q by as much as four times for these operations. Moreover, unlike the Cray-2 and ETA10-Q, even-numbered strides do not cause a major performance degradation on the Cray Y-MP. Two numerical algorithms are also used for comparison. For three problem sizes of both algorithms, the Cray Y-MP outperformed the Cray-2 by 43 percent to 68 percent and the ETA10-Q by four to eight times.

Fatoohi, Rod A.↗

Compact Optoelectronic Compass

A compact optoelectronic sensor unit measures the apparent motion of the Sun across the sky. The data acquired by this chip are processed in an external processor to estimate the relative orientation of the axis of rotation of the Earth. Hence, the combination of this chip and the external processor finds the direction of true North relative to the chip: in other words, the combination acts as a solar compass. If the compass is further combined with a clock, then the combination can be used to establish a threeaxis inertial coordinate system. If, in addition, an auxiliary sensor measures the local vertical direction, then the resulting system can determine the geographic position. This chip and the software used in the processor are based mostly on the same design and operation as those of the unit described in Micro Sun Sensor for Spacecraft (NPO-30867) elsewhere in this issue of NASA Tech Briefs. Like the unit described in that article, this unit includes a small multiple-pinhole camera comprising a micromachined mask containing a rectangular array of microscopic pinholes mounted a short distance in front of an image detector of the active-pixel sensor (APS) type (see figure). Further as in the other unit, the digitized output of the APS in this chip is processed to compute the centroids of the pinhole Sun images on the APS. Then the direction to the Sun, relative to the compass chip, is computed from the positions of the centroids (just like a sundial). In the operation of this chip, one is interested not only in the instantaneous direction to the Sun but also in the apparent path traced out by the direction to the Sun as a result of rotation of the Earth during an observation interval (during which the Sun sensor must remain stationary with respect to the Earth). The apparent path of the Sun across the sky is projected on a sphere. The axis of rotation of the Earth lies at the center of the projected circle on the sphere surface. Hence, true North (not magnetic North), relative to the chip, can be estimated from paths of the Sun images across the APS. In a test, this solar compass has been found to yield a coarse estimate of the North (within tens of degrees) in an observation time of about ten minutes. As expected, the accuracy was found to increase with observation time: after a few hours, the estimated direction of the rotation axis becomes accurate to within a small fraction of a degree.

Christian, Carl↗

PREPARING FOR EXASCALE: ORNL Leadership Computing Application Requirements and Strategy

In 2009 the Oak Ridge Leadership Computing Facility (OLCF), a U.S. Department of Energy (DOE) facility at the Oak Ridge National Laboratory (ORNL) National Center for Computational Sciences (NCCS), elicited petascale computational science requirements from leading computational scientists in the international science community. This effort targeted science teams whose projects received large computer allocation awards on OLCF systems. A clear finding of this process was that in order to reach their science goals over the next several years, multiple projects will require computational resources in excess of an order of magnitude more powerful than those currently available. Additionally, for the longer term, next-generation science will require computing platforms of exascale capability in order to reach DOE science objectives over the next decade. It is generally recognized that achieving exascale in the proposed time frame will require disruptive changes in computer hardware and software. Processor hardware will become necessarily heterogeneous and will include accelerator technologies. Software must undergo the concomitant changes needed to extract the available performance from this heterogeneous hardware. This disruption portends to be substantial, not unlike the change to the message passing paradigm in the computational science community over 20 years ago. Since technological disruptions take time to assimilate, we must aggressively embark on this course of change now, to insure that science applications and their underlying programming models are mature and ready when exascale computing arrives. This includes initiation of application readiness efforts to adapt existing codes to heterogeneous architectures, support of relevant software tools, and procurement of next-generation hardware testbeds for porting and testing codes. The 2009 OLCF requirements process identified numerous actions necessary to meet this challenge: (1) Hardware capabilities must be advanced on multiple fronts, including peak flops, node memory capacity, interconnect latency, interconnect bandwidth, and memory bandwidth. (2) Effective parallel programming interfaces must be developed to exploit the power of emerging hardware. (3) Science application teams must now begin to adapt and reformulate application codes to the new hardware and software, typified by hierarchical and disparate layers of compute, memory and concurrency. (4) Algorithm research must be realigned to exploit this hierarchy. (5) When possible, mathematical libraries must be used to encapsulate the required operations in an efficient and useful way. (6) Software tools must be developed to make the new hardware more usable. (7) Science application software must be improved to cope with the increasing complexity of computing systems. (8) Data management efforts must be readied for the larger quantities of data generated by larger, more accurate science models. Requirements elicitation, analysis, validation, and management comprise a difficult and inexact process, particularly in periods of technological change. Nonetheless, the OLCF requirements modeling process is becoming increasingly quantitative and actionable, as the process becomes more developed and mature, and the process this year has identified clear and concrete steps to be taken. This report discloses (1) the fundamental science case driving the need for the next generation of computer hardware, (2) application usage trends that illustrate the science need, (3) application performance characteristics that drive the need for increased hardware capabilities, (4) resource and process requirements that make the development and deployment of science applications on next-generation hardware successful, and (5) summary recommendations for the required next steps within the computer and computational science communities.

applications requirements↗

Memory-efficient optimization of Gyrokinetic particle-to-grid interpolation for multicore processors

We present multicore parallelization strategies for the particle-to-grid interpolation step in the Gyrokinetic Toroidal Code (GTC), a 3D particle-in-cell (PIC) application to study turbulent transport in magnetic-confinement fusion devices. Particle-grid interpolation is a known performance bottleneck in several PIC applications. In GTC, this step involves particles depositing charges to a 3D toroidal mesh, and multiple particles may contribute to the charge at a grid point. We design new parallel algorithms for the GTC charge deposition kernel, and analyze their performance on three leading multicore platforms. We implement thirteen different variants for this kernel and identify the best-performing ones given typical PIC parameters such as the grid size, number of particles per cell, and the GTC-specific particle Larmor radius variation. We find that our best strategies can be 2x faster than the reference optimized MPI implementation, and our analysis provides insight into desirable architectural features for high-performance PIC simulation codes.

97 MATHEMATICS AND COMPUTING↗

Extending Automatic Parallelization to Optimize High-Level Abstractions for Multicore

Automatic introduction of OpenMP for sequential applications has attracted significant attention recently because of the proliferation of multicore processors and the simplicity of using OpenMP to express parallelism for shared-memory systems. However, most previous research has only focused on C and Fortran applications operating on primitive data types. C++ applications using high-level abstractions, such as STL containers and complex user-defined types, are largely ignored due to the lack of research compilers that are readily able to recognize high-level object-oriented abstractions and leverage their associated semantics. In this paper, we automatically parallelize C++ applications using ROSE, a multiple-language source-to-source compiler infrastructure which preserves the high-level abstractions and gives us access to their semantics. Several representative parallelization candidate kernels are used to explore semantic-aware parallelization strategies for high-level abstractions, combined with extended compiler analyses. Those kernels include an array-base computation loop, a loop with task-level parallelism, and a domain-specific tree traversal. Our work extends the applicability of automatic parallelization to modern applications using high-level abstractions and exposes more opportunities to take advantage of multicore processors.

99 GENERAL AND MISCELLANEOUS↗

Software fault tolerance in computer operating systems

This chapter provides data and analysis of the dependability and fault tolerance for three operating systems: the Tandem/GUARDIAN fault-tolerant system, the VAX/VMS distributed system, and the IBM/MVS system. Based on measurements from these systems, basic software error characteristics are investigated. Fault tolerance in operating systems resulting from the use of process pairs and recovery routines is evaluated. Two levels of models are developed to analyze error and recovery processes inside an operating system and interactions among multiple instances of an operating system running in a distributed environment. The measurements show that the use of process pairs in Tandem systems, which was originally intended for tolerating hardware faults, allows the system to tolerate about 70% of defects in system software that result in processor failures. The loose coupling between processors which results in the backup execution (the processor state and the sequence of events occurring) being different from the original execution is a major reason for the measured software fault tolerance. The IBM/MVS system fault tolerance almost doubles when recovery routines are provided, in comparison to the case in which no recovery routines are available. However, even when recovery routines are provided, there is almost a 50% chance of system failure when critical system jobs are involved.

Iyer, Ravishankar K.↗

Parallel integer sorting with medium and fine-scale parallelism

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

Dagum, Leonardo↗

Single-event upset in advanced commercial power PC microprocessors

Single-event upset from heavy ions in measured for advanced commercial microprocessors, comparing upset sensitivity in registers and d-cache for several generations of devices. Multiple-bit upsets and asymmetry in registers upset cross sections are also discussed.

single-event upset advanced commercial power PC pr↗

Accelerating a fluvial incision and landscape evolution model with parallelism

Solving inverse problems, performing sensitivity analyses, and achieving statistical rigour in landscape evolution models require running many model realizations. Parallel computation is necessary to achieve this in a reasonable time. However, no previous landscape evolution algorithm is able to leverage modern parallelism. In this report, I describe an algorithm that can utilize the parallel potential of GPUs and many-core processors, in addition to working well in serial. The new algorithm runs 43× faster (70 s vs. 3000 s on a 10,000×10,000 input) than the previous state-of-the-art and exhibits sublinear scaling with input size. I also identify key techniques for multiple flow direction routing and quickly eliminating landscape depressions and local minima. Complete, well-commented, easily adaptable source code for all versions of the algorithm is available on Github and Zenodo.

58 GEOSCIENCES↗

End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.

quantum algorithms & computation↗