CFD-DEM Simulations of Reacting Fluidized Beds with MFIX-Exa
SIAM Conference on Parallel Processing for Scientific Computing, Virtual, February 23-26, 2022
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.
SIAM Conference on Parallel Processing for Scientific Computing, Virtual, February 23-26, 2022
Various embodiments include a parallel processing computer system that detects memory errors as a memory client loads data from memory and disables the memory client from storing data to memory, thereby reducing the likelihood that the memory error propagates to other memory clients. The memory client initiates a stall sequence, while other memory clients continue to execute instructions and the memory continues to service memory load and store operations. When a memory error is detected, a specific bit pattern is stored in conjunction with the data associated with the memory error. When the data is copied from one memory to another memory, the specific bit pattern is also copied, in order to identify the data as having a memory error.
Savannah River Nuclear Solutions (SRNS) completed the Accelerated TRU Project for remediating legacy waste at the Savannah River Site with significant cost and schedule efficiencies due to early identification of resources and utilization of risk matrices. Initial project planning included identification of existing facilities that could be modified to meet the technical requirements needed for repackaging and remediating the waste. The project schedule was then optimized by utilization of risk matrices that identified alternate strategies and parallel processing paths which drove the overall success of the project. Early completion of the Accelerated TRU Project allowed SRNS to pursue stretch goals associated with remediating very difficult TRU waste such as concrete casks from the hot cells in the Savannah River National Laboratory. Project planning for stretch goals also utilized existing facilities and the risk matrices. The Accelerated TRU project and stretch goals were funded under the American Recovery and Reinvestment Act (ARRA). (authors)
We present a novel data format design that obviates the need for data tiers by storing individual event data products in column objects. The objects are stored and retrieved through Ceph S3 technology, with a layout designed to minimize metadata volume and maximize data processing parallelism. Performance benchmarks of data storage and retrieval are presented.
In recent years, the surge in the number of isotope production facilities under design has increased the need to analyze isotope migration in facility Heating, Ventilation, and Air Conditioning (HVAC) during normal operations and accident scenarios. These facilities are used to produce isotopes for medical, security, and industrial applications and as such are subject to license and regulatory requirements 10CFR20, 10CFR30, 10CFR50, and 10CFR70. GOTHIC, a general-purpose thermal-hydraulics software package, includes the ability to model isotopic tracers, radioactive decay and isotope migration as well as HEPA and charcoal filters for isotope retention. A GOTHIC model was developed by Zachry Nuclear Engineering (ZNE) to examine the effect of negative room pressure, HEPA filtration, and HVAC fluctuations on radiation areas, hot cells and gloveboxes. Radioactive tracers were used to simulate the concentration of spills within contaminated areas, track the migration of isotopes of interest, and determine the isotopic retention and buildup on facility HEPA filters. A variety of isotopes with concern to dose (e.g., Kr-85, Sr-90, I-131, etc.), including their decay and progeny, are included in the analysis. Negative pressures are maintained in the regions of interest by a representative central HVAC system equipped with a volumetric fan that exhausts to the environment after a series of isolation valves and HEPA filters. GOTHIC is an industry trusted tool for providing engineering solutions for a variety of applications, including fission product tracking, aerosol and particulate transport and ventilation assessments. The software provides an integrated analysis environment that includes a graphical user interface (GUI) for constructing analysis models, a numerical solver that includes parallel processing capabilities and a post-processor for evaluating simulation results. It solves the conservation equations for mass, momentum and energy for multicomponent, multi-phase flow in lumped parameter and multi-dimensional geometries (1, 2, or full 3D), including the effects of turbulence, diffusion and buoyancy. It has been developed and maintained under a Quality Assurance program in compliance with the requirements of 10CFR50 Appendix B and applicable portions of ASME NQA-1 since 1995. GOTHIC has been used for assessing both forced and natural convection conditions for a wide range of applications, including: - Tracking concentration of hazardous gases and chemicals for habitability and safety assessments - Determining ventilation and filtration requirements and optimizing location and arrangement of these systems - Room heat-up, including diverse and Flexible coping strategies for Extended Loss of AC Power (FLEX/ELAP) - Equipment Qualification (EQ) A distinctive feature of GOTHIC is the ability to track many different fields/substances in a simulation, including user defined tracer elements, in the liquid, vapor and droplet fields as well as surfaces and filters. This capability allows GOTHIC to model fission product transport and release or the removal of particulates or harmful toxins from exhaust gases using a spray scrubber or other types of filtration systems. GOTHIC also includes models for engineered equipment, such as fans, filters, charcoal filters, dryers/demisters, dampers, etc. The aerosols and other filtered material are removed or accumulated in these components. The range of aerosol and radiological applications that GOTHIC has been used for includes: - Source Term: Primary Coolant (Equilibrium) Activity; Non-Water Coolant Source/Leakage. - Conditions for Iodine Re-evolution: Sump/Suppression Pool Conditions and pH; - RWST Conditions and pH. - Isotope Removal Mechanisms: Containment Sprayed and Unsprayed Region Mixing; Charcoal Filter Heating due to Iodine decay. - Radionuclide Transport and Decay: Post-LOCA Release in containment; Transport between connected Compartments and vent systems; Groundwater transport of radionuclides. - Non-Newtonian Fluid modeling for sludge, waste tanks, etc. ADAMS ML071581053 (titled 'Best Practice Guidelines for the use of CFD in Nuclear Reactor Safety Applications') poses guidelines for applying single phase CFD codes in nuclear reactor safety problems and GOTHIC is listed as a 'tool for 3D flows' and 'dispersal and deposition of radionuclides.' The Nuclear Quality Assurance (NQA) pedigree of GOTHIC is an important aspect for applications in the nuclear industry. The fundamental tracer models (convective transport, molecular and turbulent diffusion, removal mechanisms, etc.) have been verified using analytical solutions and validated against applicable separate effects tests. Also, GOTHIC has been benchmarked to many integrated effects tests, including Phebus FP (Fission Product). GOTHIC gives good agreement for the buildup and decay of fission products in Phebus Test 3. The model developed by ZNE demonstrates GOTHIC's applicability and acceptability for use in analyzing the migration and retention of radioactive isotopes and their progeny in normal operation and accident scenario analyses for isotope production facilities, hot cells, and gloveboxes. The tracer activities calculated by GOTHIC can then be used in downstream radiation transport and shielding codes like RADTRAD-NAI{sup C}, MCNP{sup R}, and MicroShield{sup R} to determine on-site and of-site doses. (authors)
Optical flow is the distribution of apparent velocities of movement of brightness patterns in a sequence of images. For large 3D image sequences, optical flow applications are time consuming and memory-bound. To cope with these problems, in this paper, we present parallel optical flow processing of 4D cardiac CT data on multicore cluster systems to significantly shorten the time for computing velocity fields of the heart in order to aid cardiologists in diagnosing heart disease such as myocardial infarction and cardiac dysrhythmia in time. First, we modify and extend two traditional 2D optical flow methods Horn-Schunck and Lucas-Kanade to three-dimensional cases to process the 4D cardiac CT data. Second, we extend Mat lab MPI to support parallel computing with Mat lab and Octave on these cluster systems. Then we develop the parallel Mat lab/Octave optical flow applications for the 4D cardiac CT data in detail. Our experimental results show that these parallel optical flow applications have good scalability with close to linear speedup, and are able to shorten the image processing time significantly from more than 5 hours on 4 cores to 1.5 minutes on 1024 cores.
On current multiprocessor architectures one must carefully distribute data in memory in order to achieve high performance. Process partitioning is the operation of rewriting an algorithm as a collection of tasks, each operating primarily on its own portion of the data, to carry out the computation in parallel. A semi-automatic approach to process partitioning is considered in which the compiler, guided by advice from the user, automatically transforms programs into such an interacting task system. This approach is illustrated with a picture processing example written in BLAZE, which is transformed into a task system maximizing locality of memory reference.
A prototype of a custom designed computer to be used as a processing element in a multiprocessor based jet engine simulator is described. The purpose of the custom design was to give the computer the speed and versatility required to simulate a jet engine in real time. Real time simulations are needed for closed loop testing of digital electronic engine controls. The prototype computer has a microcycle time of 133 nanoseconds. This speed was achieved by: prefetching the next instruction while the current one is executing, transporting data using high speed data busses, and using state of the art components such as a very large scale integration (VLSI) multiplier. Included are discussions of processing element requirements, design philosophy, the architecture of the custom designed processing element, the comprehensive instruction set, the diagnostic support software, and the development status of the custom design.
An interactive visualization system pV3 is being developed for the investigation of advanced computational methodologies employing visualization and parallel processing for the extraction of information contained in large-scale transient engineering simulations. Visual techniques for extracting information from the data in terms of cutting planes, iso-surfaces, particle tracing and vector fields are included in this system. This paper discusses improvements to the pV3 system developed under NASA's Affordable High Performance Computing project.
A parallel computer includes nodes, each having main memory and a messaging unit (MU). Each MU includes computer memory, which in turn includes, MU message buffers. Each MU message buffer is associated with an uninitialized process on the compute node. In the parallel computer, managing internode data communications for an uninitialized process includes: receiving, by an MU of a compute node, one or more data communications messages in an MU message buffer associated with an uninitialized process on the compute node; determining, by an application agent, that the MU message buffer associated with the uninitialized process is full prior to initialization of the uninitialized process; establishing, by the application agent, a temporary message buffer for the uninitialized process in main computer memory; and moving, by the application agent, data communications messages from the MU message buffer associated with the uninitialized process to the temporary message buffer in main computer memory.
A parallel computer includes nodes, each having main memory and a messaging unit (MU). Each MU includes computer memory, which in turn includes, MU message buffers. Each MU message buffer is associated with an uninitialized process on the compute node. In the parallel computer, managing internode data communications for an uninitialized process includes: receiving, by an MU of a compute node, one or more data communications messages in an MU message buffer associated with an uninitialized process on the compute node; determining, by an application agent, that the MU message buffer associated with the uninitialized process is full prior to initialization of the uninitialized process; establishing, by the application agent, a temporary message buffer for the uninitialized process in main computer memory; and moving, by the application agent, data communications messages from the MU message buffer associated with the uninitialized process to the temporary message buffer in main computer memory.
Non-processive molecular motors have to work together in ensembles in order to generate appreciable levels of force or movement. In skeletal muscle, for example, hundreds of myosin II molecules cooperate in thick filaments. In non-muscle cells, by contrast, small groups with few tens of non-muscle myosin II motors contribute to essential cellular processes such as transport, shape changes, or mechanosensing. Here we introduce a detailed and analytically tractable model for this important situation. Using a three-state crossbridge model for the myosin II motor cycle and exploiting the assumptions of fast power stroke kinetics and equal load sharing between motors in equivalent states, we reduce the stochastic reaction network to a one-step master equation for the binding and unbinding dynamics (parallel cluster model) and derive the rules for ensemble movement. We find that for constant external load, ensemble dynamics is strongly shaped by the catch bond character of myosin II, which leads to an increase of the fraction of bound motors under load and thus to firm attachment even for small ensembles. This adaptation to load results in a concave force-velocity relation described by a Hill relation. For external load provided by a linear spring, myosin II ensembles dynamically adjust themselves towards an isometric state with constant average position and load. The dynamics of the ensembles is now determined mainly by the distribution of motors over the different kinds of bound states. For increasing stiffness of the external spring, there is a sharp transition beyond which myosin II can no longer perform the power stroke. Slow unbinding from the pre-power-stroke state protects the ensembles against detachment.
Not provided.
Analyzing and clustering documents is a complex problem. One explored method of solving this problem borrows from nature, imitating the flocking behavior of birds. One limitation of this method of document clustering is its complexity O(n2). As the number of documents grows, it becomes increasingly difficult to generate results in a reasonable amount of time. In the last few years, the graphics processing unit (GPU) has received attention for its ability to solve highly-parallel and semi-parallel problems much faster than the traditional sequential processor. In this paper, we have conducted research to exploit this archi- tecture and apply its strengths to the flocking based document clustering problem. Using the CUDA platform from NVIDIA, we developed a doc- ument flocking implementation to be run on the NVIDIA GEFORCE GPU. Performance gains ranged from thirty-six to nearly sixty times improvement of the GPU over the CPU implementation.
Process migration is the ability to transfer a process from one machine to another. It is a useful facility in distributed computing environments, especially as computing devices become more pervasive and Internet access becomes more ubiquitous. The potential benefits of process migration, among others, are fault resilience by migrating processes off of faulty hosts, data access locality by migrating processes closer to the data, better system response time by migrating processes closer to users, dynamic load balancing by migrating processes to less loaded hosts, and improved service availability and administration by migrating processes before host maintenance so that applications can continue to run with minimal downtime. Although process migration provides substantial potential benefits and many approaches have been considered, achieving transparent process migration functionality has been difficult in practice. To address this problem, our work has designed, implemented, and evaluated new and powerful transparent process checkpoint-restart and migration mechanisms for desktop, server, and parallel applications that operate across heterogeneous cluster and mobile computing environments. A key aspect of this work has been to introduce lightweight operating system virtualization to provide processes with private, virtual namespaces that decouple and isolate processes from dependencies on the host operating system instance. This decoupling enables processes to be transparently checkpointed and migrated without modifying, recompiling, or relinking applications or the operating system. Building on this lightweight operating system virtualization approach, we have developed novel technologies that enable (1) coordinated, consistent checkpoint-restart and migration of multiple processes, (2) fast checkpointing of process and file system state to enable restart of multiple parallel execution environments and time travel, (3) process migration across heterogeneous software environments, (4) network checkpoint-restart and migration of distributed and parallel applications, (5) a utility computing infrastructure for mobile desktop cloud computing based on process checkpoint-restart and migration functionality, (6) a process migration security architecture for protecting applications and infrastructure from denial-of-service attacks, and (7) a checkpoint-restart mobile computing system using portable storage devices.
The design of the processing element of GASP, a GaAs supercomputer with a 500-MHz instruction issue rate and 1-GHz subsystem clocks, is presented. The novel, functionally modular, block data flow architecture of GASP is described. The architecture and design of a GASP processing element is then presented. The processing element (PE) is implemented in a hybrid semiconductor module with 152 custom GaAs ICs of eight different types. The effects of the implementation technology on both the system-level architecture and the PE design are discussed. SPICE simulations indicate that parts of the PE are capable of being clocked at 1 GHz, while the rest of the PE uses a 500-MHz clock. The architecture utilizes data flow techniques at a program block level, which allows efficient execution of parallel programs while maintaining reasonably good performance on sequential programs. A simulation study of the architecture indicates that an instruction execution rate of over 30,000 MIPS can be attained with 65 PEs.
Power and energy consumption are becoming an increasing concern in high performance computing. Compared to multi-core CPUs, GPUs have a much better performance per watt. In this paper we discuss efforts to redesign the most computation intensive parts of BLAST, an application that solves the equations for compressible hydrodynamics with high order finite elements, using GPUs BLAST, Dobrev. In order to exploit the hardware parallelism of GPUs and achieve high performance, we implemented custom linear algebra kernels. We intensively optimized our CUDA kernels by exploiting the memory hierarchy, which exceed the vendor's library routines substantially in performance. We proposed an auto tuning technique to adapt our CUDA kernels to the orders of the finite element method. Compared to a previous base implementation, our redesign and optimization lowered the energy consumption of the GPU in two aspects: 60% less time to solution and 10% less power required. Compared to the CPU-only solution, our GPU accelerated BLAST obtained a 2.5× overall speedup and 1.42× energy efficiency (green up) using 4th order (Q_4) finite elements, and a 1.9× speedup and 1.27× green up using 2nd order (Q2) finite elements.
Parallel or distributed processing is key to getting highest performance workstations. However, designing and implementing efficient parallel algorithms is difficult and error-prone. It is even more difficult to write code that is both portable to and efficient on many different computers. Finally, it is harder still to satisfy the above requirements and include the reliability and ease of use required of commercial software intended for use in a production environment. As a result, the application of parallel processing technology to commercial software has been extremely small even though there are numerous computationally demanding programs that would significantly benefit from application of parallel processing. This paper describes DSSLIB, which is a library of subroutines that perform many of the time-consuming computations in engineering and scientific software. DSSLIB combines the high efficiency and speed of parallel computation with a serial programming model that eliminates many undesirable side-effects of typical parallel code. The result is a simple way to incorporate the power of parallel processing into commercial software without compromising maintainability, reliability, or ease of use. This gives significant advantages over less powerful non-parallel entries in the market.