Search NASA⌕ Search

SEARCH · Search NASA

Results for “Runtime”

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 955 records · Page 53

Comparison of Thin Film Heat Flux Gauge Technologies Emphasizing Continuous-Duration Operation

Abstract Thin-film heat flux gauges (HFGs) have been used for decades to measure surface temperatures and heat flux in test turbines with the majority being used in facilities that are short-duration. These gauges are typically composed of two resistive temperature devices deposited on opposing sides of a dielectric. However, because these sensors have been traditionally applied for measurements in transient-type facilities, the challenges facing adaptation of this technology for a steady facility warrant investigation. These challenges are highlighted, and the solutions are presented throughout the paper. This paper describes the nanofabrication process for heat flux gauges and a new calibration method to address the potential deterioration of gauges over long runtimes in continuous-duration facilities. Because the primary uncertainty of these sensors arises from the ambiguity of the thermal properties, the emphasis is placed on the property determination. Also, this paper presents a discussion on the use of impulse response theory to process the data showing the feasibility of the method for steady-duration facilities after an initial settling time. The latter portion of the paper focuses on comparing well-established heat flux gauges developed for short-duration turbine test facilities to recently developed gauges fabricated using modern nanofabrication techniques for a continuous turbine test facility. The gauges were compared using the test case of an impinging jet over a range of Reynolds numbers. The comparison between the PSU gauge and the reference device indicated agreement within 14%, and similar results were achieved through comparison with established sensors from partner institutions.

Engineering↗

Comparison of Thin Film Heat Flux Gauge Technologies Emphasizing Continuous-Duration Operation

Thin film heat flux gauges (HFGs) have been used for several decades to measure surface temperatures and heat flux in test turbines with the majority being used in facilities that are short-duration. These gauges are typically composed of two resistive temperature devices deposited on opposing sides of a dielectric. However, because these sensors have been traditionally applied for measurements in short-duration, transient-type facilities, the challenges facing adaptation of this technology for a continuous-duration steady facility warrant investigation. Those challenges are highlighted, and solutions are presented throughout the paper. This paper describes the nanofabrication process for heat flux gauges and a new calibration method to address potential deterioration of gauges over long runtimes in continuous-duration facilities. Because a primary uncertainty of these sensors arises from the ambiguity of the thermal properties, special emphasis is placed on the property determination and potential errors due to improper thermal properties. Also, this paper presents a discussion on the use of impulse response theory to process the data showing the feasibility of the method for steady-duration facilities after an initial settling time. The latter portion of the paper focuses on comparing well-established heat flux gauges developed for short-duration turbine test facilities to recently developed gauges fabricated using modern nanofabrication techniques for a continuous turbine test facility. Using a commercially available heat flux gauge, capable of measuring a steady heat flux as a reference, the gauges were compared using the test case of an impinging jet over a range of Reynolds numbers. The comparison between the PSU gauge and the reference device indicated agreement within 14%, and similar results were achieved through comparison with established sensors from partner institutions.

20 FOSSIL-FUELED POWER PLANTS↗

Considerations and limitations of fast Monte Carlo electron transport in radiation therapy based on precalculated data

The purpose of this work is to revisit the impediments and characteristics of fast Monte Carlo techniques for applications in radiation therapy treatment planning using new methods of utilizing pregenerated electron tracks. The limitations of various techniques for the improvement of speed and accuracy of electron transport have been evaluated. A method is proposed that takes advantage of large available memory in current computer hardware for extensive generation of precalculated data. Primary tracks of electrons are generated in the middle of homogeneous materials (water, air, bone, lung) and with energies between 0.2 and 18 MeV using the EGSnrc code. Secondary electrons are not transported, but their position, energy, charge, and direction are saved and used as a primary particle. Based on medium type and incident electron energy, a track is selected from the precalculated set. The performance of the method is tested in various homogeneous and heterogeneous configurations and the results were generally within 2% compared to EGSnrc but with a 40-60 times speed improvement. In a second stage the authors studied the obstacles for further increased speed-ups in voxel geometries by including ray-tracing and particle fluence information in the pregenerated track information. The latter method leads to speed increases of about a factor of 500 over EGSnrc for voxel-based geometries. In both approaches, no physical calculation is carried out during the runtime phase after the pregenerated data has been stored even in the presence of heterogeneities. The precalculated data are generated for each particular material and this improves the performance of the precalculated Monte Carlo code both in terms of accuracy and speed. Precalculated Monte Carlo codes are accurate, fast, and physics independent and therefore applicable to different radiation types including heavy-charged particles.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

IPIP: A new approach to inverse planning for HDR brachytherapy by directly optimizing dosimetric indices

Purpose: Many planning methods for high dose rate (HDR) brachytherapy require an iterative approach. A set of computational parameters are hypothesized that will give a dose plan that meets dosimetric criteria. A dose plan is computed using these parameters, and if any dosimetric criteria are not met, the process is iterated until a suitable dose plan is found. In this way, the dose distribution is controlled by abstract parameters. The purpose of this study is to develop a new approach for HDR brachytherapy by directly optimizing the dose distribution based on dosimetric criteria. Methods: The authors developed inverse planning by integer program (IPIP), an optimization model for computing HDR brachytherapy dose plans and a fast heuristic for it. They used their heuristic to compute dose plans for 20 anonymized prostate cancer image data sets from patients previously treated at their clinic database. Dosimetry was evaluated and compared to dosimetric criteria. Results: Dose plans computed from IPIP satisfied all given dosimetric criteria for the target and healthy tissue after a single iteration. The average target coverage was 95%. The average computation time for IPIP was 30.1 s on an Intel(R) Core{sup TM}2 Duo CPU 1.67 GHz processor with 3 Gib RAM. Conclusions: IPIP is an HDR brachytherapy planning system that directly incorporates dosimetric criteria. The authors have demonstrated that IPIP has clinically acceptable performance for the prostate cases and dosimetric criteria used in this study, in both dosimetry and runtime. Further study is required to determine if IPIP performs well for a more general group of patients and dosimetric criteria, including other cancer sites such as GYN.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NPIP: A skew line needle configuration optimization system for HDR brachytherapy

Purpose: In this study, the authors introduce skew line needle configurations for high dose rate (HDR) brachytherapy and needle planning by integer program (NPIP), a computational method for generating these configurations. NPIP generates needle configurations that are specific to the anatomy of the patient, avoid critical structures near the penile bulb and other healthy structures, and avoid needle collisions inside the body. Methods: NPIP consisted of three major components: a method for generating a set of candidate needles, a needle selection component that chose a candidate needle subset to be inserted, and a dose planner for verifying that the final needle configuration could meet dose objectives. NPIP was used to compute needle configurations for prostate cancer data sets from patients previously treated at our clinic. NPIP took two user-parameters: a number of candidate needles, and needle coverage radius, {delta}. The candidate needle set consisted of 5000 needles, and a range of {delta} values was used to compute different needle configurations for each patient. Dose plans were computed for each needle configuration. The number of needles generated and dosimetry were analyzed and compared to the physician implant. Results: NPIP computed at least one needle configuration for every patient that met dose objectives, avoided healthy structures and needle collisions, and used as many or fewer needles than standard practice. These needle configurations corresponded to a narrow range of {delta} values, which could be used as default values if this system is used in practice. The average end-to-end runtime for this implementation of NPIP was 286 s, but there was a wide variation from case to case. Conclusions: The authors have shown that NPIP can automatically generate skew line needle configurations with the aforementioned properties, and that given the correct input parameters, NPIP can generate needle configurations which meet dose objectives and use as many or fewer needles than the current HDR brachytherapy workflow. Combined with robot assisted brachytherapy, this system has the potential to reduce side effects associated with treatment. A physical trial should be done to test the implant feasibility of NPIP needle configurations.

60 APPLIED LIFE SCIENCES↗

Joint surface reconstruction and 4D deformation estimation from sparse data and prior knowledge for marker-less Respiratory motion tracking

Purpose: The intraprocedural tracking of respiratory motion has the potential to substantially improve image-guided diagnosis and interventions. The authors have developed a sparse-to-dense registration approach that is capable of recovering the patient's external 3D body surface and estimating a 4D (3D + time) surface motion field from sparse sampling data and patient-specific prior shape knowledge.Methods: The system utilizes an emerging marker-less and laser-based active triangulation (AT) sensor that delivers sparse but highly accurate 3D measurements in real-time. These sparse position measurements are registered with a dense reference surface extracted from planning data. Thereby a dense displacement field is recovered, which describes the spatio-temporal 4D deformation of the complete patient body surface, depending on the type and state of respiration. It yields both a reconstruction of the instantaneous patient shape and a high-dimensional respiratory surrogate for respiratory motion tracking. The method is validated on a 4D CT respiration phantom and evaluated on both real data from an AT prototype and synthetic data sampled from dense surface scans acquired with a structured-light scanner.Results: In the experiments, the authors estimated surface motion fields with the proposed algorithm on 256 datasets from 16 subjects and in different respiration states, achieving a mean surface reconstruction accuracy of ±0.23 mm with respect to ground truth data—down from a mean initial surface mismatch of 5.66 mm. The 95th percentile of the local residual mesh-to-mesh distance after registration did not exceed 1.17 mm for any subject. On average, the total runtime of our proof of concept CPU implementation is 2.3 s per frame, outperforming related work substantially.Conclusions: In external beam radiation therapy, the approach holds potential for patient monitoring during treatment using the reconstructed surface, and for motion-compensated dose delivery using the estimated 4D surface motion field in combination with external-internal correlation models.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TH-A-18C-02: An Electrostatic Model for Assessment of Joint Space Morphology in Cone-Beam CT

Purpose: High-resolution cone-beam CT (CBCT) of the extremities presents a potentially valuable basis for image-based biomarkers of arthritis, trauma, and risk of injury. We present a new method for 3D joint space analysis that exploits the high isotropic spatial resolution of CBCT and is sensitive to small changes in disease-related morphology. Methods: The approach uses an “electrostatic” model in which joint surfaces (e.g., distal femur and proximal tibia) are labeled as charge densities between which the electric field is solved by approximation to the Laplace equation. The method yields a unique solution determined by the field lines across the “capacitor” and is hypothesized to be more sensitive than conventional (Sharp) scores and immune to degeneracies that limit simple distance-along-axis or closest-point analysis. The algorithm was validated in CBCT phantom images and applied in two clinical scenarios: osteoarthritis (OA, change in loadbearing tibiofemoral joint space); and assessment of injury risk (correlation of 3D joint space to tibial slope). Results: Joint space maps computed from the electrostatic model were accurate to within the voxel size (0.26 mm). The method highlighted subtle regions of morphological change that would likely be missed by conventional scalar metrics. Regions of subtle cartilage erosion were well quantified, and the method confidently discriminated OA and non-OA cohorts. 3D joint space maps correlated well with tibial slope and provide a new basis for principal component analysis of loadbearing injury risk. Runtime was less than 5 min (235×235×121 voxel subvolume in Matlab). Conclusion: A new method for joint space assessment was reported as a possible image-based biomarker of subtle articular change. The algorithm yields accurate quantitation of the joint in a manner that is robust against operator and patient setup variation. The method shows promising initial results in ongoing trials of CBCT in osteoarthritis, rheumatoid arthritis, and injury risk assessment. Research supported by R01 and R21 grants from the National Institutes of Health, academic-industry partnership with Carestream Health, and a grant from the US Army Natick Soldier Research, Development and Engineering Center.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Poster — Thur Eve — 69: Computational Study of DVH-guided Cancer Treatment Planning Optimization Methods

Purpose: To compare methods to incorporate the Dose Volume Histogram (DVH) curves into the treatment planning optimization. Method: The performance of three methods, namely, the conventional Mixed Integer Programming (MIP) model, a convex moment-based constrained optimization approach, and an unconstrained convex moment-based penalty approach, is compared using anonymized data of a prostate cancer patient. Three plans we generated using the corresponding optimization models. Four Organs at Risk (OARs) and one Tumor were involved in the treatment planning. The OARs and Tumor were discretized into total of 50,221 voxels. The number of beamlets was 943. We used commercially available optimization software Gurobi and Matlab to solve the models. Plan comparison was done by recording the model runtime followed by visual inspection of the resulting dose volume histograms. Conclusion: We demonstrate the effectiveness of the moment-based approaches to replicate the set of prescribed DVH curves. The unconstrained convex moment-based penalty approach is concluded to have the greatest potential to reduce the computational effort and holds a promise of substantial computational speed up.

60 APPLIED LIFE SCIENCES↗

Multiatlas whole heart segmentation of CT data using conditional entropy for atlas ranking and selection

Purpose: Cardiac computed tomography (CT) is widely used in clinical diagnosis of cardiovascular diseases. Whole heart segmentation (WHS) plays a vital role in developing new clinical applications of cardiac CT. However, the shape and appearance of the heart can vary greatly across different scans, making the automatic segmentation particularly challenging. The objective of this work is to develop and evaluate a multiatlas segmentation (MAS) scheme using a new atlas ranking and selection algorithm for automatic WHS of CT data. Research on different MAS strategies and their influence on WHS performance are limited. This work provides a detailed comparison study evaluating the impacts of label fusion, atlas ranking, and sizes of the atlas database on the segmentation performance. Methods: Atlases in a database were registered to the target image using a hierarchical registration scheme specifically designed for cardiac images. A subset of the atlases were selected for label fusion, according to the authors’ proposed atlas ranking criterion which evaluated the performance of each atlas by computing the conditional entropy of the target image given the propagated atlas labeling. Joint label fusion was used to combine multiple label estimates to obtain the final segmentation. The authors used 30 clinical cardiac CT angiography (CTA) images to evaluate the proposed MAS scheme and to investigate different segmentation strategies. Results: The mean WHS Dice score of the proposed MAS method was 0.918 ± 0.021, and the mean runtime for one case was 13.2 min on a workstation. This MAS scheme using joint label fusion generated significantly better Dice scores than the other label fusion strategies, including majority voting (0.901 ± 0.276, p < 0.01), locally weighted voting (0.905 ± 0.0247, p < 0.01), and probabilistic patch-based fusion (0.909 ± 0.0249, p < 0.01). In the atlas ranking study, the proposed criterion based on conditional entropy yielded a performance curve with higher WHS Dice scores compared to the conventional schemes (p < 0.03). In the atlas database study, the authors showed that the MAS using larger atlas databases generated better performance curves than the MAS using smaller ones, indicating larger atlas databases could produce more accurate segmentation. Conclusions: The authors have developed a new MAS framework for automatic WHS of CTA and investigated alternative implementations of MAS. With the proposed atlas ranking algorithm and joint label fusion, the MAS scheme is able to generate accurate segmentation within practically acceptable computation time. This method can be useful for the development of new clinical applications of cardiac CT.

60 APPLIED LIFE SCIENCES↗

WE-EF-207-05: Monte Carlo Dosimetry for a Dedicated Cone-Beam CT Head Scanner

Purpose: Cone-Beam CT (CBCT) is an attractive platform for point-of-care imaging of traumatic brain injury and intracranial hemorrhage. This work implements and evaluates a fast Monte-Carlo (MC) dose estimation engine for development of a dedicated head CBCT scanner, optimization of acquisition protocols, geometry, bowtie filter designs, and patient-specific dosimetry. Methods: Dose scoring with a GPU-based MC CBCT simulator was validated on an imaging bench using a modified 16 cm CTDI phantom with 7 ion chamber shafts along the central ray for 80–100 kVp (+2 mm Al, +0.2 mm Cu). Dose distributions were computed in a segmented CBCT reconstruction of an anthropomorphic head phantom with 4×10{sup 5} tracked photons per scan (5 min runtime). Circular orbits with angular span ranging from short scan (180° + fan angle) to full rotation (360°) were considered for fixed total mAs per scan. Two aluminum filters were investigated: aggressive bowtie, and moderate bowtie (matched to 16 cm and 32 cm water cylinder, respectively). Results: MC dose estimates showed strong agreement with measurements (RMSE<0.001 mGy/mAs). A moderate (aggressive) bowtie reduced the dose, per total mAs, by 20% (30%) at the center of the head, by 40% (50%) at the eye lens, and by 70% (80%) at the posterior skin entrance. For the no bowtie configuration, a short scan reduced the eye lens dose by 62% (from 0.08 mGy/mAs to 0.03 mGy/mAs) compared to full scan, although the dose to spinal bone marrow increased by 40%. For both bowties, the short scan resulted in a similar 40% increase in bone marrow dose, but the reduction in the eye lens was more pronounced: 70% (90%) for the moderate (aggressive) bowtie. Conclusions: Dose maps obtained with validated MC simulation demonstrated dose reduction in sensitive structures (eye lens and bone marrow) through combination of short-scan trajectories and bowtie filters. Xiaohui Wang and David Foos are employees of Carestream Health.

60 APPLIED LIFE SCIENCES↗

SU-C-BRC-07: Parametrized GPU Accelerated Electron Monte Carlo Second Check

Purpose: I am presenting a parameterized 3D GPU accelerated electron Monte Carlo second check program. Method: I wrote the 3D grid dose calculation algorithm in CUDA and utilized an NVIDIA GeForce GTX 780 Ti to run all of the calculations. The electron path beyond the distal end of the cone is governed by four parameters: the amplitude of scattering (AMP), the mean and width of a Gaussian energy distribution (E and α), and the percentage of photons. In my code, I adjusted all parameters until the calculated PDD and profile fit the measured 10×10 open beam data within 1%/1mm. I then wrote a user interface for reading the DICOM treatment plan and images in Python. In order to verify the algorithm, I calculated 3D dose distributions on a variety of phantoms and geometries, and compared them with the Eclipse eMC calculations. I also calculated several patient specific dose distributions, including a nose and an ear. Finally, I compared my algorithm’s computation times to Eclipse’s. Results: The calculated MU for all of the investigated geometries agree with the TPS within the TG-114 action level of 5%. The MU for the nose was < 0.5 % different while the MU for the ear at 105 SSD was ∼2 %. Calculation times for a 12MeV 10×10 open beam ranged from 1 second for a 2.5 mm grid resolution with ∼15 million particles to 33 seconds on a 1 mm grid with ∼460 million particles. Eclipse calculation runtimes distributed over 10 FAS workers were 9 seconds to 15 minutes respectively. Conclusion: The GPU accelerated second check allows quick MU verification while accounting for patient specific geometry and heterogeneity.

60 APPLIED LIFE SCIENCES↗

TU-D-209-03: Alignment of the Patient Graphic Model Using Fluoroscopic Images for Skin Dose Mapping

Purpose: The Dose Tracking System (DTS) was developed to provide realtime feedback of skin dose and dose rate during interventional fluoroscopic procedures. A color map on a 3D graphic of the patient represents the cumulative dose distribution on the skin. Automated image correlation algorithms are described which use the fluoroscopic procedure images to align and scale the patient graphic for more accurate dose mapping. Methods: Currently, the DTS employs manual patient graphic selection and alignment. To improve the accuracy of dose mapping and automate the software, various methods are explored to extract information about the beam location and patient morphology from the procedure images. To match patient anatomy with a reference projection image, preprocessing is first used, including edge enhancement, edge detection, and contour detection. Template matching algorithms from OpenCV are then employed to find the location of the beam. Once a match is found, the reference graphic is scaled and rotated to fit the patient, using image registration correlation functions in Matlab. The algorithm runs correlation functions for all points and maps all correlation confidences to a surface map. The highest point of correlation is used for alignment and scaling. The transformation data is saved for later model scaling. Results: Anatomic recognition is used to find matching features between model and image and image registration correlation provides for alignment and scaling at any rotation angle with less than onesecond runtime, and at noise levels in excess of 150% of those found in normal procedures. Conclusion: The algorithm provides the necessary scaling and alignment tools to improve the accuracy of dose distribution mapping on the patient graphic with the DTS. Partial support from NIH Grant R01-EB002873 and Toshiba Medical Systems Corp.

60 APPLIED LIFE SCIENCES↗

TU-FG-201-04: Computer Vision in Autonomous Quality Assurance of Linear Accelerators

Purpose: Routine quality assurance (QA) of linear accelerators represents a critical and costly element of a radiation oncology center. Recently, a system was developed to autonomously perform routine quality assurance on linear accelerators. The purpose of this work is to extend this system and contribute computer vision techniques for obtaining quantitative measurements for a monthly multi-leaf collimator (MLC) QA test specified by TG-142, namely leaf position accuracy, and demonstrate extensibility for additional routines. Methods: Grayscale images of a picket fence delivery on a radioluminescent phosphor coated phantom are captured using a CMOS camera. Collected images are processed to correct for camera distortions, rotation and alignment, reduce noise, and enhance contrast. The location of each MLC leaf is determined through logistic fitting and a priori modeling based on knowledge of the delivered beams. Using the data collected and the criteria from TG-142, a decision is made on whether or not the leaf position accuracy of the MLC passes or fails. Results: The locations of all MLC leaf edges are found for three different picket fence images in a picket fence routine to 0.1mm/1pixel precision. The program to correct for image alignment and determination of leaf positions requires a runtime of 21– 25 seconds for a single picket, and 44 – 46 seconds for a group of three pickets on a standard workstation CPU, 2.2 GHz Intel Core i7. Conclusion: MLC leaf edges were successfully found using techniques in computer vision. With the addition of computer vision techniques to the previously described autonomous QA system, the system is able to quickly perform complete QA routines with minimal human contribution.

60 APPLIED LIFE SCIENCES↗

WE-DE-201-01: BEST IN PHYSICS (THERAPY): A Fast Multi-Target Inverse Treatment Planning Strategy Optimizing Dosimetric Measures for High-Dose-Rate (HDR) Brachytherapy

Purpose: Inverse treatment planning (ITP) for interstitial HDR brachytherapy of gynecologic cancers seeks to maximize coverage of the clinical target volumes (tumor and vagina) while respecting dose-volume-histogram related dosimetric measures (DMs) for organs at risk (OARs). Commercially available ITP tools do not support DM-based planning because it is computationally too expensive to solve. In this study we present a novel approach that allows fast ITP for gynecologic cancers based on DMs for the first time. Methods: This novel strategy is an optimization model based on a smooth DM-based objective function. The smooth approximation is achieved by utilizing a logistic function for the evaluation of DMs. The resulting nonconvex and constrained optimization problem is then optimized with a BFGS algorithm. The model was evaluated using the implant geometry extracted from 20 patient treatment plans under an IRB-approved retrospective study. For each plan, the final DMs were evaluated and compared to the original clinical plans. The CTVs were the contoured tumor volume and the contoured surface of the vagina. Statistical significance was evaluated with a one-sided paired Wilcoxon signed-rank test. Results: As did the clinical plans, all generated plans fulfilled the defined DMs for OARs. The proposed strategy showed a statistically significant improvement (p<0.001) in coverage of the tumor and vagina, with absolute improvements of related DMs of (6.9 +/− 7.9)% and (28.2 +/− 12.0)%, respectively. This was achieved with a statistically significant (p<0.01) decrease of the high-dose-related DM for the tumor. The runtime of the optimization was (2.3 +/− 2.0) seconds. Conclusion: We demonstrated using clinical data that our novel approach allows rapid DM-based optimization with improved coverage of CTVs with fewer hot spots. Being up to three orders of magnitude faster than the current clinical practice, the method dramatically shortens planning time.

60 APPLIED LIFE SCIENCES↗

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗

Simulation, Characterization, and Optimization of Metabolic Models with the High Performance Systems Biology Toolkit

The High Performance Systems Biology Toolkit (HiPer SBTK) is a collection of simulation and optimization components for metabolic modeling and the means to assemble these components into large parallel processing hierarchies suiting a particular simulation and optimization need. The components come in a variety of different categories: model translation, model simulation, parameter sampling, sensitivity analysis, parameter estimation, and optimization. They can be configured at runtime into hierarchically parallel arrangements to perform nested combinations of simulation characterization tasks with excellent parallel scaling to thousands of processors. We describe the observations that led to the system, the components, and how one can arrange them. We show nearly 90% efficient scaling to over 13,000 processors, and we demonstrate three complex yet typical examples that have run on {approx}1000 processors and accomplished billions of stiff ordinary differential equation simulations. This work opens the door for the systems biology metabolic modeling community to take effective advantage of large scale high performance computing resources for the first time.

59 BASIC BIOLOGICAL SCIENCES↗

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗

Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping

In order to achieve exascale systems, application resilience needs to be addressed. Some programming models, such as task-DAG (directed acyclic graphs) architectures, currently embed resilience features whereas traditional SPMD (single program, multiple data) and message-passing models do not. Since a large part of the community's code base follows the latter models, it is still required to take advantage of application characteristics to minimize the overheads of fault tolerance. To that end, this paper explores how recovering from hard process/node failures in a local manner is a natural approach for certain applications to obtain resilience at lower costs in faulty environments. In particular, this paper targets enabling online, semitransparent local recovery for stencil computations on current leadership-class systems as well as presents programming support and scalable runtime mechanisms. Also described and demonstrated in this paper is the effect of failure masking, which allows the effective reduction of impact on total time to solution due to multiple failures. Furthermore, we discuss, implement, and evaluate ghost region expansion and cell-to-rank remapping to increase the probability of failure masking. To conclude, this paper shows the integration of all aforementioned mechanisms with the S3D combustion simulation through an experimental demonstration (using the Titan system) of the ability to tolerate high failure rates (i.e., node failures every five seconds) with low overhead while sustaining performance at large scales. In addition, this demonstration also displays the failure masking probability increase resulting from the combination of both ghost region expansion and cell-to-rank remapping.

97 MATHEMATICS AND COMPUTING↗