Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “block-based”

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.

31 records · Page 2

SU-E-T-461: Impact of the Radiation Sensitivity of Tumor and Geometric Design of the GRID Block On the Clinical Response of Grid Therapy

Purpose: The spatially fractionated radiation therapy (Grid therapy) is a novel technique that has been recently introduced for treatments of the patients with advanced bulky tumors. The purpose of this study is to investigate the effect of the radiation sensitivity of tumor and Grid block design on the clinical response of the Grid therapy. Methods: The Geant4 toolkit is used to simulate a Varian2100C linear accelerator with the block-based Grid. The dose profile has been utilized to calculate the Therapeutic Ratio (TR) and Equivalent Uniform Dose (EUD) for different types of tumors. These calculations were performed with respect to their radiation sensitivities using Linear Quadratic model (LQ). Clinical responses of few hundred patients from different publications that were treated with Grid therapy, have been used to validate correlation between tumor radiation sensitivity and clinical response of Grid therapy. Moreover, the influence of Grid design on clinical response of this radiation technique was investigated with using Monte Carlo simulation of a Grid block with different hole-diameters of 0.5 cm, 0.75 cm, 1.25 cm, and 1.5 cm. The Geometrical Sparing Factor (GSF) was considered to compare the results from different Grid designs. Results: The higher clinical response of Grid therapy for more radio-resistant tumors was confirmed in both theoretical assumptions and clinical outcomes. In addition, the results indicate that the Grid hole diameter have more effect on increasing the TR in comparison with the hole center-to-center distance effect. From this Monte Carlo study, a Grid design with the hole diameter between 1.25 cm and 1.5 cm with GSF value of 0.90 is recommended. Conclusion: Grid Therapy is more effective for more radio-resistant tumors.The optimum results of the Grid therapy depend on selection of the appropriate Grid design.This study is a first step toward clarifying some important aspects in a clinical response of spatially fractionated radiation therapy.

60 APPLIED LIFE SCIENCES↗

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that these schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.

Ren, Bin↗

DGTile

SAND2022-12898 O DGTile is a lightweight C++17 adaptive mesh library meant to support explicit discontinuous Galerkin applications on high performance computing machines. DGTile uses a block-based adaptive mesh refinement approach, where the underlying mesh data structure is an octree in three dimensions, where each leaf node of the tree represents a Cartesian grid. Over each grid, DGTile provides modal discontinuous Galerkin basis functions to facilitate simulations. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Granzow, Brian↗

Motivation and Design of the Sirocco Storage System Version 1.0.

Sirocco is a massively parallel, high performance storage system for the exascale era. It emphasizes client-to-client coordination, low server-side coupling, and free data movement to improve resilience and performance. Its architecture is inspired by peer-to-peer and victim- cache architectures. By leveraging these ideas, Sirocco natively supports several media types, including RAM, flash, disk, and archival storage, with automatic migration between levels. Sirocco also includes storage interfaces and support that are more advanced than typical block storage. Sirocco enables clients to efficiently use key-value storage or block-based storage with the same interface. It also provides several levels of transactional data updates within a single storage command, including full ACID-compliant updates. This transaction support extends to updating several objects within a single transaction. Further support is provided for con- currency control, enabling greater performance for workloads while providing safe concurrent modification. By pioneering these and other technologies and techniques in the storage system, Sirocco is poised to fulfill a need for a massively scalable, write-optimized storage system for exascale systems. This is version 1.0 of a document reflecting the current and planned state of Sirocco. Further versions of this document will be accessible at http://www.cs.sandia.gov/Scalable_IO/ sirocco .

97 MATHEMATICS AND COMPUTING↗

Leveraging Computational Storage Devices in Campaign Storage [Slides]

Computational storage provides new ways of accelerating data-intensive applications. In-drive data management schemes matter (O_DIRECT, clustered index). Layer violation: “cheating” one filesystem may be possible; cheating multiple layers of filesystems is hard (FS internal load balancing, fail over, compression, concurrency control). The future directions include block-based acceleration to object-based acceleration.

97 MATHEMATICS AND COMPUTING↗

AthenaK: A Performance-portable Version of the Athena++ Adaptive Mesh Refinement Framework

We describe AthenaK: a new implementation of the Athena++ block-based adaptive mesh refinement framework using the Kokkos programming model. Finite volume methods for Newtonian, special relativistic, and general relativistic (GR) hydrodynamics and magnetohydrodynamics (MHD), and GR-radiation hydrodynamics and MHD, as well as a module for evolving Lagrangian tracer or charged test particles (e.g., cosmic rays) are implemented using the framework. In two companion papers, we describe (1) a new solver for the Einstein equations based on the Z4c formalism, and (2) a GRMHD solver in dynamical spacetimes also implemented using the framework, enabling new applications in numerical relativity. By adopting Kokkos, the code can be run on virtually any hardware, including CPUs, GPUs from multiple vendors, and emerging Advanced RISC Machine processors. AthenaK shows excellent performance and weak scaling, achieving over 1 billion cell updates per second for hydrodynamics in three dimensions on a single NVIDIA Grace Hopper processor. It does this with a typical parallel efficiency of 80% on 65,536 AMD GPUs on the OLCF Frontier system. Such performance portability enables AthenaK to leverage modern exascale computing systems for challenging applications in astrophysical fluid dynamics, numerical relativity, and multimessenger astrophysics.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive technique to maximize lossless image data compression of satellite images

Data compression will pay an increasingly important role in the storage and transmission of image data within NASA science programs as the Earth Observing System comes into operation. It is important that the science data be preserved at the fidelity the instrument and the satellite communication systems were designed to produce. Lossless compression must therefore be applied, at least, to archive the processed instrument data. In this paper, we present an analysis of the performance of lossless compression techniques and develop an adaptive approach which applied image remapping, feature-based image segmentation to determine regions of similar entropy and high-order arithmetic coding to obtain significant improvements over the use of conventional compression techniques alone. Image remapping is used to transform the original image into a lower entropy state. Several techniques were tested on satellite images including differential pulse code modulation, bi-linear interpolation, and block-based linear predictive coding. The results of these experiments are discussed and trade-offs between computation requirements and entropy reductions are used to identify the optimum approach for a variety of satellite images. Further entropy reduction can be achieved by segmenting the image based on local entropy properties then applying a coding technique which maximizes compression for the region. Experimental results are presented showing the effect of different coding techniques for regions of different entropy. A rule-base is developed through which the technique giving the best compression is selected. The paper concludes that maximum compression can be achieved cost effectively and at acceptable performance rates with a combination of techniques which are selected based on image contextual information.

Stewart, Robert J.↗

Vector quantization for efficient coding of upper subbands

This paper examines the application of vector quantization (VQ) to exploit both intra-band and inter-band redundancy in subband coding. The focus here is on the exploitation of inter-band dependency. It is shown that VQ is particularly suitable and effective for coding the upper subbands. Three subband decomposition-based VQ coding schemes are proposed here to exploit the inter-band dependency by making full use of the extra flexibility of VQ approach over scalar quantization. A quadtree-based variable rate VQ (VRVQ) scheme which takes full advantage of the intra-band and inter-band redundancy is first proposed. Then, a more easily implementable alternative based on an efficient block-based edge estimation technique is employed to overcome the implementational barriers of the first scheme. Finally, a predictive VQ scheme formulated in the context of finite state VQ is proposed to further exploit the dependency among different subbands. A VRVQ scheme proposed elsewhere is extended to provide an efficient bit allocation procedure. Simulation results show that these three hybrid techniques have advantages, in terms of peak signal-to-noise ratio (PSNR) and complexity, over other existing subband-VQ approaches.

Zeng, W. J.↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Magnetic Mapping in the Inner Magnetosphere using Kamodo

Many models require specialized access and interpolation schemes to effectively extract and interpolate their outputs. In particular, the Block-Adaptive Tree Solarwind Roe Upwind Scheme (BATSRUS) component of the Space Weather Modeling Framework (SWMF) requires Kamodo to take advantage of its block-based adaptive grid structure, and the Lyon-Fedder Mobarry magnetosphere model (or its successor GAMERA) needs a scheme that appreciates the distorted spherical arrangement of grid vertices on a non-orthogonal grid. With the flythrough layer developed by Ringuette et al. (SH42E-2337), the underlying model readers have been adapted to use multiple time steps in a single Python session to perform 4- dimensional interpolations in time and space. Kamodo now utilizes lazy interpolation that loads data only when needed. We present the successful integration of SWMF/BATSRUS magnetosphere access and interpolation into the new 4D Kamodo framework utilizing an external library of C code. Through function composition, Kamodo facilitates the calculation of derived quantities and the transformation of positions and vectors into different coordinate systems. This work is a significant step towards performing field line tracing in Kamodo with SWMF magnetosphere outputs.

Lutz Rastaetter↗

Precision in Assembled Discrete Lattice Space Structures for Next-Generation ISAM Applications

Robust autonomous robotic assembly of large-scale space structures has been a long-term and challenging goal to enable higher quality in-space communication and science instrumentation. For optical observatory support structures and antenna structures, the challenge is the strict dimensional precision requirements (generally RMS surface error) driven by the operational radiation wavelength. Early theoretical work in the area linked RMS surface error of a reflector support truss plate to the natural passive dynamic mode frequencies of the structure, as well as to the error distribution in dimensions of constituent structural elements. Prior robotic truss assembly demonstrations focused on designing ultra-high precision structural elements, joints, and robotic actuators. Recently, an alternative space structure assembly strategy based on a programmable matter approach (NASA ARMADAS) was demonstrated. This approach uses lattice building blocks (voxels) that are reversibly, mechanically joined into a bulk lattice structure by robots that locomote in and on the structure itself. Such a system can achieve high-level autonomy with low computation, robustly assemble utilizing inexpensive and imprecise robots, and efficiently build structures several orders of magnitude larger than the assembly robots. However, for instrumentation support structure applications, the resulting precision of these building block-based lattice structures is not well studied. Since they are demonstrated with many more assembly units than prior art trusses, it is unclear whether the same precision design approaches apply. In this work, we study in simulation the effects of voxel geometry, error in distribution, assembly resolution (module size), and assembly geometry on the error of both beam and plate lattice structures. While average RMS error of a plate increases with plate size, increasing plate thickness quickly collapses RMS error towards a limit that is on the order of the error of the constituent parts. We validate our models against previously published precision measurements of built systems. Results from this study will guide manufacturing precision requirements, as well as designs, for future robotically assembled structural applications and establish feasibility for different applications.

Christine E Gregg↗

Adaptive mesh refinement for shocks and material interfaces

There are three kinds of adaptive mesh refinement (AMR) in structured meshes. Block-based AMR sometimes over refines meshes. Cell-based AMR treats cells cell by cell and thus loses the advantage of the nature of structured meshes. Patch-based AMR is intended to combine advantages of block- and cell-based AMR, i.e., the nature of structured meshes and sharp regions of refinement. But, patch-based AMR has its own difficulties. For example, patch-based AMR typically cannot preserve symmetries of physics problems. In this paper, we will present an approach for a patch-based AMR for hydrodynamics simulations. The approach consists of clustering, symmetry preserving, mesh continuity, flux correction, communications, management of patches, and load balance. The special features of this patch-based AMR include symmetry preserving, efficiency of refinement across shock fronts and material interfaces, special implementation of flux correction, and patch management in parallel computing environments. To demonstrate the capability of the AMR framework, we will show both two- and three-dimensional hydrodynamics simulations with many levels of refinement.

99 GENERAL AND MISCELLANEOUS↗