Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel applications”

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 829 records · Page 46

VisIO: enabling interactive visualization of ultra-scale, time-series data via high-bandwidth distributed I/O systems

Petascale simulations compute at resolutions ranging into billions of cells and write terabytes of data for visualization and analysis. Interactive visuaUzation of this time series is a desired step before starting a new run. The I/O subsystem and associated network often are a significant impediment to interactive visualization of time-varying data; as they are not configured or provisioned to provide necessary I/O read rates. In this paper, we propose a new I/O library for visualization applications: VisIO. Visualization applications commonly use N-to-N reads within their parallel enabled readers which provides an incentive for a shared-nothing approach to I/O, similar to other data-intensive approaches such as Hadoop. However, unlike other data-intensive applications, visualization requires: (1) interactive performance for large data volumes, (2) compatibility with MPI and POSIX file system semantics for compatibility with existing infrastructure, and (3) use of existing file formats and their stipulated data partitioning rules. VisIO, provides a mechanism for using a non-POSIX distributed file system to provide linear scaling of 110 bandwidth. In addition, we introduce a novel scheduling algorithm that helps to co-locate visualization processes on nodes with the requested data. Testing using VisIO integrated into Para View was conducted using the Hadoop Distributed File System (HDFS) on TACC's Longhorn cluster. A representative dataset, VPIC, across 128 nodes showed a 64.4% read performance improvement compared to the provided Lustre installation. Also tested, was a dataset representing a global ocean salinity simulation that showed a 51.4% improvement in read performance over Lustre when using our VisIO system. VisIO, provides powerful high-performance I/O services to visualization applications, allowing for interactive performance with ultra-scale, time-series data.

97 MATHEMATICS AND COMPUTING↗

A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can create n number of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

Mubarak, Misbah↗

SU-E-T-783: Using Matrixx to Determine Transit Dose Contribution Over Clinically Useful Limits of HDR Source Activity

Purpose: Most HDR brachytherapy treatment planning systems (TPS) use TG-43 formalism to calculate dose without including transit dose corrections. Historically, measurement of this contribution has required sophisticated apparatus unavailable in most hospitals. We use Matrixx to investigate several scenarios where transit dose contribution may effect a clinical treatment. Methods: Treatment plans were generated using Oncentra Brachy TPS (Version 4.3.0.410, Nucletron ) on a CT scan of a 24-catheter Freiburg applicator (Nucletron ) laid flat on the MatriXX (IBA) detector. This detector is an array of 1020 parallel plate ion chambers. All 24 catheters were digitized and dwells within a central square region of 5×5cm of the applicator were activated. Each of the active catheters had 6 dwells in increments of 1.0cm. The plans were normalized to 10mm. This places the 100% isodose line at the correct effective point of measurement, which lies half-way between the parallel plates of the ion chambers. It is also within the clinically relevant treatment depth for superficial applications. A total of 6 plans were delivered for 3 prescription doses, 1Gy, 2Gy and 4Gy using source activities of 2.9Ci and 11.2Ci. The MatriXX array was operated to capture dosimetric snaps every 500ms and yielded an integral dose at the end of treatment. Results: A comparison of integral dose from 2 different source activities shows that the transit dose contribution is larger when the source activity is higher. It is also observed that the relative transit dose contribution decreases as prescription dose increases. This is quantified by the Gamma analysis. Conclusion: We have demonstrated that the Matrixx detector can be used to evaluate the contribution for a HDR source during transit from the HDR afterloader to a dwell location, and between adjacent dwell locations.

60 APPLIED LIFE SCIENCES↗

A massively parallel method of characteristic neutral particle transport code for GPUs

Over the past 20 years, parallel computing has enabled computers to grow ever larger and more powerful while scientific applications have advanced in sophistication and resolution. This trend is being challenged, however, as the power consumption for conventional parallel computing architectures has risen to unsustainable levels and memory limitations have come to dominate compute performance. Heterogeneous computing platforms, such as Graphics Processing Units (GPUs), are an increasingly popular paradigm for solving these issues. This paper explores the applicability of GPUs for deterministic neutron transport. A 2D method of characteristics (MOC) code - OpenMOC - has been developed with solvers for both shared memory multi-core platforms as well as GPUs. The multi-threading and memory locality methodologies for the GPU solver are presented. Performance results for the 2D C5G7 benchmark demonstrate 25-35 x speedup for MOC on the GPU. The lessons learned from this case study will provide the basis for further exploration of MOC on GPUs as well as design decisions for hardware vendors exploring technologies for the next generation of machines for scientific computing. (authors)

97 MATHEMATICS AND COMPUTING↗

Trigger-based Incremental Data Processing with Unified Sync and Async Model

In recent years, more and more applications in the cloud have needs to process large-scale on-line datasets, which evolve over time as new entries are added and existing entries are modified. Several programming frameworks, such as Percolator and Oolong, are proposed for such incremental data processing and can achieve efficient processing with an event-driven abstraction. However, these frameworks are inherently asynchronous, leaving the heavy burden of managing synchronization to applications' developers, which further significantly restricts their usabilities. In this study, we propose a trigger-based incremental computing framework in the cloud, called Domino, with both synchronous and asynchronous mechanisms to coordinate parallel triggers. With this new framework, both synchronous and asynchronous applications can be seamlessly developed. Use cases and extensive evaluation results confirm that it can deliver sufficient performance, and also is easy to use for incremental applications in large-scale distributed computing.

97 MATHEMATICS AND COMPUTING↗

Adding Fault Tolerance to NPB Benchmarks Using ULFM

In the world of high-performance computing, fault tolerance and application resilience are becoming some of the primary concerns because of increasing hardware failures and memory corruptions. While the research community has been investigating various options, from system-level solutions to application-level solutions, standards such as the Message Passing Interface (MPI) are also starting to include such capabilities. The current proposal for MPI fault tolerant is centered around the User-Level Failure Mitigation (ULFM) concept, which provides means for fault detection and recovery of the MPI layer. This approach does not address application-level recovery, which is currently left to application developers. In this work, we present a modification of some of the benchmarks of the NAS parallel benchmark (NPB) to include support of the ULFM capabilities as well as application-level strategies and mechanisms for application-level failure recovery. As such, we present: (i) an application-level library to "checkpoint" and restore data, (ii) extensions of NPB benchmarks for fault tolerance based on different strategies, (iii) a fault injection tool, and (iv) some preliminary results that show the impact of such fault tolerant strategies on the application execution.

97 MATHEMATICS AND COMPUTING↗

The augmented saddle field discharge characteristics and its applications for plasma enhanced chemical vapour deposition

A high ion flux parallel electrode plasma is proposed and studied in its DC configuration. By cascading a diode source region which supplies electrons and a saddle field region where these seed electrons are energized and amplified, the energy of ion bombardment on the substrate can be decoupled from the plasma density. The sufficiently large density of electrons and holes in the vicinity of the substrate raises the possibility to perform plasma enhanced chemical vapour deposition on insulating materials, at low sheath voltages (around 40 V in the configuration studied), at low temperatures in which the surface mobility of film growth species may be provided by the bombardment of moderate energy ions. As a benchmarking exercise, experiments are carried out on silane discharge characteristics and deposition of hydrogenated amorphous silicon (a-Si:H) on both silicon wafer and glass. The films grown at low anode voltages have excellent microstructures with predominantly monohydride bonds, sharp band tails, but relatively high integrated defect density in the mid 10{sup 16}/cm{sup 3} range for the particular substrate temperature of 180 Degree-Sign C, indicating that further optimizations are necessary if the electrode configuration is to be used to create a-Si:H devices.

36 MATERIALS SCIENCE↗

ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to static graphs, we also extend ConnectIt to support mixes of insertions and connectivity queries in the concurrent setting. We present an experimental evaluation of ConnectIt on a 72-core machine, which we believe is the most comprehensive evaluation of parallel connectivity algorithms to date. Compared to a collection of state-of-the-art static multicore algorithms, we obtain an average speedup of 12.4x (2.36x average speedup over the fastest existing implementation for each graph). Using ConnectIt, we are able to compute connectivity on the largest publicly-available graph (with over 3.5 billion vertices and 128 billion edges) in under 10 seconds using a 72-core machine, providing a 3.1x speedup over the fastest existing connectivity result for this graph, in any computational setting. For our incremental algorithms, we show that our algorithms can ingest graph updates at up to several billion edges per second. To guide the user in selecting the best variants in ConnectIt for different situations, we provide a detailed analysis of the different strategies. Finally, we show how the techniques in ConnectIt can be used to speed up two important graph applications: approximate minimum spanning forest and SCAN clustering.

Computer Science↗

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↗

Experimental setup combining in situ hard X-ray photoelectron spectroscopy and real-time surface X-ray diffraction for characterizing atomic and electronic structure evolution during complex oxide heterostructure growth

We describe the next-generation system for in situ characterization of a complex oxide thin film and heterostructure growth by pulsed laser deposition (PLD) using synchrotron hard X-rays. The system consists of a PLD chamber mounted on a diffractometer allowing both real-time surface X-ray diffraction (SXRD) and in situ hard X-ray photoelectron spectroscopy (HAXPES). HAXPES is performed in the incident X-ray energy range from 4 to 12 keV using a Scienta EW4000 electron energy analyzer mounted on the PLD chamber fixed parallel with the surface normal. In addition to the standard application mode of HAXPES for disentangling surface from bulk properties, the increased penetration depth of high energy photoelectrons is used for investigation of the electronic structure changes through thin films grown deliberately as variable thickness capping layers. Such heterostructures represent model systems for investigating a variety of critical thickness and dead layer phenomena observed at complex oxide interfaces. In this new mode of operation, in situ HAXPES is used to determine the electronic structure associated with unique structural features identified by real-time SXRD during thin film growth. The system is configured for using both laboratory excitation sources off-line and on-line operation at beamline 33-ID-D at the Advanced Photon Source. We illustrate the performance of the system by preliminary scattering and spectroscopic data on oxygen vacancy ordering induced perovskite-to-brownmillerite reversible phase transformation in La 2/3 Sr 1/3 MnO 3 films capped with oxygen deficient SrTiO 3–δ (100) layers of varying thickness.

47 OTHER INSTRUMENTATION↗

Locality Aware Concurrent Start for Stencil Applications

Stencil computations are at the heart of many physical simulations used in scientific codes. Thus, there exists a plethora of optimization efforts for this family of computations. Among these techniques, tiling techniques that allow concurrent start have proven to be very efficient in providing better performance for these critical kernels. Nevertheless, with many core designs being the norm, these optimization techniques might not be able to fully exploit locality (both spatial and temporal) on multiple levels of the memory hierarchy without compromising parallelism. It is no longer true that the machine can be seen as a homogeneous collection of nodes with caches, main memory and an interconnect network. New architectural designs exhibit complex grouping of nodes, cores, threads, caches and memory connected by an ever evolving network-on-chip design. These new designs may benefit greatly from carefully crafted schedules and groupings that encourage parallel actors (i.e. threads, cores or nodes) to be aware of the computational history of other actors in close proximity. In this paper, we provide an efficient tiling technique that allows hierarchical concurrent start for memory hierarchy aware tile groups. Each execution schedule and tile shape exploit the available parallelism, load balance and locality present in the given applications. We demonstrate our technique on the Intel Xeon Phi architecture with selected and representative stencil kernels. We show improvement ranging from 5.58% to 31.17% over existing state-of-the-art techniques.

Locality Aware execution, jagged tiling↗

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\WW$ and $\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\WW$ and $\HH$ within the alternating iterations.

Kannan, Ramakrishnan↗

2022 American Conference on Neutron Scattering (ACNS 2022)

The 11th American Conference on Neutron Scattering (ACNS 2022) will be held on June 5-9, 2022, in Boulder, CO. The Conference will provide essential information on the breadth and depth of current neutron-related research worldwide. Hosted by the Neutron Scattering Society of America, this year’s Conference will feature a combination of invited and contributed talks, poster sessions, and tutorials. Topics of the conference are: Advances in Neutron Facilities, Instrumentation and Software: Developments in sources, instrumentation, sample environments and control software. Hard Condensed Matter: Magnetism, correlated metals, quantum/topological materials, superconductors, ferroelectrics, multiferroics, glasses, and disorder phenomena. Submissions outlining examples of neutron scattering in industrial and engineering applications involving hard condensed matter systems are also encouraged. Soft Matter: Neutron studies of soft materials and related fields including in situ and in operando studies. Polymers, surfactants, emulsions, gels, nanoparticles, colloidal suspensions and more. Submissions of computational studies or applications of machine learning beneficial to neutron scattering experiments, as well as examples of neutron scattering in industrial and engineering applications are strongly encouraged. Biology, Biophysics and Biotechnology: Neutron studies of biological and biologically relevant systems. Proteins, bio membranes, biological assemblies, natural materials, nucleic acids, drug-delivery platforms and biomedical systems. Submissions of computational studies or applications of machine learning beneficial to biological neutron scattering experiments, as well as examples of neutron scattering in applied research involving biological systems, are strongly encouraged. Materials Chemistry and Energy: Neutron-based studies of functional materials and materials for energy applications. Examples include porous materials such as metal organic frameworks (MOFs), zeolites; phosphors; novel pigments; electrolytes; catalysts; ionic conductors/cathode materials; photovoltaic materials (hybrid perovskites); thermoelectrics; magnetocalorics/electrocalorics. Structural Materials and Engineering: Neutron scattering studies of materials and engineering processes including structural materials, concrete and metals, as well as engineering processes including combustion, corrosion, additive manufacturing, and others. Neutron Physics: Fundamental physical studies of the neutron and related areas. Emerging Applications in Neutron Scattering: Machine Learning and Data Science: Advances in computing power have contributed to rapidly evolving machine learning and data science fields that can be leveraged to the benefit of the neutron scattering community. The purpose of this session is to highlight recent advances in machine learning and data science and to serve as the foundation of a parallel data and computation track highlighting computation advances and applications in neutron scattering throughout the conference.

36 MATERIALS SCIENCE↗

Adding Fault Tolerance to NPB Benchmarks Using ULFM

In the world of high-performance computing, fault tolerance and application resilience are becoming some of the primary concerns because of increasing hardware failures and memory corruptions. While the research community has been investigating various options, from system-level solutions to application-level solutions, standards such as the Message Passing Interface (MPI) are also starting to include such capabilities. The current proposal for MPI fault tolerant is centered around the User-Level Failure Mitigation (ULFM) concept, which provides means for fault detection and recovery of the MPI layer. This approach does not address application-level recovery, which is currently left to application developers. In this work, we present a mod- ification of some of the benchmarks of the NAS parallel benchmark (NPB) to include support of the ULFM capabilities as well as application-level strategies and mechanisms for application-level failure recovery. As such, we present: (i) an application-level library to checkpoint and restore data, (ii) extensions of NPB benchmarks for fault tolerance based on different strategies, (iii) a fault injection tool, and (iv) some preliminary results that show the impact of such fault tolerant strategies on the application execution.

Parchman, Zachary W↗

WE-G-BRD-05: Inline Magnetic Fields Enhance Tumor Dose for Small Lung Cancers

Purpose: To report on significant dose enhancement effects caused by magnetic fields aligned parallel to 6MV photon beam radiotherapy of small lung tumors. Findings are applicable to future inline MRI-guided radiotherapy systems. Methods: 9 clinical lung plans were recalculated using Monte Carlo methods and external inline (parallel to the beam direction) magnetic fields of 0.5 T, 1.0 T and 3 T were included. Three plans were 6MV 3D-CRT and six were 6MV IMRT. The GTV’s ranged from 0.8 cc to 73 cc, while the PTV ranged from 1 cc to 180 cc. Results: The inline magnetic field has a moderate impact in lung dose distributions by reducing the lateral scatter of secondary electrons and causing a small local dose increase. Superposition of multiple small beams acts to superimpose the small dose increases and can lead to significant dose enhancements, especially when the GTV is low density. Two plans with very small, low mean density GTV’s (<1 cc, ρ(mean)<0.35g/cc) showed uniform increases of 16% and 23% at 1 T throughout the PTV. Three plans with moderate mean density PTV’s (3–13 cc, ρ(mean)=0.58–0.67 g/cc) showed 6% mean dose enhancement at 1 T in the PTV, however not uniform throughout the GTV/PTV. Replanning would benefit these cases. The remaining 5 plans had large dense GTV’s (∼ 1 g/cc) and so only a minimal (<2%) enhancement was seen. In general the mean dose enhancement at 0.5 T was 60% less than 1 T, while 5–50% higher at 3 T. Conclusions: A paradigm shift in the efficacy of small lung tumor radiotherapy is predicted with future inline MRI-linac systems. This will be achieved by carefully taking advantage of the reduction of lateral electronic disequilibrium withing lung tissue that is induced naturally inside strong inline magnetic fields.

60 APPLIED LIFE SCIENCES↗

Grappolo

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose heuristics that are designed to break the sequential barrier. For evaluation purposes, we implemented our heuristics using OpenMP multithreading, and tested them over real world graphs derived from multiple application domains (e.g., internet, citation, biological). Compared to the serial Louvain implementation, our parallel implementation is able to produce community outputs with a higher modularity for most of the inputs tested, in comparable number of iterations, while providing real speedups of up to 8x using 32 threads. In addition, our parallel implementation was able to exhibit weak scaling properties on up to 32 threads.

Halappanavar, Mahantesh↗