skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Kinetic Transport Equations and Parallel Computing

Abstract

This presentation discusses how parallel computing can be used to figure kinetic transport.

Authors:
 [1]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1329606
Report Number(s):
LA-UR-16-27432
TRN: US1700386
DOE Contract Number:
AC52-06NA25396
Resource Type:
Technical Report
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; 73 NUCLEAR PHYSICS AND RADIATION PHYSICS; 79 ASTRONOMY AND ASTROPHYSICS; PARALLEL PROCESSING; NEUTRON TRANSPORT THEORY; COMPUTER CALCULATIONS; NEUTRAL-PARTICLE TRANSPORT; NEUTRINOS; SUPERNOVAE; REACTORS

Citation Formats

Garrett, Charles Kristopher. Kinetic Transport Equations and Parallel Computing. United States: N. p., 2016. Web. doi:10.2172/1329606.
Garrett, Charles Kristopher. Kinetic Transport Equations and Parallel Computing. United States. doi:10.2172/1329606.
Garrett, Charles Kristopher. 2016. "Kinetic Transport Equations and Parallel Computing". United States. doi:10.2172/1329606. https://www.osti.gov/servlets/purl/1329606.
@article{osti_1329606,
title = {Kinetic Transport Equations and Parallel Computing},
author = {Garrett, Charles Kristopher},
abstractNote = {This presentation discusses how parallel computing can be used to figure kinetic transport.},
doi = {10.2172/1329606},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2016,
month = 9
}

Technical Report:

Save / Share:
  • A parallel computing framework has been developed to use with general-purpose radiation transport codes. The framework was implemented as a C++ module that uses MPI for message passing. It is intended to be used with older radiation transport codes implemented in Fortran77, Fortran 90 or C. The module is significantly independent of radiation transport codes it can be used with, and is connected to the codes by means of a number of interface functions. The framework was developed and tested in conjunction with the MARS15 code. It is possible to use it with other codes such as PHITS, FLUKA andmore » MCNP after certain adjustments. Besides the parallel computing functionality, the framework offers a checkpoint facility that allows restarting calculations with a saved checkpoint file. The checkpoint facility can be used in single process calculations as well as in the parallel regime. The framework corrects some of the known problems with the scheduling and load balancing found in the original implementations of the parallel computing functionality in MARS15 and PHITS. The framework can be used efficiently on homogeneous systems and networks of workstations, where the interference from the other users is possible.« less
  • As the capabilities of computing machinery grow, so does the diverse variety of their applications. The feasibility of many approaches to these applications depends solely upon the existence of computing machinery capable of performing these tasks within a given time constraint. Because the majority of the available computing machinery is general-purpose in nature, tasks that do not require purpose facilities, but that do require high throughput, are condemned to execution on expensive general-purpose hardware. This research describes several tasks that require fast computing machinery. These tasks do not require general-purpose facilities in the sense that the computing machinery used willmore » only perform a fixed set of tasks. Some of the tasks are simple in nature, but are required to execute on very-large data sets. Other tasks are computationally intensive in addition to possibly involving large data sets. Both simple and complex algorithms are considered. The discussion includes a description of the tasks. All of the above tasks are useful; however, their value is determined in part by the time required to perform them. This work discusses three architectures for performing remote-sensing tasks. These architectures can execute the described tasks more quickly than conventionally available hardware.« less
  • As the capabilities of computing machinery grow, so does the diverse variety of their applications. The feasibility of many approaches to these applications depends solely upon the existence of computing machinery capable of performing these tasks within a given time constraint. Because the majority of the available computing machinery is general-purpose in nature, tasks that do not require purpose facilities, but that do require high throughput, are condemned to execution on expensive general-purpose hardware. This research describes several tasks that require fast computing machinery. These tasks do not require general-purpose facilities in the sense that the computing machinery used willmore » only perform a fixed set of tasks. Some of the tasks are simple in nature, but are required to execute on very-large data sets. Other tasks are computationally intensive in addition to possibly involving large data sets. Both simple and complex algorithms are considered. The discussion includes a description of the tasks. All of the above tasks are useful; however, their value is determined in part by the time required to perform them. This work discusses three architectures for performing remote-sensing tasks. These architectures can execute the described tasks more quickly than conventionally available hardware.« less
  • The demand for very-high-speed data processing coupled with falling hardware costs has made large-scale parallel and distributed computer systems both desirable and feasible. Two modes of parallel processing are single-instruction stream-multiple data stream (SIMD) and multiple instruction stream - multiple data stream (MIMD). PASM, a partitionable SIMD/MIMD system, is a reconfigurable multimicroprocessor system being designed for image processing and pattern recognition. An important component of these systems is the interconnection network, the mechanism for communication among the computation nodes and memories. Assuring high reliability for such complex systems is a significant task. Thus, a crucial practical aspect of an interconnectionmore » network is fault tolerance. In answer to this need, the Extra Stage Cube (ESC), a fault-tolerant, multistage cube-type interconnection network, is defined. The fault tolerance of the ESC is explored for both single and multiple faults, routing tags are defined, and consideration is given to permuting data and partitioning the ESC in the presence of faults. The ESC is compared with other fault-tolerant multistage networks. Finally, reliability of the ESC and an enhanced version of it are investigated.« less
  • As a result of advances in microcomputer technology, it is now feasible to build large-scale parallel-processing systems capable of performing image-processing tasks more rapidly than previously possible. Such parallel-processing systems add levels of complexity for both the operating system and the application software. They impose constraints that make a direct transplantation of conventional (multiprogrammed) operating systems extremely inefficient (Bae80). This thesis considers the design of PASMOS, a distributed operating system for the PASM parallel-processing system. PASM is a reconfigurable multimicrocomputer system which is being designed at Purdue University for image-processing and pattern-recognition applications. The special-purpose nature of PASM has beenmore » exploited in the design of PASMOS. PASMOS has a hierarchical structure and is distributed throughout the hardware components of PASM. It utilizes the PASM hardware to create an execution environment (virtual machine) for parallel processing tasks. Facilities provided by PASMOS include those for task management and scheduling, memory management, user interaction, process communication and synchronization, and protection. The general performance of the PASM system was examined both analytically and via simulation.« less