Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel algorithms.”

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,081 records · Page 60

Properties of the Graph Modularity Matrix and its Applications

We study the popular modularity matrix and respective functional used in connection with graph clustering and derive some properties useful when performing vertex aggregation of the associated graph. These properties are employed in the derivation of a multilevel parallel pairwise aggregation algorithm. Some illustrative examples which include algebraic multigrid (AMG) coarsening that follows strong direction of anisotropy in finite element problems as well as comparative performance results of the studied algorithm are presented.

97 MATHEMATICS AND COMPUTING↗

Experience of Migrating a Parallel Graph Coloring Program from CUDA to SYCL

We describe the experience of converting a CUDA implementation of a parallel graph coloring algorithm to SYCL. The goals are for our work to be useful to application and compiler developers by providing a detailed description of migration paths between CUDA and SYCL. We will describe how CUDA functions are mapped to SYCL functions. Evaluating the CUDA and SYCL implementations of the algorithm shows that the performance of SYCL and CUDA kernels are comparable over the test graph set on NVIDIA P100 and V100 GPUs. The SYCL program also allows for performance evaluation with the OpenCL and Level Zero interfaces and power profiling on an Intel GPU computing platform.

97 MATHEMATICS AND COMPUTING↗

Development of a New Fixed-source Sensitivity Tally Capability in the MCNP ® Code [Slides]

Current work includes FSEN capability development, continued verification of adjoint-weighted sensitivity method, and improvement of algorithm speed and parallelism capability. Future work is forecasted to include extensions to non-Boltzmann responses, adding more responses and particle types, and connection to new MCNP6.3 tally backend.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Finite element computation on nearest neighbor connected machines

Research aimed at faster, more cost effective parallel machines and algorithms for improving designer productivity with finite element computations is discussed. A set of 8 boards, containing 4 nearest neighbor connected arrays of commercially available floating point chips and substantial memory, are inserted into a commercially available machine. One-tenth Mflop (64 bit operation) processors provide an 89% efficiency when solving the equations arising in a finite element problem for a single variable regular grid of size 40 by 40 by 40. This is approximately 15 to 20 times faster than a much more expensive machine such as a VAX 11/780 used in double precision. The efficiency falls off as faster or more processors are envisaged because communication times become dominant. A novel successive overrelaxation algorithm which uses cyclic reduction in order to permit data transfer and computation to overlap in time is proposed.

Mcaulay, A. D.↗

Fractal statistics of cloud fields

Landsat Multispectral Scanner (MSS) and Thematic Mapper (TM) data, with 80 and 30 m spatial resolution, respectively, have been employed to study the spatial structure of boundary-layer and intertropical convergence zone (ITCZ) clouds. The probability distributions of cloud areas and cloud perimeters are found to approximately follow a power-law, with a different power (i.e., fractal dimension) for each cloud type. They are better approximated by a double power-law behavior, indicating a change in the fractal dimension at a characteristic size which depends upon cloud type. The fractal dimension also changes with threshold. The more intense cloud areas are found to have a higher perimeter fractal dimension, perhaps indicative of the increased turbulence at cloud top. A detailed picture of the inhomogeneous spatial structure of various cloud types will contribute to a better understanding of basic cloud processes, and also has implications for the remote sensing of clouds, for their effects on remote sensing of other parameters, and for the parameterization of clouds in general circulation models, all of which rely upon plane-parallel radiative transfer algorithms.

Cahalan, Robert F.↗

A survey on the design of multiprocessing systems for artificial intelligence applications

Some issues in designing computers for artificial intelligence (AI) processing are discussed. These issues are divided into three levels: the representation level, the control level, and the processor level. The representation level deals with the knowledge and methods used to solve the problem and the means to represent it. The control level is concerned with the detection of dependencies and parallelism in the algorithmic and program representations of the problem, and with the synchronization and sheduling of concurrent tasks. The processor level addresses the hardware and architectural components needed to evaluate the algorithmic and program representations. Solutions for the problems of each level are illustrated by a number of representative systems. Design decisions in existing projects on AI computers are classed into top-down, bottom-up, and middle-out approaches.

Wah, Benjamin W.↗

An engineering approach to automatic programming

An exploratory study of the automatic generation and optimization of symbolic programs using DECOM - a prototypical requirement specification model implemented in pure LISP was undertaken. It was concluded, on the basis of this study, that symbolic processing languages such as LISP can support a style of programming based upon formal transformation and dependent upon the expression of constraints in an object-oriented environment. Such languages can represent all aspects of the software generation process (including heuristic algorithms for effecting parallel search) as dynamic processes since data and program are represented in a uniform format.

Rubin, Stuart H.↗

A nonrecursive 'Order N' preconditioned conjugate gradient/range space formulation of MDOF dynamics

This paper addresses the requirements of present-day mechanical system simulations of algorithms that induce parallelism on a fine scale and of transient simulation methods which must be automatically load balancing for a wide collection of system topologies and hardware configurations. To this end, a combination range space/preconditioned conjugage gradient formulation of multidegree-of-freedon dynamics is developed, which, by employing regular ordering of the system connectivity graph, makes it possible to derive an extremely efficient preconditioner from the range space metric (as opposed to the system coefficient matrix). Because of the effectiveness of the preconditioner, the method can achieve performance rates that depend linearly on the number of substructures. The method, termed 'Order N' does not require the assembly of system mass or stiffness matrices, and is therefore amenable to implementation on work stations. Using this method, a 13-substructure model of the Space Station was constructed.

Kurdila, A. J.↗

A software tool for dataflow graph scheduling

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.

Jones, Robert L., III↗

Current research activities at the NASA-sponsored Illinois Computing Laboratory of Aerospace Systems and Software

The Illinois Computing Laboratory of Aerospace Systems and Software (ICLASS) was established to: (1) pursue research in the areas of aerospace computing systems, software and applications of critical importance to NASA, and (2) to develop and maintain close contacts between researchers at ICLASS and at various NASA centers to stimulate interaction and cooperation, and facilitate technology transfer. Current ICLASS activities are in the areas of parallel architectures and algorithms, reliable and fault tolerant computing, real time systems, distributed systems, software engineering and artificial intelligence.

Smith, Kathryn A.↗

Computational aeroacoustics on massively parallel computers

A computational fluid dynamics (CFD) technique is employed to solve aeroacoustics problems on massively parallel computers. The algorithm is based on a 4th order accurate central finite difference and 4th order accurate 4-stage Runge-Kutta time integration method that solves the 3-D full Navier-Stokes/Euler equations on a curvilinear coordinate system. The code has been developed to predict noise radiation from ducted fans. A specific application of this code is made here to the oscillating circular piston problem (Workshop Category 4, Problem 2) by solving the full Euler equations with nonreflecting boundary conditions in the axisymmetric mode. The features of the code that apply to this particular problem are described in this paper.

Oezyoeruek, Yusuf↗

Magnetic Fluxtube Tunneling

We present numerical simulations of the collision and subsequent interaction of two initially orthogonal, twisted, force free field magnetic fluxtubes. The simulations were carried out using a new three dimensional explicit parallelized Fourier collocation algorithm for solving the viscoresistive equations of compressible magnetohydrodynamics. It is found that, under a wide range of conditions, the fluxtubes can 'tunnel' through each other. Two key conditions must be satisfied for tunneling to occur: the magnetic field must be highly twisted with a field line pitch much greater than 1, and the magnetic Lundquist number must be somewhat large, greater than or equal to 2880. This tunneling behavior has not been seen previously in studies of either vortex tube or magnetic fluxtube interactions. An examination of magnetic field lines shows that tunneling is due to a double reconnection mechanism. Initially orthogonal field lines reconnect at two specific locations, exchange interacting sections and 'pass' through each other. The implications of these results for solar and space plasmas are discussed.

Dahlburg, Russell B.↗

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Globus, Al↗

Topography Modeling in Atmospheric Flows Using the Immersed Boundary Method

Numerical simulation of flow over complex geometry needs accurate and efficient computational methods. Different techniques are available to handle complex geometry. The unstructured grid and multi-block body-fitted grid techniques have been widely adopted for complex geometry in engineering applications. In atmospheric applications, terrain fitted single grid techniques have found common use. Although these are very effective techniques, their implementation, coupling with the flow algorithm, and efficient parallelization of the complete method are more involved than a Cartesian grid method. The grid generation can be tedious and one needs to pay special attention in numerics to handle skewed cells for conservation purposes. Researchers have long sought for alternative methods to ease the effort involved in simulating flow over complex geometry.

Ackerman, A. S.↗

Injector Beam Dynamics for a High-Repetition Rate 4th-Generation Light Source

We report on the beam dynamics studies and optimization methods for a high repetition rate (1 MHz) photoinjector based on a VHF normal conducting electron source. The simultaneous goals of beamcompression and reservation of 6-dimensional beam brightness have to be achieved in the injector, in order to accommodate a linac driven FEL light source. For this, a parallel, multiobjective optimization algorithm is used. We discuss the relative merits of different injector design points, as well as the constraints imposed on the beam dynamics by technical considerations such as the high repetition rate.

43 PARTICLE ACCELERATORS↗

Highly Asynchronous VisitOr Queue Graph Toolkit

HAVOQGT is a C++ framework that can be used to create highly parallel graph traversal algorithms. The framework stores the graph and algorithmic data structures on external memory that is typically mapped to high performance locally attached NAND FLASH arrays. The framework supports a vertex-centered visitor programming model. The frameworkd has been used to implement breadth first search, connected components, and single source shortest path.

Pearce, R.↗

Machine Learning Toolkit for Extreme Scale

Support Vector Machines (SVM) is a popular machine learning technique, which has been applied to a wide range of domains such as science, finance, and social networks for supervised learning. MaTEx undertakes the challenge of designing a scalable parallel SVM training algorithm for large scale systems, which includes commodity multi-core machines, tightly connected supercomputers and cloud computing systems. Several techniques are proposed for improved speed and memory space usage including adaptive and aggressive elimination of samples for faster convergence , and sparse format representation of data samples. Several heuristics for earliest possible to lazy elimination of non-contributing samples are considered in MaTEx. In many cases, where an early sample elimination might result in a false positive, low overhead mechanisms for reconstruction of key data structures are proposed. The proposed algorithm and heuristics are implemented and evaluated on various publicly available datasets

Source record↗