Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel systems”

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 1,585 records · Page 88

Nonlinear finite element formulation for the large displacement analysis in multibody system dynamics

A total Lagrangian finite element formulation for the deformable bodies in multibody mechanical systems that undergo finite relative rotations is developed. The deformable bodies are discretized using finite element methods. The shape functions that are used to describe the displacement field are required to include the rigid body modes that describe only large translational displacements. This does not impose any limitations on the technique because most commonly used shape functions satisfy this requirement. The configuration of an element is defined using four sets of coordinate systems: Body, Element, Intermediate element, Global. The body coordinate system serves as a unique standard for the assembly of the elements forming the deformable body. The element coordinate system is rigidly attached to the element and therefore it translates and rotates with the element. The intermediate element coordinate system, whose axes are initially parallel to the element axes, has an origin which is rigidly attached to the origin of the body coordinate system and is used to conveniently describe the configuration of the element in undeformed state with respect to the body coordinate system.

Rismantab-Sany, J.↗

Modelling and simulation of a heat exchanger

Two models for two different control systems are developed for a parallel heat exchanger. First by spatially lumping a heat exchanger model, a good approximate model which has a high system order is produced. Model reduction techniques are applied to these to obtain low order models that are suitable for dynamic analysis and control design. The simulation method is discussed to ensure a valid simulation result.

Xia, Lei↗

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel↗

System architectures for PROLOG execution

The principal features of PROLOG are reviewed with particular reference to the use of the language in the development of expert systems. Attention is given to the language syntax, data structures and recursion, constructs that alter control, predicates that modify the database, predicates for input and output, and metalogical predicates. The parts of the Warren Abstract Machine are then described, and it is shown how it executes programs. Parallel architectures proposed for expert systems are examined, and the principal varieties of parallelism available in PROLOG and examples of architectures exploiting them are discussed.

Gooley, Markian M.↗

Electronic system for high power load control

Parallel current paths are divided into two groups, with control devices in the current paths of one group each having a current limiting resistor, and the control devices in the other group each having no limiting resistor, so that when the control devices of the second group are turned fully on, a short circuit is achieved by the arrangement of parallel current paths. Separate but coordinated control signals are provided to turn on the control devices of the first group and increase their conduction toward saturation as a function of control input, and when fully on, or shortly before, to turn on the control devices of the second group and increase their conduction toward saturation as a function of the control input as that input continues to increase. Electronic means may be used to generate signals. The system may be used for 1-V characteristic measurements of solar arrays as well as for other load control purposes.

Miller, E. L.↗

Parallel operation of two Brayton-cycle alternators with parasitic speed controllers

The experimental paralleling characteristics of two 1200 Hz Brayton-cycle alternators are presented. Since the Brayton power conversion system uses electric speed controllers, the paralleling requirements are somewhat different from those for conventional ground-based systems. Results include the transient effects of synchronizing the two alternators with various phase-angle, voltage, and frequency differences. Based on these results, the effects of synchronizing differences can be defined, and adjustment requirements of the parasitic speed controllers during synchronizing can be established. Data indicate that parasitically loaded alternators are able to parallel over a wide range of synchronizing differences. However, equilibrium could not be reached in extreme cases where alternator load differences were great and, at the same time, the phase-angle error was large (150 deg or more).

Perz, D. A.↗

Retargeting of existing FORTRAN program and development of parallel compilers

The software models used in implementing the parallelizing compiler for the B-HIVE multiprocessor system are described. The various models and strategies used in the compiler development are: flexible granularity model, which allows a compromise between two extreme granularity models; communication model, which is capable of precisely describing the interprocessor communication timings and patterns; loop type detection strategy, which identifies different types of loops; critical path with coloring scheme, which is a versatile scheduling strategy for any multicomputer with some associated communication costs; and loop allocation strategy, which realizes optimum overlapped operations between computation and communication of the system. Using these models, several sample routines of the AIR3D package are examined and tested. It may be noted that automatically generated codes are highly parallelized to provide the maximized degree of parallelism, obtaining the speedup up to a 28 to 32-processor system. A comparison of parallel codes for both the existing and proposed communication model, is performed and the corresponding expected speedup factors are obtained. The experimentation shows that the B-HIVE compiler produces more efficient codes than existing techniques. Work is progressing well in completing the final phase of the compiler. Numerous enhancements are needed to improve the capabilities of the parallelizing compiler.

Agrawal, Dharma P.↗

Thin film confinement reduces compatibility in symmetric ternary block copolymer/homopolymer blends

Here, the thin film phase behavior of ternary blends consisting of symmetric poly(styrene) (PS)– b –poly(dimethylsiloxane)(PDMS), PS, and PDMS was investigated using X–ray reflectivity (XRR) and atomic force microscopy (AFM). This system is strongly segregated, and the homopolymers are approximately the same length as the corresponding blocks of the copolymer. The XRR and AFM data are used to quantify changes in domain spacing ( L ) and morphology evolution with increasing homopolymer content (Φ H ). In 100 nm thick films, from Φ H = 0 to 0.20, the system maintains a perfect parallel lamellar structure and domains swell as predicted based on theory; however, from Φ H = 0.30 to 0.50, a morphology transition to a “dot pattern” morphology (tentatively identified as perforated lamellae) and mixed morphologies were observed before macrophase separation. In thicker films, dot patterns were observed for a broad range of Φ H before macrophase separation. The absence of the bicontinuous microemulsion phase reported for bulk blends and thin films of perpendicular lamellae and the presence of dot patterns/perforated lamellae are attributed to preferential migration of the PDMS homopolymer to the wetting layers located at the substrate and free air interfaces, which leads to an asymmetric composition within the film and morphology transition.

36 MATERIALS SCIENCE↗

Scalability Tests of a Finite Element Code on Hundreds of Thousands Cores and Heterogeneous Architecture

A multi-scale finite element method code, msFEM, is tested on Jaguar and Nebulae, two petaflops computers that were listed as #1 and #2 on the Top500 list of June 2010 at the time of the tests. The flat MPI version of msFEM is scaled from 20K up to 200K CPU cores on Jaguar, delivering 70% parallel efficiency at the 200K cores with a finite element model of eight millions of degrees of freedom. GPU versions, in both double precision and mixed precision coded through MPI+OpenMP+CUDA hybrid programming, 900 GPU nodes on Jaguar and 1500 GPU nodes on Nebulae, achieving remarkable 90 + % parallel efficiency on the systems. The mixed-precision GPU version delivers further 1.5 times of speedup over the fully double precision version with no significant implementational cost. The large-scale tests support that the msFEM runs efficiently on petaflops computers and is highly potential for domain applications at extreme-scale.

finite element method↗

A Large Deviations Analysis of Certain Qualitative Properties of Parallel Tempering and Infinite Swapping Algorithms

Parallel tempering, or replica exchange, is a popular method for simulating complex systems. The idea is to run parallel simulations at different temperatures, and at a given swap rate exchange configurations between the parallel simulations. From the perspective of large deviations it is optimal to let the swap rate tend to infinity and it is possible to construct a corresponding simulation scheme, known as infinite swapping. In this paper we propose a novel use of large deviations for empirical measures for a more detailed analysis of the infinite swapping limit in the setting of continuous time jump Markov processes. Using the large deviations rate function and associated stochastic control problems we consider a diagnostic based on temperature assignments, which can be easily computed during a simulation. Here we show that the convergence of this diagnostic to its a priori known limit is a necessary condition for the convergence of infinite swapping. Finally, the rate function is also used to investigate the impact of asymmetries in the underlying potential landscape, and where in the state space poor sampling is most likely to occur.

97 MATHEMATICS AND COMPUTING↗

Reliable and Efficient Distributed Checkpointing System for Grid Environments

In Fine-Grained Cycle Sharing (FGCS) systems, machine owners voluntarily share their unused CPU cycles with guest jobs, as long as their performance degradation is tolerable. However, unpredictable evictions of guest jobs lead to fluctuating completion times. Checkpoint-recovery is an attractive mechanism for recovering from such “failures”. Today’s FGCS systems often use expensive, high-performance dedicated checkpoint servers. However, in geographically distributed clusters, this may incur high checkpoint transfer latencies. Here we present a distributed checkpointing system called FALCON that uses available disk resources of the FGCS machines as shared checkpoint repositories. However, an unavailable storage host may lead to loss of checkpoint data. Therefore, we model the failures of a storage host and develop a prediction algorithm for choosing reliable checkpoint repositories. We experiment with FALCON in the university-wide Condor testbed at Purdue and show improved and consistent performance for guest jobs in the presence of irregular resource availability.

checkpoint↗

HPC Node Performance and Energy Modeling with the Co-Location of Applications

Multicore processors have become an integral part of modern large-scale and high-performance parallel and distributed computing systems. This advance became necessary as the demand for increased system performance has exceeded the limits that single core processors can provide. Unfortunately, applications co-located on multicore processors can suffer from decreased performance and increased dynamic energy use as a result of access to shared resources, such as memory. Consequently, it is increasingly important to characterize the performance of applications that execute on these architectures. This work investigates some of the disadvantages of co-location, and presents a methodology for building models capable of utilizing varying amounts of information about a target application and its co-located applications to make predictions about the target application’s execution time and the system’s energy use under arbitrary co-locations of a wide range of application types. The proposed methodology is validated on three different server class Intel Xeon multicore processors using eleven applications from two scientific benchmark suites. The model’s utility for scheduling is also demonstrated in a simulated large-scale high-performance computing environment through the creation of a co-location aware scheduling heuristic. This heuristic demonstrates that scheduling using information generated with the proposed modeling methodology is capable of making significant improvements over a scheduling heuristic that is naive to co-location interference.

performance modeling, energy modeling, resource ma↗

Advanced operator splitting-based semi-implicit spectral method to solve the binary phase-field crystal equations with variable coefficients

We present an efficient method to solve numerically the equations of dissipative dynamics of the binary phase-field crystal model proposed by Elder et al. [K.R. Elder, M. Katakowski, M. Haataja, M. Grant, Phys. Rev. B 75 (2007) 064107] characterized by variable coefficients. Using the operator splitting method, the problem has been decomposed into sub-problems that can be solved more efficiently. A combination of non-trivial splitting with spectral semi-implicit solution leads to sets of algebraic equations of diagonal matrix form. Extensive testing of the method has been carried out to find the optimum balance among errors associated with time integration, spatial discretization, and splitting. We show that our method speeds up the computations by orders of magnitude relative to the conventional explicit finite difference scheme, while the costs of the pointwise implicit solution per timestep remains low. Also we show that due to its numerical dissipation, finite differencing can not compete with spectral differencing in terms of accuracy. In addition, we demonstrate that our method can efficiently be parallelized for distributed memory systems, where an excellent scalability with the number of CPUs is observed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Overcoming Shockley-Queisser limit using halide perovskite platform?

The Intergovernmental Panel on Climate Change (IPCC) reveals that the global temperature has reached its highest level in the last 2,000 years. Development of emissions-free electrification technologies such as photovoltaics (PV) can be a great paramountcy to balance the climate pressure and the growing demand on energy. Although many PV technologies have been demonstrated so far, all the single-junction PVs are still subjected to the well-known efficiency cap of the Shockley-Queisser limit (33.7%), with most of the absorbed solar energy lost into heat. In parallel to delicate system-level designs, such as tandem, multi-junction, photothermal, or up-/down-conversion, we ask the question about the feasibility of overcoming the SQ limit at material level. In this study, we first dissect the origin of the limit, and then, by using the emerging perovskite as the platform, we list several potential pathways (i.e., hot carrier, multi-exciton generation, intermediate band gap, and ferroelectricity that have been newly discovered or can be introduced in the perovskite) to the roadmap of exceeding the SQ limit.

14 SOLAR ENERGY↗

Parallel processing of filtered queries in attributed semantic graphs

Execution of complex analytic queries on massive semantic graphs is a challenging problem in big-data analytics that requires high-performance parallel computing. In a semantic graph, vertices and edges carry attributes of various types and the analytic queries typically depend on the values of these attributes. Thus, the computation must view the graph through a filter that passes only those individual vertices and edges of interest. Previous investigations have developed Knowledge Discovery Toolbox (KDT), a sophisticated Python library for parallel graph computations. In KDT, the user can write custom graph algorithms by specifying operations between edges and vertices ( semiring operations ). The user can also customize existing graph algorithms by writing filters. While the high-level language for this customization enables domain scientists to productively express their graph analytics requirements, the customized queries perform poorly due to the overhead of having to call into the Python virtual machine for each vertex and edge. In this work, we use the Selective Embedded Just-In-Time Specialization (SEJITS) approach to automatically translate semiring operations and filters defined by programmers into a lower-level efficiency language, bypassing the upcall into Python. We evaluate our approach by comparing it with the high-performance Combinatorial BLAS engine and show that our approach combines the benefits of programming in a high-level language with executing in a low-level parallel environment. We increase the system's flexibility by developing techniques that provide users with the ability to define new vertex and edge types from Python. We also present a new Roofline model for graph traversals and show that we achieve performance that is significantly closer to the bounds suggested by the Roofline. Finally, to further understand the complex interaction with the underlying architecture, we present an analysis using performance counters that quantifies the improvement in hardware behavior in the context our SEJITS methodology. Comprehensively, we demonstrate the first known solution to the problem of obtaining high performance from a productivity language when applying graph algorithms selectively on semantic graphs with hundreds of millions of edges and scaling to thousands of processors for graphs.

97 MATHEMATICS AND COMPUTING↗

The evolution of the STAR Trigger System

The STAR experiment at RHIC has been taking data since 2000. During that time, new detectors have been added, RHIC luminosity has increased, and STAR’s physics goals have become more focused. The Trigger System has evolved in parallel to be able to provide more precise triggering capabilities at higher rates. In this article the major improvements to the STAR Trigger are described, along with the future upgrade path.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗