Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel file systems”

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 325 records · Page 18

Phase Field Dislocation Dynamics (PFDD) version 2.x

This disclosure is for version 2.x of a mesoscale model called Phase Field Dislocation Dynamics (PFDD). PFDD is used for investigating deformation in nanoscale (grain sizes of ~300 nm and less) materials, such as metals and alloys. This approach models the motion and interaction of individual defects, namely dislocations, in the material using scalar-valued phase field variables, also called order parameters. The system is evolved through energy minimization thus the model calculates the total energy density in terms of the phase field variables. The energy minimization is completed using the Ginzburg-Landau equation, and is implemented with explicit time integration. The total system energy can be comprised of several terms, including the strain energy (which describes dislocation-dislocation interactions), the energy due to an applied stress (dislocation interactions with the applied stress), and a core/lattice (perfect dislocations) or generalized stacking fault (partial dislocations) energy (described the dislocation core structure). The latter term in particular may vary based on the crystal structure being modeled and is typically informed using lower length scale (e.g., atomistic) approaches, although no such (atomistic) calculations are completed within the PFDD algorithm. This basic formulation was previously reviewed by Los Alamos National Laboratory and released under license number C17113. This previously reviewed version we will henceforth refer to as PFDD v1.0. PFDD v1.0 consisted of 2 codes (one parallel and one serial) plus input files, all written in the C language. This new disclosure is addressing the next versions of the PFDD, versions 2.x. There have been several enhancements of PFDD v1.0, which are described here and included in the attached code, which we will refer to as PFDD v2.0. There are also several new features described here that are either planned or already in process and are expected to be subsequent releases, i.e., v2.1, v2.2, ...v2.x.

Hunter, Abigail↗

Applying Machine Learning to Understand Write Performance of Large-scale Parallel Filesystems

In high-performance computing (HPC), I/O performance prediction offers the potential to improve the efficiency of scientific computing. In particular, accurate prediction can make runtime estimates more precise, guide users toward optimal checkpoint strategies, and better inform facility provisioning and scheduling policies. HPC I/O performance is notoriously difficult to predict and model, however, in large part because of inherent variability and a lack of transparency in the behaviors of constituent storage system components. In this work we seek to advance the state of the art in HPC I/O performance prediction by (1) modeling the mean performance to address high variability, (2) deriving model features from write patterns, system architecture and system configurations, and (3) employing Lasso regression model to improve model accuracy. We demonstrate the efficacy of our approach by applying it to a crucial subset of common HPC I/O motifs, namely, file-per-process checkpoint write workloads. We conduct experiments on two distinct production HPC platforms—Titan at the Oak Ridge Leadership Computing Facility and Cetus at the Argonne Leadership Computing Facility—to train and evaluate our models. We find that we can attain ≤ 30% relative error for 92.79% and 99.64% of the samples in our test set on these platforms, respectively.

Xie, Bing↗

Proposed crystal structure of carbadox, C 11 H 10 N 4 O 4

A model for the crystal structure of carbadox has been generated and refined using synchrotron X-ray powder diffraction data and optimized using density functional theory techniques. Carbadox crystallizes in space groupP2 1 (#4) witha= 13.8155(3),b= 21.4662(1),c= 16.3297(3) Å,β= 110.0931(7)°,V= 4548.10(3) Å 3 , andZ= 16. The crystal structure is characterized by approximately parallel stacking of the eight independent carbadox molecules parallel to thebc-plane. There are two different molecular configurations of the eight carbadox molecules; five are in the lower-energy configuration and three are in a ~10% higher-energy configuration. This arrangement likely achieves the lowest-energy crystalline packing via hydrogen bonding. Hydrogen bonds link the molecules both within and between the planes. Each of the amino groups forms a N–H⋯O hydrogen bond to an oxygen atom of the 1,4-dioxidoquinoxaline ring system of another molecule. The result is four pairs of hydrogen-bonded molecules, which form rings with graph setR2,2(14). Variation in specimen preparation can affect the preferred orientation of particles considerably. The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

Materials Science↗

End-to-end data movement using MPI-IO over routed terabits infrastructures. In: NDM '13 Proceedings of the Third International Workshop on Network-Aware Data Management, Article No. 9

Scientific discovery is nowadays driven by large-scale simulations running on massively parallel high-performance computing (HPC) systems. These applications each generate a large amount of data, which then needs to be post-processed for example for data mining or visualization. Unfortunately, the computing platform used for post processing might be different from the one on which the data is initially generated, introducing the challenge of moving large amount of data between computing platforms. This is especially challenging when these two platforms are geographically separated since the data needs to be moved between computing facilities. This is even more critical when scientists tightly couple their domain specific applications with a post processing application. The paper presents a solution for the data transfer between MPI applications using a dedicated wide area network (WAN) terabit infrastructure. The proposed solution is based on parallel access to data files and the Message Passing Interface (MPI) over the Common Communication Infrastructure (CCI) for the data transfer over a routed infrastructure. In the context of this research, the Energy Sciences Network (ESnet) of the U.S. Department of Energy (DOE) is targeted for the transfer of data between DOE national laboratories.

Vallée, Geoffroy↗

End-to-End Data Movement Using MPI-IO Over Routed Terabots Infrastructures

Scientific discovery is nowadays driven by large-scale simulations running on massively parallel high-performance computing (HPC) systems. These applications each generate a large amount of data, which then needs to be post-processed for example for data mining or visualization. Unfortunately, the computing platform used for post processing might be different from the one on which the data is initially generated, introducing the challenge of moving large amount of data between computing platforms. This is especially challenging when these two platforms are geographically separated since the data needs to be moved between computing facilities. This is even more critical when scientists tightly couple their domain specific applications with a post processing application. The paper presents a solution for the data transfer between MPI applications using a dedicated wide area network (WAN) terabit infrastructure. The proposed solution is based on parallel access to data files and the Message Passing Interface (MPI) over the Common Communication Infrastructure (CCI) for the data transfer over a routed infrastructure. In the context of this research, the Energy Sciences Network (ESnet) of the U.S. Department of Energy (DOE) is targeted for the transfer of data between DOE national laboratories.

Vallee, Geoffroy R↗

Modernization Enhancements in SCALE 6.2

SCALE is a widely used suite of tools for nuclear systems modeling and simulation that provides comprehensive, verified and validated, user-friendly capabilities for criticality safety, reactor physics, radiation shielding, and sensitivity and uncertainty analysis. For more than 30 years, regulators, industry, and research institutions around the world have used SCALE for nuclear safety analysis and design. However, the underlying architecture of SCALE is based on a 40-year old design with dozens of independent functional modules and control programs, primarily implemented in the Fortran programming language, with extensive use of customized intermediate files to control the logical flow of the analysis. Data are passed between individual computational codes using custom binary files that are read from and written to the hard disk. The SCALE modernization plan provides a progression towards SCALE 7, which will provide an object-oriented parallel-enabled software infrastructure with state-of-the-art methods implemented as reusable components. This paper provides a brief overview of the goals of SCALE modernization and details some modernized features available with SCALE 6.2.

modern↗

Release of the ENDF/B-VII.1 Evaluated Nuclear Data File

The Cross Section Evaluation Working Group (CSEWG) released the ENDF/B-VII.1 library on December 22, 2011. The ENDF/B-VII.1 library is CSEWG's latest recommended evaluated nuclear data file for use in nuclear science and technology applications, and incorporates advances made in the five years since the release of ENDF/B-VII.0, including: many new evaluation in the neutron sublibrary (423 in all and over 190 of these contain covariances), new fission product yields and a greatly improved decay data sublibrary. This summary barely touches on the five years worth of advances present in the ENDF/B-VII.1 library. We expect that these changes will lead to improved integral performance in reactors and other applications. Furthermore, the expansion of covariance data in this release will allow for better uncertainty quantification, reducing design margins and costs. The ENDF library is an ongoing and evolving effort. Currently, the ENDF data community embarking on several parallel efforts to improve library management: (1) The adoption of a continuous integration system to provide evaluators 'instant' feedback on the quality of their evaluations and to provide data users with working 'beta' quality libraries in between major releases. (2) The transition to new hierarchical data format - the Generalized Nuclear Data (GND) format. We expect GND to enable new kinds of evaluated data which cannot be accommodated in the legacy ENDF format. (3) The development of data assimilation and uncertainty propagation techniques to enable the consistent use of integral experimental data in the evaluation process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

OpenMC

OpenMC is an open source, community-developed framework for performing Monte Carlo particle transport calculations.It is capable of simulating neutron and photon transport below ~50 MeV and also includes a model for bremsstrahlung production of photons by electrons/positrons. Fixed source, k-eigenvalue, and subcritical multiplication problems can be solved. Problem geometries can be modeled either using constructive solid geometry or a CAD representation. A flexible and efficient tally system enables a wide variety of physical quantities to be tallied and analyzed. OpenMC can run in parallel using a hybrid MPI and OpenMP programming model and has been extensively tested on leadership class supercomputers. A built-in Bateman equation solver enables the modeling of material composition changes due to irradiation. One of the unique features of OpenMC is its rich, extensible Python and C/C++ programming interfaces that enable programming pre- and post-processing, multigroup cross section generation, workflow automation, multiphysics coupling, and the visualization of geometry and tally results. In addition to the core Monte Carlo transport solver and associated APIs, OpenMC includes a Python-based nuclear data interface that enables power users to inspect, modify,and perform various types of nuclear data processing on ENDF, ACE, and OpenMC¿s native HDF5 files

ROMANO, PaulK.↗

Quinoa, Version 0.2

Quinoa is a set of computational tools that enables research and numerical analysis in fluid dynamics. At this time it remains a test-bed to experiment with various algorithms using fully asynchronous runtime systems. Currently, Quinoa consists of the following tools: (1) Walker, a numerical integrator for systems of stochastic differential equations in time. It is a mathematical tool to analyze and design the behavior of stochastic differential equations. It allows the estimation of arbitrary coupled statistics and probability density functions and is currently used for the design of statistical moment approximations for multiple mixing materials in variable-density turbulence. (2) Inciter, an overdecomposition-aware finite element field solver for partial differential equations using 3D unstructured grids. Inciter is used to research asynchronous mesh-based algorithms and to experiment with coupling asynchronous to bulk-synchronous parallel code. Two planned new features of Inciter, compared to the previous release (LA-CC-16-015), to be implemented in 2017, are (a) a simple Navier-Stokes solver for ideal single-material compressible gases, and (b) solution-adaptive mesh refinement (AMR), which enables dynamically concentrating compute resources to regions with interesting physics. Using the NS-AMR problem we plan to explore how to scale such high-load-imbalance simulations, representative of large production multiphysics codes, to very large problems on very large computers using an asynchronous runtime system. (3) RNGTest, a test harness to subject random number generators to stringent statistical tests enabling quantitative ranking with respect to their quality and computational cost. (4) UnitTest, a unit test harness, running hundreds of tests per second, capable of testing serial, synchronous, and asynchronous functions. (5) MeshConv, a mesh file converter that can be used to convert 3D tetrahedron meshes from and to either of the following formats: Gmsh, http://www.geuz.org/gmsh, Netgen, http://sourceforge.net/apps/mediawiki/netgen-mesher, ExodusII, http://sourceforge.net/projects/exodusii, HyperMesh, http://www.altairhyperworks.com/product/HyperMesh.

Bakosi, Jozsef↗

Requirements Description of GAMSOR and GAMSRC

This report presents the modeling and simulation capabilities of Argonne National Laboratory’s GAMSOR and GAMSRC code that is used in present reactor analysis activities. These capabilities will then be used to establish the set of verification tasks necessary to verify GAMSOR for use on commercial projects. A similar approach was taken for the PERSENT, REBUS and DIF3D software packages. The GAMSOR program is a modified version of DIF3D used to obtain the coupled neutron gamma flux distributions for a given reactor system. GAMSOR was first developed in the 1980s and its work has progressed in parallel with DIF3D throughout its various development phases. While GAMSOR is compatible with DIF3D-FD and DIF3D-Nodal, DIF3D-VARIANT is most commonly used today and will be the focus of the present verification effort. As covered in [1], GAMSOR was built to provide more accurate heating distributions by explicitly solving for both the gamma and neutron heating distributions. Without this consideration, gamma heat is normally assumed to be deposited locally at the site of gamma production. This is acceptable for modeling some phenomena because the total energy production is preserved, but it can lead to inaccurate approximations of fluence-dependent behaviors such as fuel performance, swelling, cladding embrittlement, radiation induced creep, and power peaking. The outputs from GAMSOR are contained in multiple intermediate and final output files: FIXSRC, VARSRC, GTFLUX, GHFLUX, PWDINT, NPDINT, and GPDINT. DIF3D normally produces a PWDINT file containing power density results, with the assumption that gamma rays are absorbed where they are emitted (i.e., energy deposition is local with no modeled transport). With GAMSOR, neutron power density (NPDINT) and gamma power density (GPDINT) are both produced, with their summed power densities replacing the results in PWDINT for total heating (i.e., recoverable) power density.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Pilgrim Hot Springs: GEOPHIRES Inputs and Outputs for Direct-Use Geothermal District Heating and Cooling

This dataset includes files for a techno-economic analysis conducted using the GEOPHIRES simulator to examine the feasibility of expanding a larger district heating site in a remote location: Pilgrim Hot Springs, Alaska. Files included here are GEOPHIRES inputs and outputs for five different scenarios with varying demand, cycle, and system design characteristics to analyze. Also included is the link to the GEOPHIRES GitHub, as well as a link to the dataset that contains the energy modelling used to determine the heating demand for the district. For a list of the differences between scenarios, see the included "Input Overview.txt" file. Fields included in the input files are: subsurface technical parameters, surface technical parameters, financial parameters, capital and O&M parameters, as well as simulation parameters. The output files are case reports that summarize all equipment, reservoir characteristics, costs, and heating profiles.

15 GEOTHERMAL ENERGY↗

Toward Transparent Data Management in Multi-layer Storage Hierarchy for HPC Systems

Upcoming exascale high performance computing (HPC) systems are expected to comprise multi-tier storage hierarchy, and thus will necessitate innovative storage and I/O mechanisms. Traditional disk and block-based interfaces and file systems face severe challenges in utilizing capabilities of storage hierarchies due to the lack of hierarchy support and semantic interfaces. Object-based and semantically-rich data abstractions for scientific data management on large scale systems offer a sustainable solution to these challenges. Such data abstractions can also simplify users involvement in data movement. Here, we take the first steps of realizing such an object abstraction and explore storage mechanisms for these objects to enhance I/O performance, especially for scientific applications. We explore how an object-based interface can facilitate next generation scalable computing systems by presenting the mapping of data I/O from two real world HPC scientific use cases: a plasma physics simulation code (VPIC) and a cosmology simulation code (HACC). Our storage model stores data objects in different physical organizations to support data movement across layers of memory/storage hierarchy. Our implementation sclaes well to 16K parallel processes, and compared to the state of the art, such as MPI-IO and HDF5, our object-based data abstractions and data placement strategy in multi-level storage hierarchy achieves up to 7 X I/O performance improvement for scientific data.

97 MATHEMATICS AND COMPUTING↗

FLASSH 1.0: Thermal scattering law evaluation and cross section generation for reactor physics applications

The Full Law Analysis Scattering System Hub (FLASSH) is a modern, advanced code which evaluates the thermal scattering law (TSL) along with accompanying cross sections. FLASSH features generalized methods which accommodate any material structure. Historical approximations including the incoherent and cubic approximations have been removed. Instead, the latest release of FLASSH features advanced physics options including distinct corrections (1-phonon contributions) and non-cubic formulations. The non-cubic elastic and inelastic contributions are necessary to accurately evaluate 1-phonon contributions. Both non-cubic and 1-phonon calculations require high-density sampling of the various scattering directions. Optimization and parallelization of these routines were therefore necessary to produce results in a reasonable timeframe. With these notable improvements to the generalized TSL, FLASSH 1.0 meets benchmark requirements, demonstrating noticeable agreement with experiment for both TSLs and the resulting integrated cross sections. Additional features including a graphical user interface (GUI), plotting diagnostics, and formatted output options including ACE files allow users to complete a TSL evaluation with minimal input and maximum flexibility. The user GUI creates input files for FLASSH, reducing user error and also providing built-in error checks. Autofill options and suggested input values help make TSL evaluation accessible to novice users. The FLASSH code is compiled to run on both Windows and Linux platforms with automatic parallelization. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SU-E-T-04: 3D Printed Patient-Specific Surface Mould Applicators for Brachytherapy Treatment of Superficial Lesions

Purpose: Evaluate the feasibility of constructing 3D-printed patient-specific surface mould applicators for HDR brachytherapy treatment of superficial lesions. Methods: We propose using computer-aided design software to create 3D printed surface mould applicators for brachytherapy. A mould generation module was developed in the open-source 3D Slicer ( http://www.slicer.org ) medical image analysis platform. The system extracts the skin surface from CT images, and generates smooth catheter paths over the region of interest based on user-defined start and end points at a specified stand-off distance from the skin surface. The catheter paths are radially extended to create catheter channels that are sufficiently wide to ensure smooth insertion of catheters for a safe source travel. An outer mould surface is generated to encompass the channels. The mould is also equipped with fiducial markers to ensure its reproducible placement. A surface mould applicator with eight parallel catheter channels of 4mm diameters was fabricated for the nose region of a head phantom; flexible plastic catheters of 2mm diameter were threaded through these channels maintaining 10mm catheter separations and a 5mm stand-off distance from the skin surface. The apparatus yielded 3mm thickness of mould material between channels and the skin. The mould design was exported as a stereolithography file to a Dimension SST1200es 3D printer and printed using ABS Plus plastic material. Results: The applicator closely matched its design and was found to be sufficiently rigid without deformation during repeated application on the head phantom. Catheters were easily threaded into channels carved along catheter paths. Further tests are required to evaluate feasibility of channel diameters smaller than 4mm. Conclusion: Construction of 3D-printed mould applicators show promise for use in patient specific brachytherapy of superficial lesions. Further evaluation of 3D printing techniques and materials is required for constructing sufficiently thin, rigid and durable surface moulds suitable for clinical deployment.

60 APPLIED LIFE SCIENCES↗

Sodium-Cooled Fast Reactor Reference Plant Model

This report details the progress of Idaho National Laboratory (INL) in creating a reference plant multiphysics model for the Advanced Burner Test Reactor (ABTR). This model was developed under Task 13 of the U.S. Nuclear Regulatory Commission project “Development and Modeling Support for Advanced Non-Light Water Reactors,” and is an extension of the reference plant model developed in Task 4b, which was improved upon in the following ways. (1) The discrete ordinates method was used in lieu of the super-homogenization (SPH)-corrected diffusion approximation in order to better capture the anisotropic scattering contribution and the neutron leakage change due to thermal expansion. (2) The novel neutronic spatial discretization approach, termed the ring-heterogeneous (RH) approximation, was conceptualized and introduced to capture the differential expansion of the materials in the core. This new technique proved capable of preserving fission rates and maintaining the eigenvalue within 2.5% and 266 pcm with 9 neutron energy groups, respectively. Separating the different materials in the core enables the differential expansion of materials to be explicitly accounted for, eliminating the need for problem-specific cross-section functionalization techniques. (3) The SAM model for the core and system thermal-hydraulics analysis was updated to include 61 channels instead of just four representative ones. This enables users to obtain improved spatial resolution for sodium temperature and density scalar fields. (4) All the mesh files were created via the Multiphysics Object-Oriented Simulation Environment (MOOSE) Reactor module, eliminating all reliance on external tools for mesh creation. (5) Finally, the fuel axial expansion now leverages the HT9 and UPuZr material properties that have been validated against experimental data. The reference plant model was used to perform a full-core unprotected loss of flow (ULOF) transient calculation, including neutronics, thermal and mechanical feedback mechanisms. Future work will be devoted to further enhancements of the model. Potential improvements to the model include the addition of the control rod driveline expansion feedback and the upgrading of the support plate model so as to explicitly include 3D effects. Additionally, a Nuclear Energy Advanced Modeling and Simulation funded parallel effort has completely automated the creation of the ring-heterogeneous (RH) mesh from the fully heterogeneous (FH) geometry, thus maximizing user friendliness for the sodium fast reactor sodium-cooled fast reactor (SFR) workflow and will be incorporated in future work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Peer-to-peer architectures for exascale computing : LDRD final report.

The goal of this research was to investigate the potential for employing dynamic, decentralized software architectures to achieve reliability in future high-performance computing platforms. These architectures, inspired by peer-to-peer networks such as botnets that already scale to millions of unreliable nodes, hold promise for enabling scientific applications to run usefully on next-generation exascale platforms ({approx} 10{sup 18} operations per second). Traditional parallel programming techniques suffer rapid deterioration of performance scaling with growing platform size, as the work of coping with increasingly frequent failures dominates over useful computation. Our studies suggest that new architectures, in which failures are treated as ubiquitous and their effects are considered as simply another controllable source of error in a scientific computation, can remove such obstacles to exascale computing for certain applications. We have developed a simulation framework, as well as a preliminary implementation in a large-scale emulation environment, for exploration of these 'fault-oblivious computing' approaches. High-performance computing (HPC) faces a fundamental problem of increasing total component failure rates due to increasing system sizes, which threaten to degrade system reliability to an unusable level by the time the exascale range is reached ({approx} 10{sup 18} operations per second, requiring of order millions of processors). As computer scientists seek a way to scale system software for next-generation exascale machines, it is worth considering peer-to-peer (P2P) architectures that are already capable of supporting 10{sup 6}-10{sup 7} unreliable nodes. Exascale platforms will require a different way of looking at systems and software because the machine will likely not be available in its entirety for a meaningful execution time. Realistic estimates of failure rates range from a few times per day to more than once per hour for these platforms. P2P architectures give us a starting point for crafting applications and system software for exascale. In the context of the Internet, P2P applications (e.g., file sharing, botnets) have already solved this problem for 10{sup 6}-10{sup 7} nodes. Usually based on a fractal distributed hash table structure, these systems have proven robust in practice to constant and unpredictable outages, failures, and even subversion. For example, a recent estimate of botnet turnover (i.e., the number of machines leaving and joining) is about 11% per week. Nonetheless, P2P networks remain effective despite these failures: The Conficker botnet has grown to {approx} 5 x 10{sup 6} peers. Unlike today's system software and applications, those for next-generation exascale machines cannot assume a static structure and, to be scalable over millions of nodes, must be decentralized. P2P architectures achieve both, and provide a promising model for 'fault-oblivious computing'. This project aimed to study the dynamics of P2P networks in the context of a design for exascale systems and applications. Having no single point of failure, the most successful P2P architectures are adaptive and self-organizing. While there has been some previous work applying P2P to message passing, little attention has been previously paid to the tightly coupled exascale domain. Typically, the per-node footprint of P2P systems is small, making them ideal for HPC use. The implementation on each peer node cooperates en masse to 'heal' disruptions rather than relying on a controlling 'master' node. Understanding this cooperative behavior from a complex systems viewpoint is essential to predicting useful environments for the inextricably unreliable exascale platforms of the future. We sought to obtain theoretical insight into the stability and large-scale behavior of candidate architectures, and to work toward leveraging Sandia's Emulytics platform to test promising candidates in a realistic (ultimately {ge} 10{sup 7} nodes) setting. Our primary example applications are drawn from linear algebra: a Jacobi relaxation solver for the heat equation, and the closely related technique of value iteration in optimization. We aimed to apply P2P concepts in designing implementations capable of surviving an unreliable machine of 10{sup 6} nodes.

99 GENERAL AND MISCELLANEOUS↗

Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting Approach

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named “external facelist”, to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Tsalikis, Spiros [Kitware] (ORCID:0000000151137195↗

Web-based, GPU-accelerated, Monte Carlo simulation and visualization of indirect radiation imaging detector performance

Purpose: Monte Carlo simulations play a vital role in the understanding of the fundamental limitations, design, and optimization of existing and emerging medical imaging systems. Efforts in this area have resulted in the development of a wide variety of open-source software packages. One such package, hybridMANTIS, uses a novel hybrid concept to model indirect scintillator detectors by balancing the computational load using dual CPU and graphics processing unit (GPU) processors, obtaining computational efficiency with reasonable accuracy. In this work, the authors describe two open-source visualization interfaces, webMANTIS and visualMANTIS to facilitate the setup of computational experiments via hybridMANTIS. Methods: The visualization tools visualMANTIS and webMANTIS enable the user to control simulation properties through a user interface. In the case of webMANTIS, control via a web browser allows access through mobile devices such as smartphones or tablets. webMANTIS acts as a server back-end and communicates with an NVIDIA GPU computing cluster that can support multiuser environments where users can execute different experiments in parallel. Results: The output consists of point response and pulse-height spectrum, and optical transport statistics generated by hybridMANTIS. The users can download the output images and statistics through a zip file for future reference. In addition, webMANTIS provides a visualization window that displays a few selected optical photon path as they get transported through the detector columns and allows the user to trace the history of the optical photons. Conclusions: The visualization tools visualMANTIS and webMANTIS provide features such as on the fly generation of pulse-height spectra and response functions for microcolumnar x-ray imagers while allowing users to save simulation parameters and results from prior experiments. The graphical interfaces simplify the simulation setup and allow the user to go directly from specifying input parameters to receiving visual feedback for the model predictions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗