Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “processor performance factors”

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 217 records · Page 12

Fast and anisotropic flexibility-rigidity index for protein flexibility and fluctuation analysis

Protein structural fluctuation, typically measured by Debye-Waller factors, or B-factors, is a manifestation of protein flexibility, which strongly correlates to protein function. The flexibility-rigidity index (FRI) is a newly proposed method for the construction of atomic rigidity functions required in the theory of continuum elasticity with atomic rigidity, which is a new multiscale formalism for describing excessively large biomolecular systems. The FRI method analyzes protein rigidity and flexibility and is capable of predicting protein B-factors without resorting to matrix diagonalization. A fundamental assumption used in the FRI is that protein structures are uniquely determined by various internal and external interactions, while the protein functions, such as stability and flexibility, are solely determined by the structure. As such, one can predict protein flexibility without resorting to the protein interaction Hamiltonian. Consequently, bypassing the matrix diagonalization, the original FRI has a computational complexity of O(N{sup 2}). This work introduces a fast FRI (fFRI) algorithm for the flexibility analysis of large macromolecules. The proposed fFRI further reduces the computational complexity to O(N). Additionally, we propose anisotropic FRI (aFRI) algorithms for the analysis of protein collective dynamics. The aFRI algorithms permit adaptive Hessian matrices, from a completely global 3N × 3N matrix to completely local 3 × 3 matrices. These 3 × 3 matrices, despite being calculated locally, also contain non-local correlation information. Eigenvectors obtained from the proposed aFRI algorithms are able to demonstrate collective motions. Moreover, we investigate the performance of FRI by employing four families of radial basis correlation functions. Both parameter optimized and parameter-free FRI methods are explored. Furthermore, we compare the accuracy and efficiency of FRI with some established approaches to flexibility analysis, namely, normal mode analysis and Gaussian network model (GNM). The accuracy of the FRI method is tested using four sets of proteins, three sets of relatively small-, medium-, and large-sized structures and an extended set of 365 proteins. A fifth set of proteins is used to compare the efficiency of the FRI, fFRI, aFRI, and GNM methods. Intensive validation and comparison indicate that the FRI, particularly the fFRI, is orders of magnitude more efficient and about 10% more accurate overall than some of the most popular methods in the field. The proposed fFRI is able to predict B-factors for α-carbons of the HIV virus capsid (313 236 residues) in less than 30 seconds on a single processor using only one core. Finally, we demonstrate the application of FRI and aFRI to protein domain analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast Context Switching in Real-Time Propositional Reasoning

The trend to increasingly capable and affordable control processors has generated an explosion of embedded real-time gadgets that serve almost every function imaginable. The daunting task of programming these gadgets is greatly alleviated with real-time deductive engines that perform all execution and monitoring functions from a single core model, Fast response times are achieved using an incremental propositional deductive database (an LTMS). Ideally the cost of an LTMS's incremental update should be linear in the number of labels that change between successive contexts. Unfortunately an LTMS can expend a significant percentage of its time working on labels that remain constant between contexts. This is caused by the LTMS's conservative approach: a context switch first removes all consequences of deleted clauses, whether or not those consequences hold in the new context. This paper presents a more aggressive incremental TMS, called the ITMS, that avoids processing a significant number of these consequences that are unchanged. Our empirical evaluation for spacecraft control shows that the overhead of processing unchanged consequences can be reduced by a factor of seven.

Nayak, P. Pandurang↗

Thermal Insulation Testing Method and Apparatus

A test apparatus and method of its use for evaluating various performance aspects of a test specimen is disclosed. A chamber within a housing contains a cold mass tank with a contact surface in contact with a first surface of a test specimen. The first surface of the test specimen is spaced from the second surface of the test specimen by a thickness. The second surface of the test specimen is maintained at a a constant temperature by a liquid disposed within the cold mass tank. A boil-off flow rate of the gas is monitored and provided to a processor along with the temperature of the first and second surfaces of the test specimen. The processor calculates thermal insulation values of the test specimen including comparative values for heat flux and apparent thermal conductivity k-value). The test specimen may be placed in any vacuum pressure level ranging from about 0.01 millitorr to 1,000,000 millitorr with different residual gases as desired. The test specimen may be placed under a mechanical load with the cold mass tank and another factors may be imposed upon the test specimen so as to simulate the actual use conditions.

Fesmire, James E.↗

Advanced High-Speed 16-Bit Digitizer System

The fastest commercially available 16-bit ADC can only perform around 200 mega-samples per second (200 MS/s). Connecting ADC chips together in eight different time domains increases the quantity of samples taken by a factor of eight. This method of interleaving requires that the input signal being sampled is split into eight identical signals and arrives at each ADC chip at the same point in time. The splitting of the input signal is performed in the analog front end containing a wideband filter that impedance matches the input signal to the ADC chips. Each ADC uses a clock to tell it when to perform a conversion. Using eight unique clocks spaced in 45-degree increments is the method used to time shift when each ADC chip performs its conversion. Given that this control clock is a fixed frequency, the clock phase shifting is accomplished by tightly controlling the distance that the clock must travel, resulting in a time delay. The interleaved ADC chips will now generate digital data in eight different time domains. These data are processed inside a field-programmable gate array (FPGA) to move the data back into a single time domain and store it into memory. The FPGA also contains a Nios II processor that provides system control and data retrieval via Ethernet.

42 ENGINEERING↗

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗

Electromagnetic Radial Forces in a Hybrid Eight-Stator-Pole, Six-Rotor-Pole Bearingless Switched-Reluctance Motor

Analysis and experimental measurement of the electromagnet force loads on the hybrid rotor in a novel bearingless switched-reluctance motor (BSRM) have been performed. A BSRM has the combined characteristics of a switched-reluctance motor and a magnetic bearing. The BSRM has an eight-pole stator and a six-pole hybrid rotor, which is composed of circular and scalloped lamination segments. The hybrid rotor is levitated using only one set of stator poles. A second set of stator poles imparts torque to the scalloped portion of the rotor, which is driven in a traditional switched reluctance manner by a processor. Analysis was done for nonrotating rotor poles that were oriented to achieve maximum and minimum radial force loads on the rotor. The objective is to assess whether simple one-dimensional magnetic circuit analysis is sufficient for preliminary evaluation of this machine, which may exhibit strong three-dimensional electromagnetic field behavior. Two magnetic circuit geometries, approximating the complex topology of the magnetic fields in and around the hybrid rotor, were employed in formulating the electromagnetic radial force equations. Reasonable agreement between the experimental results and the theoretical predictions was obtained with typical magnetic bearing derating factors applied to the predictions.

Morrison, Carlos R.↗

MPACT Development Activities at University of Michigan

This report documents the efforts of general development tasks in MPACT performed primarily at the University of Michigan during FY17. These tasks included: 1. Unstructured CMFD - The unstructured CMFD supports the RIA and BWR challenge problems. It allows MPACT to simulate mixed lattice cores (e.g. 8x8 next to 9x9). This design feature is common to operating BWRs and also the SPERT experiments being used to validate VERA-CS for RIA. 2. Higher order spatial sources for MOC - The higher order sources are for improving the overall performance of MPACT. Higher order spatial sources in MOC provide accurate solutions with potentially significantly fewer mesh regions, thus speeding up every calculation. This method is also particularly important for BWRs. 3. Improving fine source region visualization - The improvement of the visualization of the flat source region mesh in MPACT is to support users and communication of models and results from MPACT. VERAView provides visualization of pin-wise information, however MPACT resolves the spatial solution to intra pin level. The capability provided here will let users visualize the full model geometry and components of the solution at the highest spatial resolution available from MPACT. 4. Automated spatial decomposition - The automated spatial decomposition removes the burden from the user to know how to spatially decompose the model for MPACT; a task that has been rather tricky in the past. Instead the user may give some number of processors that is a multiple of the axial mesh and MPACT will determine a nearly optimal decomposition that gives better load balance than most decompositions used currently. 5. Optimal relaxation factors for feedback - The development of optimal relaxation factor is to improve the stability and robustness of problems with feedback. Presently the default feedback values are 0.5, which may or may not be optimal. Without relaxation the fixed point iteration that is currently used is known to be unstable for large problems. The optimal relaxation factors are derived by utilizing a previous Fourier analysis. From the original milestone there was a scope change where the work on the Intel MIC was deferred for work on the automated spatial decomposition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Thermal insulation testing method and apparatus

A test apparatus and method of its use for evaluating various performance aspects of a test specimen is disclosed. A chamber within a housing contains a cold mass tank with a contact surface in contact with a first surface of a test specimen. The first surface of the test specimen is spaced from the second surface of the test specimen by a thickness. The second surface of the test specimen is maintained at a desired warm temperature. The first surface is maintained at a constant temperature by a liquid disposed within the cold mass tank. A boil-off flow rate of the gas is monitored and provided to a processor along with the temperature of the first and second surfaces of the test specimen. The processor calculates thermal insulation values of the test specimen including comparative values for heat flux and apparent thermal conductivity (k-value). The test specimen may be placed in any vacuum pressure level ranging from about 0.01 millitorr to 1,000,000 millitorr with different residual gases as desired. The test specimen may be placed under a mechanical load with the cold mass tank and another factors may be imposed upon the test specimen so as to simulate the actual use conditions.

Fesmire, James E.↗

Multiprocessing on supercomputers for computational aerodynamics

Very little use is made of multiple processors available on current supercomputers (computers with a theoretical peak performance capability equal to 100 MFLOPs or more) in computational aerodynamics to significantly improve turnaround time. The productivity of a computer user is directly related to this turnaround time. In a time-sharing environment, the improvement in this speed is achieved when multiple processors are used efficiently to execute an algorithm. The concept of multiple instructions and multiple data (MIMD) through multi-tasking is applied via a strategy which requires relatively minor modifications to an existing code for a single processor. Essentially, this approach maps the available memory to multiple processors, exploiting the C-FORTRAN-Unix interface. The existing single processor code is mapped without the need for developing a new algorithm. The procedure for building a code utilizing this approach is automated with the Unix stream editor. As a demonstration of this approach, a Multiple Processor Multiple Grid (MPMG) code is developed. It is capable of using nine processors, and can be easily extended to a larger number of processors. This code solves the three-dimensional, Reynolds averaged, thin-layer and slender-layer Navier-Stokes equations with an implicit, approximately factored and diagonalized method. The solver is applied to generic oblique-wing aircraft problem on a four processor Cray-2 computer. A tricubic interpolation scheme is developed to increase the accuracy of coupling of overlapped grids. For the oblique-wing aircraft problem, a speedup of two in elapsed (turnaround) time is observed in a saturated time-sharing environment.

Yarrow, Maurice↗

Limits on the Efficiency of Event-Based Algorithms for Monte Carlo Neutron Transport

The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of two parameters: the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size in order to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, however, the vector speedup is also limited by differences in execution time for events being carried out in a single event-iteration. For some problems, this implies that vector effciencies over 50% may not be attainable. While there are many factors impacting performance of an event-based algorithm that are not captured by our model, it nevertheless provides insights into factors that may be limiting in a real implementation.

Romano, Paul K.↗

Roofline Analysis in the Intel® Advisor to Deliver Optimized Performance for applications on Intel® Xeon Phi™ Processor

In this session we show, in two case studies, how the roofline feature of Intel Advisor has been utilized to optimize the performance of kernels of the XGC1 and PICSAR codes in preparation for Intel Knights Landing architecture. The impact of the implemented optimizations and the benefits of using the automatic roofline feature of Intel Advisor to study performance of large applications will be presented. This demonstrates an effective optimization strategy that has enabled these science applications to achieve up to 4.6 times speed-up and prepare for future exascale architectures. # Goal/Relevance of Session The roofline model [1,2] is a powerful tool for analyzing the performance of applications with respect to the theoretical peak achievable on a given computer architecture. It allows one to graphically represent the performance of an application in terms of operational intensity, i.e. the ratio of flops performed and bytes moved from memory in order to guide optimization efforts. Given the scale and complexity of modern science applications, it can often be a tedious task for the user to perform the analysis on the level of functions or loops to identify where performance gains can be made. With new Intel tools, it is now possible to automate this task, as well as base the estimates of peak performance on measurements rather than vendor specifications. The goal of this session is to demonstrate how the roofline feature of Intel Advisor can be used to balance memory vs. computation related optimization efforts and effectively identify performance bottlenecks. A series of typical optimization techniques: cache blocking, structure refactoring, data alignment, and vectorization illustrated by the kernel cases will be addressed. # Description of the codes ## XGC1 The XGC1 code [3] is a magnetic fusion Particle-In-Cell code that uses an unstructured mesh for its Poisson solver that allows it to accurately resolve the edge plasma of a magnetic fusion device. After recent optimizations to its collision kernel [4], most of the computing time is spent in the electron push (pushe) kernel, where these optimization efforts have been focused. The kernel code scaled well with MPI+OpenMP but had almost no automatic compiler vectorization, in part due to indirect memory addresses and in part due to low trip counts of low-level loops that would be candidates for vectorization. Particle blocking and sorting have been implemented to increase trip counts of low-level loops and improve memory locality, and OpenMP directives have been added to vectorize compute-intensive loops that were identified by Advisor. The optimizations have improved the performance of the pushe kernel 2x on Haswell processors and 1.7x on KNL. The KNL node-for-node performance has been brought to within 30% of a NERSC Cori phase I Haswell node and we expect to bridge this gap by reducing the memory footprint of compute intensive routines to improve cache reuse. ## PICSAR is a Fortran/Python high-performance Particle-In-Cell library targeting at MIC architectures first designed to be coupled with the PIC code WARP for the simulation of laser-matter interaction and particle accelerators. PICSAR also contains a FORTRAN stand-alone kernel for performance studies and benchmarks. A MPI domain decomposition is used between NUMA domains and a tile decomposition (cache-blocking) handled by OpenMP has been added for shared-memory parallelism and better cache management. The so-called current deposition and field gathering steps that compose the PIC time loop constitute major hotspots that have been rewritten to enable more efficient vectorization. Particle communications between tiles and MPI domain has been merged and parallelized. All considered, these improvements provide speedups of 3.1 for order 1 and 4.6 for order 3 interpolation shape factors on KNL configured in SNC4 quadrant flat mode. Performance is similar between a node of cori phase 1 and KNL at order 1 and better on KNL by a factor 1.6 at order 3 with the considered test case (homogeneous thermal plasma).

97 MATHEMATICS AND COMPUTING↗

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \times 10^{-2}$ seconds on an Intel Xeon processor.

Yeung, Yu-Hong↗

Electromagnetic Forces in a Hybrid Magnetic-Bearing Switched-Reluctance Motor

Analysis and experimental measurement of the electromagnetic force loads on the hybrid rotor in a novel hybrid magnetic-bearing switched-reluctance motor (MBSRM) have been performed. A MBSRM has the combined characteristics of a switched-reluctance motor and a magnetic bearing. The MBSRM discussed in this report has an eight-pole stator and a six-pole hybrid rotor, which is composed of circular and scalloped lamination segments. The hybrid rotor is levitated using only one set of four stator poles, while a second set of four stator poles imparts torque to the scalloped portion of the rotor, which is driven in a traditional switched reluctance manner by a processor. Static torque and radial force analysis were done for rotor poles that were oriented to achieve maximum and minimum radial force loads on the rotor. The objective is to assess whether simple one-dimensional magnetic circuit analysis is sufficient for preliminary evaluation of this machine, which may exhibit strong three-dimensional electromagnetic field behavior. Two magnetic circuit geometries, approximating the complex topology of the magnetic fields in and around the hybrid rotor, were employed in formulating the electromagnetic radial force equations. Reasonable agreement between the experimental and the theoretical radial force loads predictions was obtained with typical magnetic bearing derating factors applied to the predictions.

Morrison, Carlos R.↗

RadSTAR L-Band Imaging Scatterometer: Performance Assessment

RadSTAR is an instrument development program aimed at combining a radiometer and a scatterometer system into a highly compact configuration that uses a single, electronically scanned antenna to provide co-located and simultaneous measurements of emission and backscatter for airborne and spaceborne applications [I]. The program was designed to map soil moisture and ocean salinity, both important components of the water cycle, and to map sea ice density and thickness, an important factor in ocean-atmosphere heat exchange in Polar Regions. The accuracy in estimation of these and a number of other Earth science parameters can be greatly enhanced by providing the co-aligned radar/radiometer microwave measurements. For instance, radiometer estimates of soil moisture from soil emission are affected by emission from vegetation, and from the roughness of the surface. Complementary measurements using the scatterometer can be used to evaluate the vegetation and surface roughness effects. Hence, the combined observations can provide an improved estimate. As with soil moisture, the ocean salinity is a function of the microwave emission from the sea surface temperature (SST) and sea roughness. There, the addition of radar backscatter measurements of sea roughness enables the correction of the emissivity and provide more accurate estimates of ocean salinity. Similar arguments can be made for other important Earth science parameters. This paper discusses the RadSTAR program, the radar system design, calibration, and digital beamforming techniques, and presents preliminary analysis of the data collected during the test flights. The data sets obtained during the flights and during the radar calibration in the anechoic chamber are also employed to asses the performance of the radar. The paper also discusses the Digital Beamforming Synthetic Aperture Radar (DBSAR) processor, a real-time processor recently developed for the LIS instrument which enables beam synthesis, fine resolutions, and large swaths.

Rincon, Rafael↗

A Tool for Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT, and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level, or on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if the compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator, then the loop which implements the operator can be declared as INDEPENDENT. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.

Frumkin, Michael↗

Toward Real Time Neural Net Flight Controllers

NASA Ames Research Center has an ongoing program in neural network control technology targeted toward real time flight demonstrations using a modified F-15 which permits direct inner loop control of actuators, rapid switching between alternative control designs, and substitutable processors. An important part of this program is the ACTIVE flight project which is examining the feasibility of using neural networks in the design, control, and system identification of new aircraft prototypes. This paper discusses two research applications initiated with this objective in mind: utilization of neural networks for wind tunnel aircraft model identification and rapid learning algorithms for on line reconfiguration and control. The first application involves the identification of aerodynamic flight characteristics from analysis of wind tunnel test data. This identification is important in the early stages of aircraft design because complete specification of control architecture's may not be possible even though concept models at varying scales are available for aerodynamic wind tunnel testing. Testing of this type is often a long and expensive process involving measurement of aircraft lift, drag, and moment of inertia at varying angles of attack and control surface configurations. This information in turn can be used in the design of the flight control systems by applying the derived lookup tables to generate piece wise linearized controllers. Thus, reduced costs in tunnel test times and the rapid transfer of wind tunnel insights into prototype controllers becomes an important factor in more efficient generation and testing of new flight systems. NASA Ames Research Center is successfully applying modular neural networks as one way of anticipating small scale aircraft model performances prior to testing, thus reducing the number of in tunnel test hours and potentially, the number of intermediate scaled models required for estimation of surface flow effects.

Jorgensen, C. C.↗

A Parallelized Oxidation-Driven Surface Recession Framework in DSMC Code, SPARTA

Spacecrafts rely on ablative thermal protection systems (TPS) made of composites consisting of a carbon-based reinforcement and a polymeric matrix. These materials are designed to withstand high-temperature oxidation and surface recession during re-entry into the Earth's atmosphere. However, ablation occurs due to a complex interplay of thermal, mechanical, and chemical factors, making it challenging to determine the individual impact of each on the TPS's overall degradation. In this study, we have developed an ablation model that can leverage a finite rate carbon oxidation model to predict material recession and surface states more accurately. Stochastic PArallel Rarified-gas Time-accurate Analyzer (SPARTA), a direct-simulation Monte Carlo (DSMC) code, is modified to allow oxidation-driven ablation of implicitly defined carbon surfaces. In SPARTA, implicit surfaces are generated from the grid corner point values via a marching cubes algorithm, therefore creating a new set of surface elements every time ablation is performed. The finite-rate oxidation model developed by Gopalan et. al can perform both gas-surface and pure-surface reactions and is now adapted to tally surface data on a per grid cell basis. The ablation functionality was also adjusted so once the reactions have occurred, the number of reactions leading to CO formation can be converted to corner point reduction values; therefore, carbon removal is directly proportional to surface recession. We also briefly discuss some unique challenges associated with parallelizing this dynamic surface state and geometry. Finally, we analyze the performance of this parallelized implicit chemistry model with simple 2D and 3D benchmark cases by producing surface state statistics, area changes over time, and visualization across a range of surface temperatures and processors with and without load-balancing.

DSMC↗

The Argonne Leadership Computing Facility 2010 annual report.

Researchers found more ways than ever to conduct transformative science at the Argonne Leadership Computing Facility (ALCF) in 2010. Both familiar initiatives and innovative new programs at the ALCF are now serving a growing, global user community with a wide range of computing needs. The Department of Energy's (DOE) INCITE Program remained vital in providing scientists with major allocations of leadership-class computing resources at the ALCF. For calendar year 2011, 35 projects were awarded 732 million supercomputer processor-hours for computationally intensive, large-scale research projects with the potential to significantly advance key areas in science and engineering. Argonne also continued to provide Director's Discretionary allocations - 'start up' awards - for potential future INCITE projects. And DOE's new ASCR Leadership Computing (ALCC) Program allocated resources to 10 ALCF projects, with an emphasis on high-risk, high-payoff simulations directly related to the Department's energy mission, national emergencies, or for broadening the research community capable of using leadership computing resources. While delivering more science today, we've also been laying a solid foundation for high performance computing in the future. After a successful DOE Lehman review, a contract was signed to deliver Mira, the next-generation Blue Gene/Q system, to the ALCF in 2012. The ALCF is working with the 16 projects that were selected for the Early Science Program (ESP) to enable them to be productive as soon as Mira is operational. Preproduction access to Mira will enable ESP projects to adapt their codes to its architecture and collaborate with ALCF staff in shaking down the new system. We expect the 10-petaflops system to stoke economic growth and improve U.S. competitiveness in key areas such as advancing clean energy and addressing global climate change. Ultimately, we envision Mira as a stepping-stone to exascale-class computers that will be faster than petascale-class computers by a factor of a thousand. Pete Beckman, who served as the ALCF's Director for the past few years, has been named director of the newly created Exascale Technology and Computing Institute (ETCi). The institute will focus on developing exascale computing to extend scientific discovery and solve critical science and engineering problems. Just as Pete's leadership propelled the ALCF to great success, we know that that ETCi will benefit immensely from his expertise and experience. Without question, the future of supercomputing is certainly in good hands. I would like to thank Pete for all his effort over the past two years, during which he oversaw the establishing of ALCF2, the deployment of the Magellan project, increases in utilization, availability, and number of projects using ALCF1. He managed the rapid growth of ALCF staff and made the facility what it is today. All the staff and users are better for Pete's efforts.

54 ENVIRONMENTAL SCIENCES↗