Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “GPU acceleration”

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 397 records · Page 22

encore : an O ( N g2) estimator for galaxy N -point correlation functions

ABSTRACT We present a new algorithm for efficiently computing the N-point correlation functions (NPCFs) of a 3D density field for arbitrary N. This can be applied both to a discrete spectroscopic galaxy survey and a continuous field. By expanding the statistics in a separable basis of isotropic functions built from spherical harmonics, the NPCFs can be estimated by counting pairs of particles in space, leading to an algorithm with complexity $\mathcal {O}(N_\mathrm{g}^2)$ for Ng particles, or $\mathcal {O}(N_\mathrm{FFT}\log N_\mathrm{FFT})$ when using a Fast Fourier Transform with NFFT grid-points. In practice, the rate-limiting step for N > 3 will often be the summation of the histogrammed spherical harmonic coefficients, particularly if the number of radial and angular bins is large. In this case, the algorithm scales linearly with Ng. The approach is implemented in the encore code, which can compute the 3PCF, 4PCF, 5PCF, and 6PCF of a BOSS-like galaxy survey in ${\sim}100$ CPU-hours, including the corrections necessary for non-uniform survey geometries. We discuss the implementation in depth, along with its GPU acceleration, and provide practical demonstration on realistic galaxy catalogues. Our approach can be straightforwardly applied to current and future data sets to unlock the potential of constraining cosmology from the higher point functions.

79 ASTRONOMY AND ASTROPHYSICS↗

Tidal disruption discs formed and fed by stream–stream and stream–disc interactions in global GRHD simulations

When a star passes close to a supermassive black hole (BH), the BH’s tidal forces rip it apart into a thin stream, leading to a tidal disruption event (TDE). In this work, we study the post-disruption phase of TDEs in general relativistic hydrodynamics (GRHD) using our GPU-accelerated code h-amr. We carry out the first grid-based simulation of a deep-penetration TDE (β = 7) with realistic system parameters: a black hole-to-star mass ratio of 10 6 , a parabolic stellar trajectory, and a non-zero BH spin. We also carry out a simulation of a tilted TDE whose stellar orbit is inclined relative to the BH midplane. We show that for our aligned TDE, an accretion disc forms due to the dissipation of orbital energy with ~20 percent of the infalling material reaching the BH. The dissipation is initially dominated by violent self-intersections and later by stream–disc interactions near the pericentre. The self-intersections completely disrupt the incoming stream, resulting in five distinct self-intersection events separated by approximately 12 h and a flaring in the accretion rate. We also find that the disc is eccentric with mean eccentricity e ≈ 0.88. For our tilted TDE, we find only partial self-intersections due to nodal precession near pericentre. Although these partial intersections eject gas out of the orbital plane, an accretion disc still forms with a similar accreted fraction of the material to the aligned case. These results have important implications for disc formation in realistic tidal disruptions. For instance, the periodicity in accretion rate induced by the complete stream disruption may explain the flaring events from Swift J1644+57.

79 ASTRONOMY AND ASTROPHYSICS↗

DAmodel: hierarchical Bayesian modelling of DA white dwarfs for spectrophotometric calibration

We use hierarchical Bayesian modelling to calibrate a network of 32 all-sky faint DA white dwarf (DA WD) spectrophotometric standards (⁠16.5 < V , 19.5⁠) alongside three CALSPEC standards, from 912 Å to 32 μm. The framework is the first of its kind to jointly infer photometric zero points and WD parameters (surface gravity log g⁠, effective temperature T eff ⁠, extinction A V ⁠, dust relation parameter R V ) by simultaneously modelling both photometric and spectroscopic data. We model panchromatic Hubble Space Telescope Wide Field Camera 3 (HST/WFC3) UVIS and IR photometry, HST/STIS UV spectroscopy, and ground-based optical spectroscopy to sub-per cent precision. Photometric residuals for the sample are the lowest yet yielding < 0.004 mag RMS on average from the UV to the NIR, achieved by jointly inferring time-dependent changes in system sensitivity and WFC3/IR count-rate nonlinearity. Our GPU-accelerated implementation enables efficient sampling via Hamiltonian Monte Carlo, critical for exploring the high-dimensional posterior space. The hierarchical nature of the model enables population analysis of intrinsic WD and dust parameters. Inferred spectral energy distributions from this model will be essential for calibrating the James Webb Space Telescope as well as next-generation surveys, including Vera Rubin Observatory’s Legacy Survey of Space and Time and the Nancy Grace Roman Space Telescope.

methods: statistical↗

Multitarget Rydberg gates via spatial blockade engineering

Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. Although neutral-atom quantum computers have demonstrated native multi-qubit gates, existing approaches that avoid additional control or multiple atomic species have been limited to single-target gates. We propose single-control-multi-target CZ^n gates on a single-species neutral-atom platform that require no extra control and have gate durations comparable to standard CZ gates. Our approach leverages tailored interatomic distances to create an asymmetric blockade between the control and target atoms. Using a GPU-accelerated pulse synthesis protocol, we design smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and $99.24\%$, respectively, even in the presence of simulated atom placement errors and Rydberg-state decay. Our approach is most effective for N=2 (CZZ) and N=3 targets (CZZZ); for larger N, increasing spatial crowding of the targets introduces significant challenges for maintaining the required blockade asymmetry. This work presents a practical path to implementing low-overhead multi-target gates in single-species neutral-atom systems, significantly reducing the resource overhead for syndrome extraction. To motivate the impact of these gates, we apply a greedy scheduling algorithm and we demonstrate that our proposed gates can reduce the number of atom reconfiguration costs by up to 50% for color code syndrome extraction of code distances greater than 5.

Stein, Samuel A.↗

Möbius domain-wall fermions on gradient-flowed dynamical HISQ ensembles

We report on salient features of a mixed lattice QCD action using valence Möbius domain-wall fermions solved on the dynamical 𝑁 𝑓 = 2 + 1 + 1 highly improved staggered quark sea-quark ensembles generated by the MILC Collaboration. The approximate chiral symmetry properties of the valence fermions are shown to be significantly improved by utilizing the gradient-flow scheme to first smear the highly improved staggered quark configurations. The greater numerical cost of the Möbius domain-wall inversions is mitigated by the highly efficient QUDA library optimized for NVIDIA GPU accelerated compute nodes. We have created an interface to this optimized QUDA solver in Chroma. We provide tuned parameters of the action and performance of QUDA using ensembles with the lattice spacings 𝑎 ≃ {0.15,0.12,0.09} fm and pion masses 𝑚 𝜋 ≃ {310,220,130} MeV. We have additionally generated two new ensembles with 𝑎 ∼ 0.12 fm and 𝑚 𝜋 ∼ {400,350} MeV. Furthermore, with a fixed flow time of 𝑡 𝑔⁡𝑓 =1 in lattice units, the residual chiral symmetry breaking of the valence fermions is kept below 10% of the light quark mass on all ensembles, 𝑚 res ≲ 0.1 × 𝑚 𝑙 , with moderate values of the fifth dimension 𝐿 5 and a domain-wall height 𝑀 5 ≤ 1.3. As a benchmark calculation, we perform a continuum, infinite volume, physical pion and kaon mass extrapolation of 𝐹 𝐾 ±⁡ /𝐹 𝜋 ± and demonstrate our results are independent of flow time and consistent with the FLAG determination of this quantity at the level of less than one standard deviation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gravitational waves from asymmetric oscillon dynamics?

It has been recently suggested that oscillons produced in the early universe from certain asymmetric potentials continue to emit gravitational waves for a number of e-folds of expansion after their formation, leading to potentially detectable gravitational wave signals. We revisit this claim by conducting a convergence study using graphics processing unit (GPU)-accelerated lattice simulations and show that numerical errors accumulated with time are significant in low-resolution scenarios, or in scenarios where the run-time causes the resolution to drop below the relevant scales in the problem. Our study determines that the dominant, growing high frequency peak of the gravitational wave signals in the fiducial "hill-top model" in [arXiv:1607.01314] is a numerical artifact. This new finding prompts the need for a more careful analysis of the numerical validity of other similar results related to gravitational waves from oscillon dynamics.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimizing the Fast Fourier Transform Using Mixed Precision on Tensor Core Hardware

The Fast Fourier Transform is a fundamental tool in scientific and technical computation. The highly parallelizable nature of the algorithm makes it a suitable candidate for GPU acceleration. This paper focuses on exploiting the speedup due to using the half precision multiplication capability of the latest GPUs' tensor core hardware without significantly degrading the precision of the Fourier Transform result. We develop an algorithm that dynamically splits the input single precision dataset into two half precision sets at the lowest level, uses half precision multiplication, and recombines the result at a later step. This work paves the way for using tensor cores for high precision inputs.

Sorna, Anumeena↗

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗

A Step towards Energy Efficient Computing: Redesigning a Hydrodynamic Application on CPU-GPU, In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

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.

Computer Science↗

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗

Supercomputing Pipelines Search for Therapeutics Against COVID-19

The urgent search for drugs to combat SARS-CoV-2 has included the use of supercomputers. The use of general-purpose graphical processing units (GPUs), massive parallelism, and new software for high-performance computing (HPC) has allowed researchers to search the vast chemical space of potential drugs faster than ever before. We developed a new drug discovery pipeline using the Summit supercomputer at Oak Ridge National Laboratory to help pioneer this effort, with new platforms that incorporate GPU-accelerated simulation and allow for the virtual screening of billions of potential drug compounds in days compared to weeks or months for their ability to inhibit SARS-COV-2 proteins. Here, this effort will accelerate the process of developing drugs to combat the current COVID-19 pandemic and other diseases.

60 APPLIED LIFE SCIENCES↗

Transformational Regional-Scale Earthquake Simulations with the DOE EarthQuake SIMulation Exascale Framework

Earthquakes present worldwide risk to economic and human safety. The 2023 earthquakes in Turkiye provided a reminder of the potential for catastrophic consequences with 50,700 deaths and 15.7 million people affected. The ability to predict ground motions and infrastructure damage for earthquakes continues to be a challenging problem for scientists and engineers. Until now, estimates of ground motions have been performed empirically by looking at sparse data from past earthquakes. This approach can provide statistical information on intensity amplitudes but cannot inform site-specific ground motions essential to developing the most effective resilience. Interest has grown in large-scale computational models to simulate earthquakes at regional scale. The U.S. Department of Energy EarthQuake SIMulation (EQSIM) framework was developed for regional-scale earthquake simulations at unprecedented fidelity, taking advantage of emerging GPU-accelerated systems. This article describes the EQSIM workflow and demonstrates regional-scale simulations with the new computational capability available to scientists in their quest to mitigate future disasters.

58 GEOSCIENCES↗

Continuous Emulation and Multiscale Visualization of Traffic Flow Using Stationary Roadside Sensor Data

With the advent of the next-generation traffic monitoring systems, there has been a significant increase in the spatial-temporal resolution of vehicle mobility data in many cities. Effective analysis and visualization of such data can provide transportation planners with data-driven insights, which can facilitate the understanding of multiscale traffic dynamics. In this paper, we present a web-based traffic emulator for emulating and visualizing near-real-time and historical traffic flows on highways using data from road-side sensors. To construct a continuous traffic flow, the emulator adopts an analytical pipeline that can (a) integrate traffic data collected from discrete road-side radar detection sensors, (b) interpolate traffic conditions (vehicle speed and volume) on unmeasured road segments based on traffic flow theory, and (c) generate lane-specific vehicle trajectories and movements using a mathematically optimized representation of the road network. Our app also provides an integrated visual workflow that allows users to explore the interconnected traffic dynamics using an appropriate traffic flow visualization selected based on the level of detail. We devise two innovative geo-visualization techniques that utilize an animated strips-network representation and a lane usage matrix to visualize lane performances. To ensure a smooth emulation of large-scale traffic flow in an easy-to-access web environment, we implement the emulator using client-side GPU-accelerated techniques. Lastly, we close with a case study that visualizes traffic dynamics of two scenarios - an afternoon peak hour and a traffic accident - in Chattanooga, Tennessee. Our app visualizes the responses of traffic dynamics during different traffic conditions, and to the presence of the traffic accident at different spatial scales.

42 ENGINEERING↗

Real-time Free-moving Active Coded Mask 3D Gamma-Ray Imaging

The ability to localize and map the distribution of gamma-ray emitting radionuclides in 3D has applications ranging from medical imaging to nuclear security. In the case of radiological source search and nuclear contamination remediation, the deployment of freely moving detection systems such as hand- held instruments or ground/aerial-based vehicles are critical in overcoming the inverse square law and complex shielding scenarios. Using contextual sensors, these systems can simultaneously generate 3D maps of the surrounding environment and track the position and orientation of the gamma-ray sensitive detectors in that environment. The fusion of contextual scene data and gamma-ray detector data to facilitate real-time 3D gamma-ray image reconstruction has been demonstrated with mobile HPGe and CdZnTe-based Compton cameras for gamma-ray energies ranging from a few hundred keV to several MeV. Here we apply this approach for lower energy (50-400 keV) gamma-rays, using a hand-held CdZnTe-based omnidirectional imaging system and an active coded mask imaging modality. Here, we present our approach to real-time reconstruction using a scene data constrained GPU- accelerated list-mode MLEM algorithm and show results from several measurements in the lab and in the field.

3D gamma-ray imaging↗

TH-C-18A-11: Investigating the Minimum Scan Parameters Required to Generate Free-Breathing Fast-Helical CT Scans Without Motion-Artifacts

Purpose: A recently proposed 4D-CT protocol uses deformable registration of free-breathing fast-helical CT scans to generate a breathing motion model. In order to allow accurate registration, free-breathing images are required to be free of doubling-artifacts, which arise when tissue motion is greater than scan speed. This work identifies the minimum scanner parameters required to successfully generate free-breathing fast-helical scans without doubling-artifacts. Methods: 10 patients were imaged under free breathing conditions 25 times in alternating directions with a 64-slice CT scanner using a low dose fast helical protocol. A high temporal resolution (0.1s) 4D-CT was generated using a patient specific motion model and patient breathing waveforms, and used as the input for a scanner simulation. Forward projections were calculated using helical cone-beam geometry (800 projections per rotation) and a GPU accelerated reconstruction algorithm was implemented. Various CT scanner detector widths and rotation times were simulated, and verified using a motion phantom. Doubling-artifacts were quantified in patient images using structural similarity maps to determine the similarity between axial slices. Results: Increasing amounts of doubling-artifacts were observed with increasing rotation times > 0.2s for 16×1mm slice scan geometry. No significant increase in doubling artifacts was observed for 64×1mm slice scan geometry up to 1.0s rotation time although blurring artifacts were observed >0.6s. Using a 16×1mm slice scan geometry, a rotation time of less than 0.3s (53mm/s scan speed) would be required to produce images of similar quality to a 64×1mm slice scan geometry. Conclusion: The current generation of 16 slice CT scanners, which are present in most Radiation Oncology departments, are not capable of generating free-breathing sorting-artifact-free images in the majority of patients. The next generation of CT scanners should be capable of at least 53mm/s scan speed in order to use a fast-helical 4D-CT protocol to generate a motion-artifact free 4D-CT. NIH R01CA096679.

60 APPLIED LIFE SCIENCES↗

SU-C-BRB-05: Determining the Adequacy of Auto-Contouring Via Probabilistic Assessment of Ensuing Treatment Plan Metrics in Comparison with Manual Contours

Purpose: To determine if auto-contour and manual-contour—based plans differ when evaluated with respect to probabilistic coverage metrics and biological model endpoints for prostate IMRT. Methods: Manual and auto-contours were created for 149 CT image sets acquired from 16 unique prostate patients. A single physician manually contoured all images. Auto-contouring was completed utilizing Pinnacle’s Smart Probabilistic Image Contouring Engine (SPICE). For each CT, three different 78 Gy/39 fraction 7-beam IMRT plans are created; PD with drawn ROIs, PAS with auto-contoured ROIs, and PM with auto-contoured OARs with the manually drawn target. For each plan, 1000 virtual treatment simulations with different sampled systematic errors for each simulation and a different sampled random error for each fraction were performed using our in-house GPU-accelerated robustness analyzer tool which reports the statistical probability of achieving dose-volume metrics, NTCP, TCP, and the probability of achieving the optimization criteria for both auto-contoured (AS) and manually drawn (D) ROIs. Metrics are reported for all possible cross-evaluation pairs of ROI types (AS,D) and planning scenarios (PD,PAS,PM). Bhattacharyya coefficient (BC) is calculated to measure the PDF similarities for the dose-volume metric, NTCP, TCP, and objectives with respect to the manually drawn contour evaluated on base plan (D-PD). Results: We observe high BC values (BC≥0.94) for all OAR objectives. BC values of max dose objective on CTV also signify high resemblance (BC≥0.93) between the distributions. On the other hand, BC values for CTV’s D95 and Dmin objectives are small for AS-PM, AS-PD. NTCP distributions are similar across all evaluation pairs, while TCP distributions of AS-PM, AS-PD sustain variations up to %6 compared to other evaluated pairs. Conclusion: No significant probabilistic differences are observed in the metrics when auto-contoured OARs are used. The prostate auto-contour needs improvement to achieve clinically equivalent plans.

60 APPLIED LIFE SCIENCES↗

SU-G-TeP1-06: Fast GPU Framework for Four-Dimensional Monte Carlo in Adaptive Intensity Modulated Proton Therapy (IMPT) for Mobile Tumors

Purpose: To demonstrate the feasibility of fast Monte Carlo (MC) treatment planning and verification using four-dimensional CT (4DCT) for adaptive IMPT for lung cancer patients. Methods: A validated GPU MC code, gPMC, has been linked to the patient database at our institution and employed to compute the dose-influence matrices (Dij) on the planning CT (pCT). The pCT is an average of the respiratory motion of the patient. The Dijs and patient structures were fed to the optimizer to calculate a treatment plan. To validate the plan against motion, a 4D dose distribution averaged over the possible starting phases is calculated using the 4DCT and a model of the time structure of the delivered spot map. The dose is accumulated using vector maps created by a GPU-accelerated deformable image registration program (DIR) from each phase of the 4DCT to the reference phase using the B-spline method. Calculation of the Dij matrices and the DIR are performed on a cluster, with each field and vector map calculated in parallel. Results: The Dij production takes ∼3.5s per beamlet for 10e6 protons, depending on the energy and the CT size. Generating a plan with 4D simulation of 1000 spots in 4 fields takes approximately 1h. To test the framework, IMPT plans for 10 lung cancer patients were generated for validation. Differences between the planned and the delivered dose of 19% in dose to some organs at risk and 1.4/21.1% in target mean dose/homogeneity with respect to the plan were observed, suggesting potential for improvement if adaptation is considered. Conclusion: A fast MC treatment planning framework has been developed that allows reliable plan design and verification for mobile targets and adaptation of treatment plans. This will significantly impact treatments for lung tumors, as 4D-MC dose calculations can now become part of planning strategies.

60 APPLIED LIFE SCIENCES↗

TH-CD-BRA-02: 3D Remote Dosimetry for MRI-Guided Radiation Therapy: A Hybrid Approach

Purpose: To validate the dosimetric accuracy of a commercially available MR-IGRT system using a combination of 3D dosimetry measurements (with PRESAGE(R) radiochromic plastic and optical-CT readout) and an in-house developed GPU-accelerated PENELOPE Monte-Carlo dose calculation system. Methods: {sup 60}Co IMRT subject to a 0.35T lateral magnetic field has recently been commissioned in our institution following AAPM’s TG-119 recommendations. We performed PRESAGE(R) sensitivity studies in 4ml cuvettes to verify linearity, MR-compatibility, and energy-independence. Using 10cm diameter PRESAGE(R), we delivered an open calibration field to examine the percent depth dose and a symmetrical 3-field plan with three adjacent regions of varying dose to determine uniformity within the dosimeter under a magnetic field. After initial testing, TG-119 plans were created in the TPS and then delivered to 14.5cm 2kg PRESAGE(R) dosimeters. Dose readout was performed via optical-CT at a second institution specializing in remote 3D dosimetry. Absolute dose was measured using an IBA CC01 ion chamber and the institution standard patient-specific QA methods were used to validate plan delivery. Calculated TG-119 plans were then compared with an independent Monte Carlo dose calculation (gPENELOPE). Results: PRESAGE(R) responds linearly (R{sup 2}=0.9996) to {sup 60}Co irradiation, in the presence of a 0.35T magnetic field, with a sensitivity of 0.0305(±0.003)cm{sup −1}Gy{sup −1}, within 1% of a 6MV non-MR linac irradiation (R{sup 2}=0.9991) with a sensitivity of 0.0302(±0.003)cm{sup −1}Gy{sup −1}. Analysis of TG-119 clinical plans using 3D-gamma (3%/3mm, 10% threshold) give passing rates of: HN 99.1%, prostate 98.0%, C-shape 90.8%, and multi-target 98.5%. The TPS agreed with gPENELOPE with a mean gamma passing rate of 98.4±1.5% (2%/2mm) with the z-score distributions following a standard normal distribution. Conclusion: We demonstrate for the first time that 3D remote dosimetry using both experimental and computational methods is a feasible and reliable approach to commissioning MR-IMRT, which is particularly useful for less specialized clinics in adopting this new treatment modality.

60 APPLIED LIFE SCIENCES↗