Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel 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 37 records · Page 2

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗

Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures

The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel. We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture--for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess limited memory resources (e.g., GPUs).

97 MATHEMATICS AND COMPUTING↗

Task 6 - Subtask 1: PNNL Visit by JAEA Researchers to Evaluate the Feasibility of the FLESCOT Code for the Future JAEA Use for the Fukushima Surface Water Environmental Assessment

Four Japan Atomic Energy Agency (JAEA) researchers visited Pacific Northwest National Laboratory (PNNL) for seven working days and have evaluated the suitability and adaptability of FLESCOT to a JAEA’s supercomputer system to effectively simulate cesium behavior in dam reservoirs, river mouths, and coastal areas in Fukushima contaminated by the Fukushima Daiichi nuclear accident. PNNL showed the following to JAEA visitors during the seven-working day period: FLESCOT source code; User’s manual; FLESCOT description – Program structure – Algorism – Solver – Boundary condition handling – Data definition – Input and output methods – How to run. During the visit, JAEA had access to FLESCOT to run with an input data set to evaluate the capacity and feasibility of adapting it to a JAEA super computer with massive parallel processors. As a part of this evaluation, PNNL ran FLESCOT for sample cases of the contaminant migration simulation to further describe FLESCOT in action. JAEA and PNNL researchers also evaluated time spent for each subroutine of FLESCOT, and the JAEA researcher implemented some initial parallelization schemes to FLESCOT. Based on this code evaluation, JAEA and PNNL determined that FLESCOT is: applicable to Fukushima lakes/dam reservoirs, river mouth areas, and coastal water; and feasible to implement parallelization for the JAEA supercomputer. In addition, PNNL and JAEA researchers discussed molecular modeling approaches on cesium adsorption mechanisms to enhance the JAEA molecular modeling activities. PNNL and JAEA also discussed specific collaboration of molecular and computational modeling activities.

54 ENVIRONMENTAL SCIENCES↗

A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints

We present a novel parallel framework for solving large-scale continuous nonlinear optimization problems based on constraint partitioning. The framework distributes constraints and variables to parallel processors and uses an existing solver to handle the partitioned subproblems. In contrast to most previous decomposition methods that require either separability or convexity of constraints, our approach is based on a new constraint partitioning theory and can handle nonconvex problems with inseparable global constraints. We also propose a hypergraph partitioning method to recognize the problem structure. Experimental results show that the proposed parallel algorithm can efficiently solve some difficult test cases.

97 MATHEMATICS AND COMPUTING↗

New Horizons for High-Performance Computing

Here we provide an overview of the past, present, and a diverse collection of future computer architecture alternatives for HPC. The end of Moore’s Law influenced the current HPC architecture focus on accelerated compute nodes composed of CPU and GPU computing components integrated into massively parallel processor architecture systems. There are many alternatives for future HPC directions, with different technologies, computing ecosystems, opportunities for lead user application-driven customization, and the role of open innovation business models. This paper provides an overview of these different new horizons for HPC, an organizing principle to focus future computing research, different public-private partnership models, and the critical role of workforce development.

97 MATHEMATICS AND COMPUTING↗

A fast parallel Poisson solver on irregular domains applied to beam dynamics simulations

We discuss the scalable parallel solution of the Poisson equation within a Particle-In-Cell (PIC) code for the simulation of electron beams in particle accelerators of irregular shape. The problem is discretized by Finite Differences. Depending on the treatment of the Dirichlet boundary the resulting system of equations is symmetric or 'mildly' nonsymmetric positive definite. In all cases, the system is solved by the preconditioned conjugate gradient algorithm with smoothed aggregation (SA) based algebraic multigrid (AMG) preconditioning. We investigate variants of the implementation of SA-AMG that lead to considerable improvements in the execution times. We demonstrate good scalability of the solver on distributed memory parallel processor with up to 2048 processors. We also compare our iterative solver with an FFT-based solver that is more commonly used for applications in beam dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating computational modeling and design of high-entropy alloys

High-entropy alloys, with N elements and compositions {$c_{ν = 1,N}$} in competing crystal structures, have large design spaces for unique chemical and mechanical properties. In this work, to enable computational design, we use a metaheuristic hybrid Cuckoo search (CS) to construct alloy configurational models on the fly that have targeted atomic site and pair probabilities on arbitrary crystal lattices, given by supercell random approximates (SCRAPs) with S sites. Our Hybrid CS permits efficient global solutions for large, discrete combinatorial optimization that scale linearly in a number of parallel processors, and linearly in sites S for SCRAPs. For example, a four-element, 128-site SCRAP is found in seconds—a more than 13,000-fold reduction over current strategies. Our method thus enables computational alloy design that is currently impractical. We qualify the models and showcase application to real alloys with targeted atomic short-range order. Being problem-agnostic, our Hybrid CS offers potential applications in diverse fields.

36 MATERIALS SCIENCE↗

The Maia Spectroscopy Detector System: Engineering for Integrated Pulse Capture, Low-Latency Scanning and Real-Time Processing

The Maia detector system is engineered for energy dispersive x-ray fluorescence spectroscopy and elemental imaging at photon rates exceeding 10{sup 7}/s, integrated scanning of samples for pixel transit times as small as 50 {micro}s and high definition images of 10{sup 8} pixels and real-time processing of detected events for spectral deconvolution and online display of pure elemental images. The system developed by CSIRO and BNL combines a planar silicon 384 detector array, application-specific integrated circuits for pulse shaping and peak detection and sampling and optical data transmission to an FPGA-based pipelined, parallel processor. This paper describes the system and the underpinning engineering solutions.

43 PARTICLE ACCELERATORS↗

A study of dust grain screening in a weakly ionized plasma based on the numerical solution of the Vlasov-Bhatnagar-Gross-Krook kinetic equations

Screening of a dust grain in a weakly ionized plasma is studied for a wide range of collisional regimes. The problem is considered on the basis of the Vlasov-Bhatnagar-Gross-Krook equations for plasma particles. The equations are solved numerically on parallel processors by means of a high-order finite-volume method. The computations are carried out for different pressures of plasma background and different grain sizes. The values of the total grain charge, distributions of the electric potential, and basic macroscopic parameters of plasma particles (concentration, temperature, and velocity) are obtained. For two limiting cases of the collisionless and strongly collisional background, the obtained results are found to be in good agreement with those computed using the commonly known models (nonlinear collisionless models of Bystrenko et al.[Phys. Lett. A 299, 383 (2002)] and Ratynskaia et al.[Phys. Plasmas 13, 104508 (2006)] and drift-diffusion approach). For the transitional collisional regime, it is shown that the electric potential also has the Coulomb-type asymptotical behavior related to the presence of charging currents and existence of some residual (unscreened) grain charge. Both total and residual grain charges are found to increase as the collisional regime tends to the continuum limit. In addition, the influence of collisions on the ion distribution function near the grain surface is demonstrated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An optimization method of relativistic backward wave oscillator using particle simulation and genetic algorithms

Optimal design method of high-power microwave source using particle simulation and parallel genetic algorithms is presented in this paper. The output power, simulated by the fully electromagnetic particle simulation code UNIPIC, of the high-power microwave device is given as the fitness function, and the float-encoding genetic algorithms are used to optimize the high-power microwave devices. Using this method, we encode the heights of non-uniform slow wave structure in the relativistic backward wave oscillators (RBWO), and optimize the parameters on massively parallel processors. Simulation results demonstrate that we can obtain the optimal parameters of non-uniform slow wave structure in the RBWO, and the output microwave power enhances 52.6% after the device is optimized.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

P4: Portable Parallel Processing Pipelines for Interactive Information Visualization

We present P4, an information visualization toolkit that combines declarative design specification and GPU computing for building high-performance interactive systems. Most of the existing information visualization toolkits do not harness the power of parallel processors in today's mainstream computers. P4 leverages GPU computing to accelerate both data processing and visualization rendering for interactive visualization applications. P4's programming interface offers a declarative visualization grammar for rapid specifications of data transformations, visual encodings, and interactions. By simplifying the development of GPU-accelerated visualization systems while supporting a high degree of flexibility and customization for design specification, P4 narrows the gap between expressiveness and scalability in information visualization toolkits. Through a range of examples and benchmark tests, we demonstrate that P4 provides high efficiency for creating interactive visualizations and offers drastic performance improvement over current state-of-the-art toolkits.

97 MATHEMATICS AND COMPUTING↗

Parallel Variable Population Multi-Objective Optimizer (pvpmoo) v1.0

This is a parallel variable population multi-objective optimizer with an adaptive unified differential evolution algorithm or a genetic algorithm. It can also be used for single objective optimization. Some features of this code include: 1) The population size varies from generation to generation to save the total # of objective function evaluations. 2) The population is uniformly distributed to a number of parallel processors for simultaneous objective function evaluation. 3) The objective function evaluation can be attained from an external simulation program with control variables in its input file and objectives calculated from its output files. 4) The optimizer includes an adaptive unified differential evolution algorithm and a real value genetic algorithm. The parameters in the unified differential evolution algorithm can be chosen to attain any mutation schemes in the published literature.

Qiang, Ji↗

RIKEN/RBRC Workshop: Future Directions in High Energy QCD

The RIKEN BNL Research Center (RBRC) was established in April 1997 at Brookhaven National Laboratory. It is funded by the "Rikagaku Kenkyusho" (RIKEN, The Institute of Physical and Chemical Research of Japan. The Memorandum of Understanding between RIKEN and BNL, initiated in 1997, has been renewed in 2002 and again in 2007. The Center is dedicated to the study of strong interactions, including spin physics, lattice QCD, and RHIC physics through the nurturing of new generations of young physicists. The RBRC has both a theory and experimental component. The RBRC Theory Group and the RBRC Experimental Group consists of a total of 25-30 researchers. Positions include the following: full time RBRC Fellow, half-time RHIC Physics Fellow, and full-time, post-doctoral Research Associate. The RHIC Physics Fellows hold joint appointments with RBRC and other institutions and have tenure track positions at their respective universities or BNL. To date, RBRC has ~100 graduates of which 27 theorists and 14 experimenters have attained tenure positions at major institutions world wide. Beginning in 2001 a new RIKEN Spin Program (RSP) category was implemented at RBRC. These appointments are joint positions of RBRC and RIKEN and include the following positions in theory and experiment: RSP Researchers, RSP Research Associates, and Young Researchers, who are mentored by senior RRC Scientists. A number of RIKEN Jr. Research Associates and Visiting Scientists also contribute to the physics program at the Center. RBRC has an active workshop program on strong interaction physics with each workshop focused on a specific physics problem. In most cases all the talks are made available on the RBRC website. In addition, highlights to each speaker's presentation are collected to form proceedings which can therefore be made available within a short time after the workshop. To date there are one hundred and two proceedings volumes available. A 10 teraflops RBRC QCDOC computer funded by RIKEN, Japan, was unveiled at a dedication ceremony at BNL on May 26, 2005. This supercomputer was designed and built by individuals from Columbia University, IBM, BNL, RBRC, and the University of Edinburgh, with the U.S.D.O.E. Office of Science providing infrastructure support at BNL. Physics results were reported at the RBRC QCDOC Symposium following the dedication. QCDSP, a 0.6 teraflops parallel processor, dedicated to lattice QCD, was begun at the Center on February 19, 1998, was completed on August 28, 1998, and was decommissioned in 2006. It was awarded the Gordon Bell Prize for price performance in 1998. The next generation computer in this sequence, QCDCQ (400 Teraflops), will become operational in the summer of 2012.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Proceedings of RIKEN BNL Research Center Workshop, Volume 113: Thermal Radiation Workshop

The RIKEN BNL Research Center (RBRC) was established in April 1997 at Brookhaven National Laboratory. It is funded by the "Rikagaku Kenkyusho" (RIKEN, The Institute of Physical and Chemical Research) of Japan. The Memorandum of Understanding between RIKEN and BNL, initiated in 1997, has been renewed in 2002, 2007 and again in 2012. The Center is dedicated to the study of strong interactions, including spin physics, lattice QCD, and RHIC physics through the nurturing of a new generation of young physicists. The RBRC has both a theory and experimental component. The RBRC Theory Group and the RBRC Experimental Group consists of a total of 25-30 researchers. Positions include the following: full time RBRC Fellow, half-time RHIC Physics Fellow, and full-time post doctoral Research Associate. The RHIC Physics Fellows hold joint appointments with RBRC and other institutions and have tenure track positions at their respective universities or BNL. To date, RBRC has over 95 graduates (Fellows and Post- docs) of which approximately 40 theorists and 20 experimenters have already attained tenure positions at major institutions worldwide. Beginning in 2001 a new RIKEN Spin Program (RSP) category was implemented at RBRC. These appointments are joint positions of RBRC and RIKEN and include the following positions in theory and experiment: RSP Researchers, RSP Research Associates, and Young Researchers, who are mentored by senior RBRC Scientists. A number of RIKEN Jr. Research Associates and Visiting Scientists also contribute to the physics program at the Center. RBRC has an active workshop program on strong interaction physics with each workshop focused on a specific physics problem. In most cases all the talks are made available on the RBRC website. In addition, highlights to each speaker’s presentation are collected to form proceedings which can therefore be made available within a short time after the workshop. To date there are over one hundred proceeding volumes available. A 10 teraflops RBRC QCDOC computer funded by RIKEN, Japan, was unveiled at a dedication ceremony at BNL on May 26, 2005. This supercomputer was designed and built by individuals from Columbia University, IBM, BNL, RBRC, and the University of Edinburgh, with the U.S. D.O.E. Office of Science providing infrastructure support at BNL. Physics results were reported at the RBRC QCDOC Symposium following the dedication. QCDSP, a 0.6 teraflops parallel processor, dedicated to lattice QCD, was begun at the Center on February 19, 1998, was completed on August 28, 1998, and was decommissioned in 2006. It was awarded the Gordon Bell Prize for price performance in 1998. QCDOC was decommissioned in May 2012. The next generation computer in this sequence, QCDCQ (600 Teraflops), is currently operational and is expected to produce many more interesting discoveries in the future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Randomized selection on the GPU

We implement here a fast and memory-sparing probabilistic top k selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the guess is correct, the problem is reduced to selection on a much smaller set. This probabilistic algorithm always gives a correct result and always terminates. Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

99 GENERAL AND MISCELLANEOUS↗

Randomized selection on the GPU

We implement here a fast and memory-sparing probabilistic top k selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the guess is correct, the problem is reduced to selection on a much smaller set. This probabilistic algorithm always gives a correct result and always terminates. Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

99 GENERAL AND MISCELLANEOUS↗

Proceedings of RIKEN BNL Research Center Workshop: The Physics of p ↑ +A Collisions at RHIC

The RIKEN BNL Research Center (RBRC) was established in April 1997 at Brookhaven National Laboratory. It is funded by the "Rikagaku Kenkyusho" (RIKEN, The Institute of Physical and Chemical Research) of Japan. The Memorandum of Understanding between RIKEN and BNL, initiated in 1997, has been renewed in 2002, 2007 and again in 2012. The Center is dedicated to the study of strong interactions, including spin physics, lattice QCD, and RHIC physics through the nurturing of a new generation of young physicists. The RBRC has both a theory and experimental component. The RBRC Theory Group and the RBRC Experimental Group consists of a total of 25-30 researchers. Positions include the following: full time RBRC Fellow, half-time RHIC Physics Fellow, and full-time postdoctoral Research Associate. The RHIC Physics Fellows hold joint appointments with RBRC and other institutions and have tenure track positions at their respective universities or BNL. To date, RBRC has over 95 graduates (Fellows and Post- docs) of which approximately 40 theorists and 20 experimenters have already attained tenure positions at major institutions worldwide. Beginning in 2001 a new RIKEN Spin Program (RSP) category was implemented at RBRC. These appointments are joint positions of RBRC and RIKEN and include the following positions in theory and experiment: RSP Researchers, RSP Research Associates, and Young Researchers, who are mentored by senior RBRC Scientists. A number of RIKEN Jr. Research Associates and Visiting Scientists also contribute to the physics program at the Center. RBRC has an active workshop program on strong interaction physics with each workshop focused on a specific physics problem. In most cases all the talks are made available on the RBRC website. In addition, highlights to each speaker’s presentation are collected to form proceedings which can therefore be made available within a short time after the workshop. To date there are over one hundred proceeding volumes available. A 10 teraflops RBRC QCDOC computer funded by RIKEN, Japan, was unveiled at a dedication ceremony at BNL on May 26, 2005. This supercomputer was designed and built by individuals from Columbia University, IBM, BNL, RBRC, and the University of Edinburgh, with the U.S. D.O.E. Office of Science providing infrastructure support at BNL. Physics results were reported at the RBRC QCDOC Symposium following the dedication. QCDSP, a 0.6 teraflops parallel processor, dedicated to lattice QCD, was begun at the Center on February 19, 1998, was completed on August 28, 1998, and was decommissioned in 2006. It was awarded the Gordon Bell Prize for price performance in 1998. QCDOC was decommissioned in May 2012. The next generation computer in this sequence, QCDCQ (600 Teraflops), is currently operational and is expected to produce many more interesting discoveries in the future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Final Report for Award #DE-SC3956 Separating Algorithm and Implementation via programming Model Injection (SAIMI)

Programming parallel machines is fraught with difficulties: the obfuscation of algorithms due to implementation details such as communication and synchronization, the need for transparency between language constructs and performance, the difficulty of performing program analysis to enable automatic parallelization techniques, and the existence of important "dusty deck" codes. The SAIMI project developed abstractions that enable the orthogonal specification of algorithms and implementation details within the context of existing DOE applications. The main idea is to enable the injection of small programming models such as expressions involving transcendental functions, polyhedral iteration spaces with sparse constraints, and task graphs into full programs through the use of pragmas. These smaller, more restricted programming models enable orthogonal specification of many implementation details such as how to map the computation on to parallel processors, how to schedule the computation, and how to allocation storage for the computation. At the same time, these small programming models enable the expression of the most computationally intense and communication heavy portions in many scientific simulations. The ability to orthogonally manipulate the implementation for such computations will significantly ease performance programming efforts and expose transformation possibilities and parameter to automated approaches such as autotuning. At Colorado State University, the SAIMI project was supported through DOE grant DE-SC3956 from April 2010 through August 2015. The SAIMI project has contributed a number of important results to programming abstractions that enable the orthogonal specification of implementation details in scientific codes. This final report summarizes the research that was funded by the SAIMI project.

97 MATHEMATICS AND COMPUTING↗