Search NASA⌕ Search

SEARCH · Search NASA

Results for “XMT”

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 19 records

Implementing and Evaluating Multithreaded Triad Census Algorithms on the Cray XMT

Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysis denotes a class of mathematical and statistical methods designed to study and measure social networks. Beyond sociolo-gy, social network analysis methods are being applied to other types of data in other domains such as bioinformatics, computer networks, national security, and economics. For particular problems, the size of a social network can grow to millions of nodes and tens of millions of edges or more. In such cases, researchers could benefit from the application of social network analysis algorithms on high-performance architectures and systems. The Cray XMT is a third generation multithreaded system based on the Cray XT-3/4 platform. Like most other multithreaded architectures, the Cray XMT is designed to tolerate memory access latencies by switching context between threads. The processors maintain multiple threads of execution and util-ize hardware-based context switching to overlap the memory latency incurred by any thread with the computations from other threads. Due to its memory latency tolerance, the Cray XMT has the poten-tial of significantly improving the execution speed of irregular data-intensive applications such as those found in social network analysis. In this paper, we describe our experiences in developing and optimizing three implementations of a social network analysis method known as triadic analysis to execute on the Cray XMT. The three im-plementations possess different execution complexities, qualities, and characteristics. We evaluate how the various attributes of the codes affect their performance on the Cray XMT. We also explore the effects of different compiler options and execution strategies on the different triadic analysis im-plementations and identify general XMT programming issues and lessons learned.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Assessing XMT-Measurement Variability of Air-Water Interfacial Areas in Natural Porous Media

This study investigates the accuracy and reproducibility of air-water interfacial areas measured with high-resolution synchrotron X-ray microtomography (XMT). Columns packed with one of two relatively coarse-grained monodisperse granular media, glass beads or a well-sorted quartz sand, were imaged over several years, encompassing changes in acquisition equipment, improved image quality, and enhancements to image acquisition and to processing software. For the glass beads, the specific solid surface area (SSSA-XMT) of 31.6 ± 1 cm -1 determined from direct analysis of the segmented solid-phase image data is statistically identical to the independently calculated geometric smooth-sphere specific solid surface area (GSSA, 32 ± 1 cm -1 ) and to the measured SSSA (28 ± 3 cm -1 ) obtained with the N2-Brunauer, Emmett, and Teller method. The maximum specific air-water interfacial area (Amax) is 27.4 (±2) cm -1 , which compares very well to the SSSA-XMT, GSSA, and SSSA-N2-Brunauer, Emmett, and Teller values. For the sand, the SSSA-XMT (111 ± 2 cm -1 ) and GSSA (113 ± 1 cm -1 ) are similar. The mean Amax is 96 ± 5 cm -1 , which compares well to both the SSSA and the GSSA values. The XMT-SSSA values deviated from the GSSA values by 7–16% for the first four experiments but were essentially identical for the later experiments. This indicates that enhancements in image acquisition and processing improved data accuracy. The Amax values ranged from 74 cm -1 to 101 cm -1 , with a coefficient of variation (COV) of 9%. The maximum capillary interfacial area ranged from 12 cm-1 to 19 cm -1 , for a COV of 10%. The COVs for both decreased to 5–6% for the latter five experiments. These results demonstrate that XMT imaging provides accurate and reproducible measurements of total and capillary interfacial areas.

54 ENVIRONMENTAL SCIENCES↗

Fast and Accurate Simulation of the Cray XMT Multithreaded Supercomputer

Irregular applications, such as data mining and analysis or graph-based computations, show unpredictable memory/network access patterns and control structures. Highly multithreaded architectures with large processor counts, like the Cray MTA-1, MTA-2 and XMT, appear to address their requirements better than commodity clusters. However, the research on highly multithreaded systems is currently limited by the lack of adequate architectural simulation infrastructures due to issues such as size of the machines, memory footprint, simulation speed, accuracy and customization. At the same time, Shared-memory MultiProcessors (SMPs) with multi-core processors have become an attractive platform to simulate large scale machines. In this paper, we introduce a cycle-level simulator of the highly multithreaded Cray XMT supercomputer. The simulator runs unmodified XMT applications. We discuss how we tackled the challenges posed by its development, detailing the techniques introduced to make the simulation as fast as possible while maintaining a high accuracy. By mapping XMT processors (ThreadStorm with 128 hardware threads) to host computing cores, the simulation speed remains constant as the number of simulated processors increases, up to the number of available host cores. The simulator supports zero-overhead switching among different accuracy levels at run-time and includes a network model that takes into account contention. On a modern 48-core SMP host, our infrastructure simulates a large set of irregular applications 500 to 2000 times slower than real time when compared to a 128-processor XMT, while remaining within 10\% of accuracy. Emulation is only from 25 to 200 times slower than real time.

Cray XMT↗

Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT

Distributed Shared Memory (DSM) machines are a wide class of multi-processor computing systems where a large virtually-shared address space is mapped on a network of physically distributed memories. High memory latency and network contention are two of the main factors that limit performance scaling of such architectures. Modern high-performance computing DSM systems have evolved toward exploitation of massive hardware multi-threading and fine-grained memory hashing to tolerate irregular latencies, avoid network hot-spots and enable high scaling. In order to model the performance of such large-scale machines, parallel simulation has been proved to be a promising approach to achieve good accuracy in reasonable times. One of the most critical factors in solving the simulation speed-accuracy trade-off is network modeling. The Cray XMT is a massively multi-threaded supercomputing architecture that belongs to the DSM class, since it implements a globally-shared address space abstraction on top of a physically distributed memory substrate. In this paper, we discuss the development of a contention-aware network model intended to be integrated in a full-system XMT simulator. We start by measuring the effects of network contention in a 128-processor XMT machine and then investigate the trade-off that exists between simulation accuracy and speed, by comparing three network models which operate at different levels of accuracy. The comparison and model validation is performed by executing a string-matching algorithm on the full-system simulator and on the XMT, using three datasets that generate noticeably different contention patterns.

99 GENERAL AND MISCELLANEOUS↗

Input-independent, Scalable and Fast String Matching on the Cray XMT

String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of on-line content and the increasing wire speeds push the need for fast, and often real- time, string searching solutions. For these conditions, many software implementations (if not all) targeting conventional cache-based microprocessors do not perform well. They either exhibit overall low performance or exhibit highly variable performance depending on the types of inputs. For this reason, real-time state of the art solutions rely on the use of either custom hardware or Field-Programmable Gate Arrays (FPGAs) at the expense of overall system flexibility and programmability. This paper presents a software based implementation of the Aho-Corasick string searching algorithm on the Cray XMT multithreaded shared memory machine. Our so- lution relies on the particular features of the XMT architecture and on several algorith- mic strategies: it is fast, scalable and its performance is virtually content-independent. On a 128-processor Cray XMT, it reaches a scanning speed of ≈ 28 Gbps with a performance variability below 10 %. In the 10 Gbps performance range, variability is below 2.5%. By comparison, an Intel dual-socket, 8-core system running at 2.66 GHz achieves a peak performance which varies from 500 Mbps to 10 Gbps depending on the type of input and dictionary size.

97 MATHEMATICS AND COMPUTING↗

Application of Cray XMT for Power Grid Contingency Selection

Contingency analysis is a key function to assess the impact of various combinations of power system component failures. It involves combinatorial numbers of contingencies which exceed the capability of even very large supercomputing platforms. Therefore, it is critical to select contingency cases within the constraint of computing power. This paper presents a contingency selection method employing graph theory (edge betweenness centrality) to power grid weighted graphs to remove low-impact components. The parallel implementation of the method was successfully carried out on the Cray XMT machine. The implementation takes advantage of the superior capabilities of the Cray XMT for graph-based problems and its programming features. This paper presents the performance scalability of Cray XMT and comparison with a cache-based, shared-memory machine.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Evaluating In-Clique and Topological Parallelism Strategies for Junction Tree-Based Bayesian Inference Algorithm on the Cray XMT

Long viewed as a strong statistical inference technique, Bayesian networks have emerged to be an important class of applications for high-performance computing. We have applied an architecture-conscious approach to parallelizing the Lauritzen-Spiegelhalter Junction Tree algorithm for exact inferencing in Bayesian networks. In optimizing the Junction Tree algorithm, we have implemented both in-clique and topological parallelism strategies to best leverage the fine-grained synchronization and massive-scale multithreading of the Cray XMT architecture. Two topological techniques were developed to parallelize the evidence propagation process through the Bayesian network. One technique involves performing intelligent scheduling of junction tree nodes based on its topology and relative size. The second technique involves decomposing the junction tree into a much finer tree-like representation to offer much more opportunities for parallelism. We evaluate these optimizations on five different Bayesian networks and report our findings and observations. Another important contribution of this paper is to demonstrate the application of massive-scale multithreading for load balancing and use of implicit parallelism-based compiler optimizations in designing scalable inferencing algorithms.

99 GENERAL AND MISCELLANEOUS↗

Accelerating Numerical Calculation on the Cray XMT

The Cray XMT provides hardware support for parallel algorithms that would be communication- or memory-bound on other machines. Unfortunately, even if an algorithm meets these criteria, performance suffers if the algorithm is too numerically intensive. We present a lookup-based approach that achieves a significant performance advantage over explicit calculation. We describe an approach to balancing memory bandwidth against on-chip floating point capabilities, leading to further speedup. Finally, we provide table lookup algorithms for a number of common functions.

97 MATHEMATICS AND COMPUTING↗

Hashing Strategies for the Cray XMT

Several strategies for hashing on a Cray XMT are experimentally compared. These strategies are designed to minimize memory contention. Results show good scalability and indicate under what circumstances each of the strategies should be used.

97 MATHEMATICS AND COMPUTING↗

Hashing strategies for the Cray XMT.

Two of the most commonly used hashing strategies - linear probing and hashing with chaining - are adapted for efficient execution on a Cray XMT. These strategies are designed to minimize memory contention. Datasets that follow a power law distribution cause significant performance challenges to shared memory parallel hashing implementations. Experimental results show good scalability up to 128 processors on two power law datasets with different data types: integer and string. These implementations can be used in a wide range of applications.

99 GENERAL AND MISCELLANEOUS↗

Microtomographic Measurements of Total Air‐Water Interfacial Areas for Soils

Abstract Synchrotron X‐ray microtomography (XMT) was used to measure total air‐water interfacial areas (A aw ) as a function of water saturation (S w ) for several soils that comprise a range of physical and geochemical properties. Measurements were also conducted for glass beads and quartz sands for comparison. Apparent near‐linearA aw ‐S w relationships are observed for the three sands and the three sandy soils. In contrast, the measured interfacial areas for two soils that contain greater proportions of silt and clay are strongly nonlinear functions of water saturation. The greater degree of nonlinearity observed for these two soils is due to their much greater particle‐size distributions (i.e., uniformity coefficients) and their concomitant greater range in pore sizes. Interfacial areas determined with the thermodynamic method were used to benchmark the XMT measurements. XMT‐measured interfacial areas compare well to the thermodynamic‐determined values for the sands and sandy soils. In contrast, the XMT‐measured interfacial areas for the two soils with larger particle‐size distributions are not fully congruent with the thermodynamic‐determined values. Both of these soils have large fractions of pore space comprising nominal pore diameters smaller than the resolution of the XMT imaging. These results suggest that air‐water interfacial area may not always be fully characterized by standard XMT for soils with large particle‐size distributions.

Environmental Sciences & Ecology↗

Imaging Wellbore Cement Degradation by Carbon Dioxide under Geologic Sequestration Conditions Using X-ray Computed Microtomography

ABSTRACT: X-ray microtomography (XMT), a nondestructive three-dimensional imaging technique, was applied to demonstrate its capability to visualize the mineralogical alteration and microstructure changes in hydrated Portland cement exposed to carbon dioxide under geologic sequestration conditions. Steel coupons and basalt fragments were added to the cement paste in order to simulate cement-steel and cement-rock interfaces. XMT image analysis showed the changes of material density and porosity in the degradation front (density: 1.98 g/cm3, porosity: 40%) and the carbonated zone (density: 2.27 g/cm3, porosity: 23%) after reaction with CO2- saturated water for 5 months compared to unaltered cement (density: 2.15 g/cm3, porosity: 30%). Three-dimensional XMT imaging was capable of displaying spatially heterogeneous alteration in cement pores, calcium carbonate precipitation in cement cracks, and preferential cement alteration along the cement-steel and cement-rock interfaces. This result also indicates that the interface between cement and host rock or steel casing is likely more vulnerable to a CO2 attack than the cement matrix in a wellbore environment. It is shown here that XMT imaging can potentially provide a new insight into the physical and chemical degradation of wellbore cement by CO2 leakage.

Imaging Wellbore Cement Degradation by Carbon Diox↗

MapReduceXMT v. Beta 0.1

The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming. The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming.

Goodman, Eric↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

MapReduceXMT v. Beta 0.1

The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming. The MapReduceXMT library ports the MapReduce framework onto the Cray XMT. MapReduce is a programming paradigm and an approach to data management for unstructured problems. It has gained relevance due to its ability to map serial operations onto parallel distributed architectures, significantly improving developer/analyst productivity. The MapReduceXMT implements the key aspects of MapReduce for the Cray XMT, a massively threaded system that is inherently difficult to program. MapReduceXMT allows users to utilize the machine effectively and efficiently without extensive training in multi-threaded programming.

Goodman, Eric↗

A Novel Application of Parallel Betweenness Centrality to Power Grid Contingency Analysis

In Energy Management Systems, contingency analysis is commonly performed for identifying and mitigating potentially harmful power grid component failures. The exponentially increasing combinatorial number of failure modes imposes a significant computational burden for massive contingency analysis. It is critical to select a limited set of high-impact contingency cases within the constraint of computing power and time requirements to make it possible for real-time power system vulnerability assessment. In this paper, we present a novel application of parallel betweenness centrality to power grid contingency selection. We cross-validate the proposed method using the model and data of the western US power grid, and implement it on a Cray XMT system - a massively multithreaded architecture - leveraging its advantages for parallel execution of irregular algorithms, such as graph analysis. We achieve a speedup of 55 times (on 64 processors) compared against the single-processor version of the same code running on the Cray XMT. We also compare an OpenMP-based version of the same code running on an HP Superdome shared-memory machine. The performance of the Cray XMT code shows better scalability and resource utilization, and shorter execution time for large-scale power grids. This proposed approach has been evaluated in PNNL’s Electricity Infrastructure Operations Center (EIOC). It is expected to provide a quick and efficient solution to massive contingency selection problems to help power grid operators to identify and mitigate potential widespread cascading power grid failures in real time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Experimental study of potential wellbore cement carbonation by various phases of carbon dioxide during geologic carbon sequestration

Hydrated Portland cement was reacted with carbon dioxide (CO2) in supercritical, gaseous, and aqueous phases to understand the potential cement alteration processes along the length of a wellbore, extending from deep CO2 storage reservoir to the shallow subsurface during geologic carbon sequestration. The 3-D X-ray microtomography (XMT) images displayed that the cement alteration was significantly more extensive by CO2-saturated synthetic groundwater than dry or wet supercritical CO2 at high P (10 MPa)-T (50°C) conditions. Scanning electron microscopy with energy dispersive spectroscopy (SEM-EDS) analysis also exhibited a systematic Ca depletion and C enrichment in cement matrix exposed to CO2-saturated groundwater. Integrated XMT, XRD, and SEM-EDS analyses identified the formation of extensive carbonated zone filled with CaCO3(s), as well as the porous degradation front and the outermost silica-rich zone in cement after exposure to CO2-saturated groundwater. The cement alteration by CO2-saturated groundwater for 2-8 months overall decreased the porosity from 31% to 22% and the permeability by an order of magnitude. Cement alteration by dry or wet supercritical CO2 was slow and minor compared to CO2-saturated groundwater. A thin single carbonation zone was formed in cement after exposure to wet supercritical CO2 for 8 months or dry supercritical CO2 for 15 months. Extensive calcite coating was formed on the outside surface of a cement sample after exposure to wet gaseous CO2 for 1-3 months. The chemical-physical characterization of hydrated Portland cement after exposure to various phases of carbon dioxide indicates that the extent of cement carbonation can be significantly heterogeneous depending on CO2 phase present in the wellbore environment. Both experimental and geochemical modeling results suggest that wellbore cement exposure to supercritical, gaseous, and aqueous phases of CO2 during geologic carbon sequestration is unlikely to damage the wellbore integrity because cement alteration by all phases of CO2 is dominated by carbonation reaction. This is consistent with previous field studies of wellbore cement with extensive carbonation after exposure to CO2 for 3 decades. However, XMT imaging indicates that preferential cement alteration by supercritical CO2 or CO2-saturated groundwater can occur along the cement-steel or cement-rock interfaces. This highlights the importance of further investigation of cement degradation along the interfaces of wellbore materials to ensure permanent geologic carbon storage.

Calcite↗