H5bench: a benchmark suite for parallel HDF5 (H5bench) v0.6
H5bench benchmark suite contains a list of applications that are used to measure the HDF5 I/O performance from various aspects.
SEARCH · Search NASA
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.
H5bench benchmark suite contains a list of applications that are used to measure the HDF5 I/O performance from various aspects.
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.
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.
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.
Black-oil, compositional and thermal simulators have been developed to address different physical processes in reservoir simulation. A number of different types of discretization methods have also been proposed to address issues related to representing the complex reservoir geometry. These methods are more significant for fractured reservoirs where the geometry can be particularly challenging. In this project, a general modular framework for reservoir simulation was developed, wherein the physical models were efficiently decoupled from the discretization methods. This made it possible to couple any discretization method with different physical models. Oil characterization methods are becoming increasingly sophisticated, and it is possible to construct geologically constrained models of faulted/fractured reservoirs. Discrete Fracture Network (DFN) simulation provides the option of performing multiphase calculations on spatially explicit, geologically feasible fracture sets. Multiphase DFN simulations of and sensitivity studies on a wide variety of fracture networks created using fracture creation/simulation programs was undertaken in the first part of this project. This involved creating interfaces to seamlessly convert the fracture characterization information into simulator input, grid the complex geometry, perform the simulations, and analyze and visualize results. Benchmarking and comparison with conventional simulators was also a component of this work. After demonstration of the fact that multiphase simulations can be carried out on complex fracture networks, quantitative effects of the heterogeneity of fracture properties were evaluated. Reservoirs are populated with fractures of several different scales and properties. A multiscale fracture modeling study was undertaken and the effects of heterogeneity and storage on water displacement dynamics in fractured basements were investigated. In gravity-dominated systems, more oil could be recovered at a given pore volume of injection at lower rates. However, if oil production can be continued at high water cuts, the discounted cumulative production usually favors higher production rates. The workflow developed during the project was also used to perform multiphase simulations in heterogeneous, fracture-matrix systems. Compositional and thermal-compositional simulators were developed for fractured reservoirs using the generalized framework. The thermal-compositional simulator was based on a novel 'equation-alignment' approach that helped choose the correct variables to solve depending on the number of phases present and the prescribed component partitioning. The simulators were used in steamflooding and in insitu combustion applications. The framework was constructed to be inherently parallel. The partitioning routines employed in the framework allowed generalized partitioning on highly complex fractured reservoirs and in instances when wells (incorporated in these models as line sources) were divided between two or more processors.
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.
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.
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.
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.
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.
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.
A regenerator works as an energy storage component in a Stirling engine. Thus, it is one of the most critical components that makes the Stirling engine highly efficient. Traditionally, the regenerators are made of wire media such as woven screens and random fibers. These wire regenerators experience considerably high flow losses through the regenerator due to the flow separation and the resulting vortices. The high flow losses associated with the flow separation and vortices result in a lower engine efficiency. This research is to test a new robust foil regenerator to investigate its feasibility for free-piston Stirling engine applications. The robust foil regenerator is configured with parallel flow channels and stiffening ribs. Comparing to complex flows patterns in woven screen and random fiber regenerators, the flows in the parallel plates are simple and the flow losses are considerably small, and the heat transfer coefficient is also relatively small. To test the regenerator experimentally, a regenerator test rig was manufactured. To verify the accuracy of the test rig, a woven screen regenerator was made and tested prior to the robust foil regenerator test. The friction factor correlation of the woven screen regenerator shows a good agreement with the published regenerator correlations. The robust foil regenerator tests were conducted under the oscillating flow condition with different Reynolds numbers. The flow losses were measured with dynamic pressure transducers and the friction coefficient was derived from measured pressure drop. The measured temperature difference over the regenerator was used to calculate the heat transfer coefficient and Nusselt number. The figure of merit with two methods of NPH/NTU ratio and j/f ratio was calculated to evaluate the suitability of the robust foil regenerator. The results show that the robust foil regenerator has considerably higher figure of merit and therefore, better performance than other types of regenerator.
Highlights: • The dimeric MtbRv3716c has a “tweezers” like structure with a head and two tails. • The spacing between the tails is appropriate to accommodate double helical DNA. • The N- and the proline rich C-terminal ends exhibit flexibility. • Packing of molecules in the crystal structure is mediated by Cd{sup 2+} ions. • The {sup 25}QQQ{sup 27} motif might be important for divalent metal ion binding. Latent tuberculosis (TB) is the main hurdle in reaching the goal of “Stop TB 2050”. Tuberculin skin and Interferon-gamma release assay tests used currently for the diagnosis of TB infection cannot distinguish between active disease and latent tuberculosis infection (LTBI) and hence new and sensitive protein markers need to be identified for the diagnosis. A protein Rv3716c from Mycobacterium tuberculosis (MtbRv3716c) has been identified as a potential surrogate marker for the diagnosis of LTBI. Here, we present characterization of MtbRv3716c (∼13 kDa) using both biophysical and X-Ray crystallographic methods. EMSA study showed that MtbRv3716c binds to double stranded DNA. X-ray diffraction data collected on a crystal of MtbRv3716c at 1.9 Å resolution was used for structure determination using the molecular replacement method. Significant electron density was not observed for the N-terminal 21 and C-terminal 41 residues in the final electron density map. The C- terminal disordered region is proline rich and displays characteristics of intrinsically disordered proteins. Although the crystal asymmetric unit contained a protomer, a tight dimer could be generated by the application of the crystal two-fold symmetry parallel to the b axis. Packing of dimers in the crystal is mediated by a cadmium ion (Cd{sup 2+}) occurring at the interface of two dimers. Molecular packing analysis reveals large cavities that are probably occupied by the disordered segments of the N- and C-termini. Structural comparison with other homologous hypothetical DNA binding proteins (PDB codes: 1PUG, 1YBX) highlights structural features that might be significant for DNA binding.
Modern HPC systems are increasingly relying on greater core counts and wider vector registers. Thus, applications need to be adapted to fully utilize these hardware capabilities. One class of applications that can benefit from this increase in parallelism are molecular dynamics simulations. In this paper, we describe our efforts at modernizing the ESPResSo++ simulation package for molecular dynamics by restructuring its particle data layout for efficient memory accesses and applying vectorization techniques to benefit the calculation of short-range non-bonded forces, which results in an overall three times speedup and serves as a baseline for further optimizations. We also implement fine-grained parallelism for multi-core CPUs through HPX, a C++ runtime system which uses lightweight threads and an asynchronous many-task approach to maximize concurrency. Our goal is to evaluate the performance of an HPX-based approach compared to the bulk-synchronous MPI-based implementation. This requires the introduction of an additional layer to the domain decomposition scheme that defines the task granularity. On spatially inhomogeneous systems, which impose a corresponding load-imbalance in traditional MPI-based approaches, we demonstrate that by choosing an optimal task size, the efficient work-stealing mechanisms of HPX can overcome the overhead of communication resulting in an overall 1.4 times speedup compared to the baseline MPI version.
Livermore Tomography Tools (LTT) is a customizable scientific software package that enables a broad range of research and development efforts into computed tomography (CT). Here, it was developed to process x-ray and neutron CT data accurately and rapidly from raw detector counts to reconstructed volumes with the flexibility to handle many special cases. LTT fulfills long-term CT software goals to provide quantitatively accurate results reported in physical units (e.g., mm -1 or cm -1 ) while exploiting all available computational advantages to maximize speed. Written in C/C++ with support for multiple CPUs and GPUs, LTT runs on many computing platforms (Linux/Unix, Windows, and Mac; laptops to supercomputers). As a result, LTT can:process data acquired from various custom-built and commercially available CT scanners, model and simulate x-ray and neutron interactions to encourage algorithm prototyping, and allow for rapid insertion of the latest algorithms.We describe LTT’s software architecture, user interfaces, and its 88 algorithms (as of this writing) for pre-processing, reconstruction, post-processing, and simulation that support many scanner geometries (parallel-, fan-, cone-beam, and custom). Several applications are presented that illustrate LTT’s accuracy, speed, and flexibility relative to other solutions.
Flexible photovoltaics (PV) represents a promising research field with great potential for wearable, portable, and indoor applications. Significant progress has been made in recent years, with flexible emerging PV reporting power conversion efficiency (PCE) over 24%. Yet, there is a need for a unifying protocol to assess PV performance, compare research results, and evaluate the state- of-the-art achievements in flexible PV. In this paper, a consensus protocol is presented for measuring PCE over 1,000 bending cycles under 1% strain. Moreover, several good practice guidelines are proposed including bending procedures, flexibility testing with and without encapsulation, and ambient conditions during testing (e.g., temperature, humidity, illumination). Notably, the importance of uniform application of bending radius and the testing of parallel and perpendicular orientations of bending axis with respect to the direction of the electric current are emphasized. These recommendations aim to promote consistency in device comparison and allow for better reproducibility.
The general quasilinear Fokker-Planck kinetic equation for the plasma particle distribution functions in unmagnetized plasmas is derived, making no restrictions on the frequency of the electromagnetic fluctuations. The derived kinetic particle equation complements our earlier study of the general fluctuation's kinetic equation. For collective plasma eigenmodes and gyrotropic particle distribution functions, the two coupled kinetic equations describe the self-consistent dynamical evolution of the plasma. The limit of weakly damped collective modes correctly reproduces the well-known textbook kinetic particle equation with longitudinal Langmuir and ion-acoustic fluctuations, demonstrating, in particular, the resonant nature of parallel momentum diffusion of particles. In the limit of aperiodic modes, the Fokker-Planck equation contains the nonresonant diffusion of particles in momentum and the parallel and perpendicular momentum drag coefficients. As an application these drag and diffusion coefficients are calculated for extragalactic cosmic ray particles propagating in the unmagnetized intergalactic medium. Whereas for all cosmic rays, the perpendicular momentum diffusion in intergalactic aperiodic fluctuations is negligibly small; cosmic ray protons with energies below 10{sup 5 }GeV are affected by the plasma drag.
We have integrated mass-produced commercial complementary metal-oxide-semiconductor (CMOS) image sensors and off-the-shelf single-board computers into an x-ray camera platform optimized for acquisition of x-ray spectra and radiographs at energies of 2–6 keV. The CMOS sensor and single-board computer are complemented by custom mounting and interface hardware that can be easily acquired from rapid prototyping services. For single-pixel detection events, i.e., events where the deposited energy from one photon is substantially localized in a single pixel, we establish ∼20% quantum efficiency at 2.6 keV with ∼190 eV resolution and a 100 kHz maximum detection rate. The detector platform’s useful intrinsic energy resolution, 5-μm pixel size, ease of use, and obvious potential for parallelization make it a promising candidate for many applications at synchrotron facilities, in laser-heating plasma physics studies, and in laboratory-based x-ray spectrometry.