Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “IBM”

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 667 records · Page 37

Computational Performance of Ultra-High-Resolution Capability in the Community Earth System Model

With the fourth release of the Community Climate System Model, the ability to perform ultra-high resolution climate simulations is now possible, enabling eddy-resolving ocean and sea ice models to be coupled to a finite-volume atmosphere model for a range of atmospheric resolutions. This capability was made possible by enabling the model to use large scale parallelism, which required a significant refactoring of the software infrastructure. We describe the scalability of two ultra-high-resolution coupled configurations on leadership class computing platforms. We demonstrate the ability to utilize over 30,000 processor cores on a Cray XT5 system and over 60,000 cores on an IBM Blue Gene/P system to obtain climatologically relevant simulation rates for these configurations.

99 GENERAL AND MISCELLANEOUS↗

Exploring versioned distributed arrays for resilience in scientific applications: Global view resilience

Exascale studies project reliability challenges for future HPC systems. We present the Global View Resilience (GVR) system, a library for portable resilience. GVR begins with a subset of the Global Arrays interface, and adds new capabilities to create versions, name versions, and compute on version data. Applications can focus versioning where and when it is most productive, and customize for each application structure independently. This control is portable, and its embedding in application source makes it natural to express and easy to maintain. The ability to name multiple versions and “partially materialize” them efficiently makes ambitious forward-recovery based on “data slices” across versions or data structures both easy to express and efficient. Using several large applications (OpenMC, preconditioned conjugate gradient (PCG) solver, ddcMD, and Chombo), we evaluate the programming effort to add resilience. The required changes are small (< 2% lines of code (LOC)), localized and machine-independent, and perhaps most important, require no software architecture changes. We also measure the overhead of adding GVR versioning and show that overheads < 2% are generally achieved. This overhead suggests that GVR can be implemented in large-scale codes and support portable error recovery with modest investment and runtime impact. Our results are drawn from both IBM BG/Q and Cray XC30 experiments, demonstrating portability. We also present two case studies of flexible error recovery, illustrating how GVR can be used for multi-version rollback recovery, and several different forward-recovery schemes. GVR’s multi-version enables applications to survive latent errors (silent data corruption) with significant detection latency, and forward recovery can make that recovery extremely efficient. Lastly, our results suggest that GVR is scalable, portable, and efficient. GVR interfaces are flexible, supporting a variety of recovery schemes, and altogether GVR embodies a gentle-slope path to tolerate growing error rates in future extreme-scale systems.

97 MATHEMATICS AND COMPUTING↗

On the arithmetic intensity of high-order finite-volume discretizations for hyperbolic systems of conservation laws

It has been conjectured that higher-order discretizations for partial differential equations will have advantages over the lower-order counterparts commonly used today. The reasoning is that the increase in arithmetic operations will be more than offset by the reduction in data transfers and the increase in concurrent floating-point units. To evaluate this conjecture, the arithmetic intensity of a class of high-order finite-volume discretizations for hyperbolic systems of conservation laws is theoretically analyzed for spatial discretizations from orders three through eight in arbitrary dimensions. Additionally, three cache models are considered: the limiting cases of no cache and infinite cache as well as a finite-sized cache model. Models are validated experimentally by measuring floating-point operations and data transfers on an IBM Blue Gene/Q node. Theory and experiments demonstrate that high-order finite-volume methods will be able to provide increases in arithmetic intensity that will be necessary to make better utilization of on-node floating-point capability.

97 MATHEMATICS AND COMPUTING↗

Optimizing the performance of reactive molecular dynamics simulations for many-core architectures

Reactive molecular dynamics simulations are computationally demanding. Reaching spatial and temporal scales where interesting scientific phenomena can be observed requires efficient and scalable implementations on modern hardware. In this article, we focus on optimizing the performance of the widely used LAMMPS/ReaxC package for many-core architectures. As hybrid parallelism allows better leverage of the increasing on-node parallelism, we adopt thread parallelism in the construction of bonded and nonbonded lists and in the computation of complex ReaxFF interactions. To mitigate the I/O overheads due to large volumes of trajectory data produced and to save users the burden of post-processing, we also develop a novel in situ tool for molecular species analysis. We analyze the performance of the resulting ReaxC-OMP package on two different architectures: (i) Mira, an IBM Blue Gene/Q system and (ii) Cori-II, a Cray XC-40 sytem with Knights Landing processors. For Pentaerythritol tetranitrate (PETN) systems of sizes ranging from 32 thousand to 16.6 million particles, we observe speedups in the range of 1.5-4.5x. We observe sustained performance improvements for up to 262,144 cores (1,048,576 processes) of Mira and a weak scaling efficiency of 91.5% in large simulations containing 16.6 million particles. Finally, the in situ molecular species analysis tool incurs only insignificant overheads across various system sizes and runs configurations.

97 MATHEMATICS AND COMPUTING↗

Evaluating asynchronous Schwarz solvers on GPUs

With the commencement of the exascale computing era, we realize that the majority of the leadership supercomputers are heterogeneous and massively parallel. Even a single node can contain multiple co-processors such as GPUs and multiple CPU cores. For example, ORNL’s Summit accumulates six NVIDIA Tesla V100 GPUs and 42 IBM Power9 cores on each node. Synchronizing across compute resources of multiple nodes can be prohibitively expensive. Hence, it is necessary to develop and study asynchronous algorithms that circumvent this issue of bulk-synchronous computing. In this study, we examine the asynchronous version of the abstract Restricted Additive Schwarz method as a solver. We do not explicitly synchronize, but allow the communication between the sub-domains to be completely asynchronous, thereby removing the bulk synchronous nature of the algorithm. We accomplish this by using the one-sided Remote Memory Access (RMA) functions of the MPI standard. We study the benefits of using such an asynchronous solver over its synchronous counterpart. We also study the communication patterns governed by the partitioning and the overlap between the sub-domains on the global solver. Finally, we show that this concept can render attractive performance benefits over the synchronous counterparts even for a well-balanced problem.

Nayak, Pratik↗

Parthenon—a performance portable block-structured adaptive mesh refinement framework

On the path to exascale the landscape of computer device architectures and corresponding programming models has become much more diverse. While various low-level performance portable programming models are available, support at the application level lacks behind. To address this issue, we present the performance portable block-structured adaptive mesh refinement (AMR) framework Parthenon, derived from the well-tested and widely used Athena++ astrophysical magnetohydrodynamics code, but generalized to serve as the foundation for a variety of downstream multi-physics codes. Parthenon adopts the Kokkos programming model, and provides various levels of abstractions from multidimensional variables, to packages defining and separating components, to launching of parallel compute kernels. Parthenon allocates all data in device memory to reduce data movement, supports the logical packing of variables and mesh blocks to reduce kernel launch overhead, and employs one-sided, asynchronous MPI calls to reduce communication overhead in multi-node simulations. Using a hydrodynamics miniapp, we demonstrate weak and strong scaling on various architectures including AMD and NVIDIA GPUs, Intel and AMD x86 CPUs, IBM Power9 CPUs, as well as Fujitsu A64FX CPUs. At the largest scale on Frontier (the first TOP500 exascale machine), the miniapp reaches a total of 1.7 × 10 13 zone-cycles/s on 9216 nodes (73,728 logical GPUs) at [Formula: see text] weak scaling parallel efficiency (starting from a single node). In combination with being an open, collaborative project, this makes Parthenon an ideal framework to target exascale simulations in which the downstream developers can focus on their specific application rather than on the complexity of handling massively-parallel, device-accelerated AMR.

97 MATHEMATICS AND COMPUTING↗

A hybrid computational strategy to address WGS variant analysis in >5000 samples

Abstract Background The decreasing costs of sequencing are driving the need for cost effective and real time variant calling of whole genome sequencing data. The scale of these projects are far beyond the capacity of typical computing resources available with most research labs. Other infrastructures like the cloud AWS environment and supercomputers also have limitations due to which large scale joint variant calling becomes infeasible, and infrastructure specific variant calling strategies either fail to scale up to large datasets or abandon joint calling strategies. Results We present a high throughput framework including multiple variant callers for single nucleotide variant (SNV) calling, which leverages hybrid computing infrastructure consisting of cloud AWS, supercomputers and local high performance computing infrastructures. We present a novel binning approach for large scale joint variant calling and imputation which can scale up to over 10,000 samples while producing SNV callsets with high sensitivity and specificity. As a proof of principle, we present results of analysis on Cohorts for Heart And Aging Research in Genomic Epidemiology (CHARGE) WGS freeze 3 dataset in which joint calling, imputation and phasing of over 5300 whole genome samples was produced in under 6 weeks using four state-of-the-art callers. The callers used were SNPTools, GATK-HaplotypeCaller, GATK-UnifiedGenotyper and GotCloud. We used Amazon AWS, a 4000-core in-house cluster at Baylor College of Medicine, IBM power PC Blue BioU at Rice and Rhea at Oak Ridge National Laboratory (ORNL) for the computation. AWS was used for joint calling of 180 TB of BAM files, and ORNL and Rice supercomputers were used for the imputation and phasing step. All other steps were carried out on the local compute cluster. The entire operation used 5.2 million core hours and only transferred a total of 6 TB of data across the platforms. Conclusions Even with increasing sizes of whole genome datasets, ensemble joint calling of SNVs for low coverage data can be accomplished in a scalable, cost effective and fast manner by using heterogeneous computing platforms without compromising on the quality of variants.

59 BASIC BIOLOGICAL SCIENCES↗

Wildfire smoke exposure and early childhood respiratory health: a study of prescription claims data

Abstract Wildfire smoke is associated with short-term respiratory outcomes including asthma exacerbation in children. As investigations into developmental wildfire smoke exposure on children’s longer-term respiratory health are sparse, we investigated associations between developmental wildfire smoke exposure and first use of respiratory medications. Prescription claims from IBM MarketScan Commercial Claims and Encounters database were linked with wildfire smoke plume data from NASA satellites based on Metropolitan Statistical Area (MSA). A retrospective cohort of live infants (2010–2016) born into MSAs in six western states (U.S.A.), having prescription insurance, and whose birthdate was estimable from claims data was constructed ( N = 184,703); of these, gestational age was estimated for 113,154 infants. The residential MSA, gestational age, and birthdate were used to estimate average weekly smoke exposure days ( smoke-day ) for each developmental period: three trimesters, and two sequential 12-week periods post-birth. Medications treating respiratory tract inflammation were classified using active ingredient and mode of administration into three categories:: 'upper respiratory', 'lower respiratory', 'systemic anti-inflammatory'. To evaluate associations between wildfire smoke exposure and medication usage, Cox models associating smoke-days with first observed prescription of each medication category were adjusted for infant sex, birth-season, and birthyear with a random intercept for MSA. Smoke exposure during postnatal periods was associated with earlier first use of upper respiratory medications (1–12 weeks: hazard ratio (HR) = 1.094 per 1-day increase in average weekly smoke-day, 95%CI: (1.005,1.191); 13–24 weeks: HR = 1.108, 95%CI: (1.016,1.209)). Protective associations were observed during gestational windows for both lower respiratory and systemic anti-inflammatory medications; it is possible that these associations may be a consequence of live-birth bias. These findings suggest wildfire smoke exposure during early postnatal developmental periods impact subsequent early life respiratory health.

Dhingra, Radhika↗

Genomic Analysis of Metastatic Solid Tumors in Veterans: Findings From the VHA National Precision Oncology Program

The Veterans Health Administration (VHA) is the largest cancer care provider in the United States, with the added challenge of serving more than twice the percentage of patients with cancer in rural areas than the national average. The VHA established the National Precision Oncology Program in 2016 to implement and standardize the practice of precision oncology across the diverse VHA system. Tumor or peripheral blood specimens from veterans with advanced solid tumors who were eligible for treatment were submitted for next-generation sequencing (NGS) at two commercial laboratories. Annotated results were generated by the laboratories and independently using IBM Watson for Genomics. Levels-of-evidence treatment recommendations were based on OncoKB criteria. From July 2016 to June 2018, 3,698 samples from 72 VHA facilities were submitted for NGS testing, of which 3,182 samples (86%) were successfully sequenced. Most samples came from men with lung, prostate, and colorectal cancers. Thirty-four percent of samples were from patients who lived in a rural area. TP53, ATM, and KRAS were among the most commonly mutated genes. Approximately 70% of samples had at least one actionable mutation, with clinical trials identified as the recommended option in more than 50%. Mutations in genes associated with a neuroendocrine prostate cancer phenotype were expressed at increased frequency among veterans than in the general population. The most frequent therapies prescribed in response to NGS testing were immune checkpoint inhibitors, EGFR kinase inhibitors, and PARP inhibitors. Clinical implementation of precision oncology is feasible across the VHA health care system, including rural sites. As a result, veterans have unique occupational exposures that might inform the nature of the mutational signatures identified here. Importantly, these results underscore the importance of increasing clinical trial availability to veterans.

59 BASIC BIOLOGICAL SCIENCES↗

Predicting partner fitness based on spatial structuring in a light-driven microbial community

Microbial communities have vital roles in systems essential to human health and agriculture, such as gut and soil microbiomes, and there is growing interest in engineering designer consortia for applications in biotechnology ( e . g ., personalized probiotics, bioproduction of high-value products, biosensing). The capacity to monitor and model metabolite exchange in dynamic microbial consortia can provide foundational information important to understand the community level behaviors that emerge, a requirement for building novel consortia. Where experimental approaches for monitoring metabolic exchange are technologically challenging, computational tools can enable greater access to the fate of both chemicals and microbes within a consortium. In this study, we developed an in-silico model of a synthetic microbial consortia of sucrose-secreting Synechococcus elongatus PCC 7942 and Escherichia coli W. Our model was built on the NUFEB framework for Individual-based Modeling (IbM) and optimized for biological accuracy using experimental data. We showed that the relative level of sucrose secretion regulates not only the steady-state support for heterotrophic biomass, but also the temporal dynamics of consortia growth. In order to determine the importance of spatial organization within the consortium, we fit a regression model to spatial data and used it to accurately predict colony fitness. We found that some of the critical parameters for fitness prediction were inter-colony distance, initial biomass, induction level, and distance from the center of the simulation volume. We anticipate that the synergy between experimental and computational approaches will improve our ability to design consortia with novel function.

59 BASIC BIOLOGICAL SCIENCES↗

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗

Shared Genomic Regions Between Derivatives of a Large Segregating Population of Maize Identified Using Bulked Segregant Analysis Sequencing and Traditional Linkage Analysis

Delayed transition from the vegetative stage to the reproductive stage of development and increased plant height have been shown to increase biomass productivity in grasses. The goal of this project was to detect quantitative trait loci using extremes from a large synthetic population, as well as a related recombinant inbred line mapping population for these two traits. Ten thousand individuals from a B73 × Mo17 noninbred population intermated for 14 generations (IBM Syn14) were grown at a density of approximately 16,500 plants ha -1 . Flowering time and plant height were measured within this population. DNA was pooled from the 46 most extreme individuals from each distributional tail for each of the traits measured and used in bulk segregant analysis (BSA) sequencing. Allelic divergence at each of the ~1.1 million SNP loci was estimated as the difference in allele frequencies between the selected extremes. Additionally, 224 intermated B73 × Mo17 recombinant inbred lines were concomitantly grown at a similar density adjacent to the large synthetic population and were assessed for flowering time and plant height. Using the BSA sequencing method, 14 and 13 genomic regions were identified for flowering time and plant height, respectively. Linkage mapping with the RIL population identified eight and three regions for flowering time and plant height, respectively. Of the regions identified, three colocalized between the two populations for flowering time and two colocalized for plant height. This study demonstrates the utility of using BSA sequencing for the dissection of complex quantitative traits important for production of lignocellulosic ethanol.

Genetics & Heredity↗

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

97 MATHEMATICS AND COMPUTING↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Fundamental Mechanisms Driving the Amorphous to Crystalline Phase Transformation

Phase transformations are ubiquitous, fundamental phenomena that lie at the heart of many structural, optical and electronic properties in condensed matter physics and materials science. Many transformations, especially those occurring under extreme conditions such as rapid changes in the thermodynamic state, are controlled by poorly understood processes involving the nucleation and quenching of metastable phases. Typically these processes occur on time and length scales invisible to most experimental techniques ({micro}s and faster, nm and smaller), so our understanding of the dynamics tends to be very limited and indirect, often relying on simulations combined with experimental study of the ''time infinity'' end state. Experimental techniques that can directly probe phase transformations on their proper time and length scales are therefore key to providing fundamental insights into the whole area of transformation physics and materials science. LLNL possesses a unique dynamic transmission electron microscope (DTEM) capable of taking images and diffraction patterns of laser-driven material processes with resolution measured in nanometers and nanoseconds. The DTEM has previously used time-resolved diffraction patterns to quantitatively study phase transformations that are orders of magnitude too fast for conventional in situ TEM. More recently the microscope has demonstrated the ability to directly image a reaction front moving at {approx}13 nm/ns and the nucleation of a new phase behind that front. Certain compound semiconductor phase change materials, such as Ge{sub 2}Sb{sub 2}Te{sub 5} (GST), Sb{sub 2}Te and GeSb, exhibit a technologically important series of transformations on scales that fall neatly into the performance specifications of the DTEM. If a small portion of such material is heated above its melting point and then rapidly cooled, it quenches into an amorphous state. Heating again with a less intense pulse leads to recrystallization into a vacancy-stabilized metastable rock salt structure. Each transformation takes {approx}10-100 ns, and the cycle can be driven repeatedly a very large number of times with a nanosecond laser such as the DTEM's sample drive laser. These materials are widely used in optical storage devices such as rewritable CDs and DVDs, and they are also applied in a novel solid state memory technology - phase change memory (PCM). PCM has the potential to produce nonvolatile memory systems with high speed, extreme density, and very low power requirements. For PCM applications several materials properties are of great importance: the resistivities of both phases, the crystallization temperature, the melting point, the crystallization speed, reversibility (number of phase-transformation cycles without degradation) and stability against crystallization at elevated temperature. For a viable technology, all these properties need to have good scaling behavior, as dimensions of the memory cells will shrink with every generation. In this LDRD project, we used the unique single-shot nanosecond in situ experimentation capabilities of the DTEM to watch these transformations in GST on the time and length scales most relevant for device applications. Interpretation of the results was performed in conjunction with atomistic and finite-element computations. Samples were provided by collaborators at IBM and Stanford University. We observed, and measured the kinetics of, the amorphous-crystalline and melting-solidification transitions in uniform thin-film samples. Above a certain threshold, the crystal nucleation rate was found to be enormously high (with many nuclei appearing per cubic {micro}m even after nanosecond-scale incubation times), in agreement with atomistic simulation and consistent with an extremely low nucleation barrier. We developed data reduction techniques based on principal component analysis (PCA), revealing the complex, multi-dimensional evolution of the material while suppressing noise and irrelevant information. Using a novel specimen geometry, we also achieved repeated switching between the amorphous and crystalline phases enabling in situ study of structural change after phase cycling, which is relevant to device performance. We also observed the coupling between the phase transformations and the evolution of morphology on the nanometer scale, revealing the gradual development of striations in uniform films and preferential melting at sharp edges in laser-heated nanopatterned GST. This nonuniform melting, interpreted through simulation as being a direct result of geometrical laser absorption effects, appears to be responsible for a marked loss in morphological stability even at moderate laser intensities and may be an important factor in the longevity of nanostructured phase change materials in memory applications.

36 MATERIALS SCIENCE↗

Performance Analysis of and Tool Support for Transactional Memory on BG/Q

Martin Schindewolf worked during his internship at the Lawrence Livermore National Laboratory (LLNL) under the guidance of Martin Schulz at the Computer Science Group of the Center for Applied Scientific Computing. We studied the performance of the TM subsystem of BG/Q as well as researched the possibilities for tool support for TM. To study the performance, we run CLOMP-TM. CLOMP-TM is a benchmark designed for the purpose to quantify the overhead of OpenMP and compare different synchronization primitives. To advance CLOMP-TM, we added Message Passing Interface (MPI) routines for a hybrid parallelization. This enables to run multiple MPI tasks, each running OpenMP, on one node. With these enhancements, a beneficial MPI task to OpenMP thread ratio is determined. Further, the synchronization primitives are ranked as a function of the application characteristics. To demonstrate the usefulness of these results, we investigate a real Monte Carlo simulation called Monte Carlo Benchmark (MCB). Applying the lessons learned yields the best task to thread ratio. Further, we were able to tune the synchronization by transactifying the MCB. Further, we develop tools that capture the performance of the TM run time system and present it to the application's developer. The performance of the TM run time system relies on the built-in statistics. These tools use the Blue Gene Performance Monitoring (BGPM) interface to correlate the statistics from the TM run time system with performance counter values. This combination provides detailed insights in the run time behavior of the application and enables to track down the cause of degraded performance. Further, one tool has been implemented that separates the performance counters in three categories: Successful Speculation, Unsuccessful Speculation and No Speculation . All of the tools are crafted around IBM's xlc compiler for C and C++ and have been run and tested on a Q32 early access system.

97 MATHEMATICS AND COMPUTING↗

What Then Do We Do About Computer Security?

This report presents the answers that an informal and unfunded group at SNL provided for questions concerning computer security posed by Jim Gosler, Sandia Fellow (00002). The primary purpose of this report is to record our current answers; hopefully those answers will turn out to be answers indeed. The group was formed in November 2010. In November 2010 Jim Gosler, Sandia Fellow, asked several of us several pointed questions about computer security metrics. Never mind that some of the best minds in the field have been trying to crack this nut without success for decades. Jim asked Campbell to lead an informal and unfunded group to answer the questions. With time Jim invited several more Sandians to join in. We met a number of times both with Jim and without him. At Jim's direction we contacted a number of people outside Sandia who Jim thought could help. For example, we interacted with IBM's T.J. Watson Research Center and held a one-day, videoconference workshop with them on the questions.

97 MATHEMATICS AND COMPUTING↗

The HARNESS Workbench: Unified and Adaptive Access to Diverse HPC Platforms

The primary goal of the Harness WorkBench (HWB) project is to investigate innovative software environments that will help enhance the overall productivity of applications science on diverse HPC platforms. Two complementary frameworks were designed: one, a virtualized command toolkit for application building, deployment, and execution, that provides a common view across diverse HPC systems, in particular the DOE leadership computing platforms (Cray, IBM, SGI, and clusters); and two, a unified runtime environment that consolidates access to runtime services via an adaptive framework for execution-time and post processing activities. A prototype of the first was developed based on the concept of a 'system-call virtual machine' (SCVM), to enhance portability of the HPC application deployment process across heterogeneous high-end machines. The SCVM approach to portable builds is based on the insertion of toolkit-interpretable directives into original application build scripts. Modifications resulting from these directives preserve the semantics of the original build instruction flow. The execution of the build script is controlled by our toolkit that intercepts build script commands in a manner transparent to the end-user. We have applied this approach to a scientific production code (Gamess-US) on the Cray-XT5 machine. The second facet, termed Unibus, aims to facilitate provisioning and aggregation of multifaceted resources from resource providers and end-users perspectives. To achieve that, Unibus proposes a Capability Model and mediators (resource drivers) to virtualize access to diverse resources, and soft and successive conditioning to enable automatic and user-transparent resource provisioning. A proof of concept implementation has demonstrated the viability of this approach on high end machines, grid systems and computing clouds.

97 MATHEMATICS AND COMPUTING↗