Publications

Results 1–25 of 26

Search results

Jump to search filters

Advances in GDSA Framework Development and Process Model Integration

Mariner, Paul E.; Nole, Michael A.; Basurto, Eduardo; Berg, Timothy M.; Chang, Kyung W.; Debusschere, Bert J.; Eckert, Aubrey; Ebeida, Mohamed S.; Gross, Mike; Hammond, Glenn; Harvey, Jacob; Jordan, Spencer H.; Kuhlman, Kristopher L.; Laforce, Tara C.; Leone, Rosemary C.; Mclendon, William; Mills, Melissa M.; Park, Heeho D.; Bays, Nathan R.; Bays, Nathan R.; Seidl, D.T.; David, Sevougian; Stein, Emily; Swiler, Laura P.

The Spent Fuel and Waste Science and Technology (SFWST) Campaign of the U.S. Department of Energy (DOE) Office of Nuclear Energy (NE), Office of Spent Fuel & Waste Disposition (SFWD) is conducting research and development (R&D) on geologic disposal of spent nuclear fuel (SNF) and highlevel nuclear waste (HLW). A high priority for SFWST disposal R&D is to develop a disposal system modeling and analysis capability for evaluating disposal system performance for nuclear waste in geologic media. This report describes fiscal year (FY) 2020 advances of the Geologic Disposal Safety Assessment (GDSA) Framework and PFLOTRAN development groups of the SFWST Campaign. The common mission of these groups is to develop a geologic disposal system modeling capability for nuclear waste that can be used to probabilistically assess the performance of disposal options and generic sites. The capability is a framework called GDSA Framework that employs high-performance computing (HPC) capable codes PFLOTRAN and Dakota.

More Details

Geospatial-Temporal Semantic Graphs for Automated Wide-Area Search

Brost, Randolph; Carroll, Michelle J.; Dennison, Debbie; Goforth, John; Mclendon, William; Morrow, James D.; Neil-Dunne, Ojas D.'.; Parekh, Ojas D.; Patterson, Andrew J.; Bays, Nathan R.; Strip, David R.; Woodbridge, Diane M.K.

We address the problem of wide-area search of overhead imagery. Given a time sequence of overhead images, we construct a geospatial-temporal semantic graph, which expresses the complex continuous information in the overhead images in a discrete searchable form, including explicit modeling of changes seen from one image to the next. We can then express desired search goals as a template graph, and search for matches using simple and efficient graph search algorithms. This produces a set of potential matches which provide cues for where to examine the imagery in detail, applying human expertise to determine which matches are correct. We include a match quality metric that scores the matches according to how well they match the stated search goal. This enables matches to be presented in sorted order with the best matches first, similar to the results returned by a web search engine. We present an evaluation of the method applied to several examples and data sets, and show that it can be used successfully for some problems. We also remark on several limitations of the method and note additional work needed to improve its scope and robustness. Approved for public release; further dissemination unlimited.

More Details

Encoding and Analyzing Aerial Imagery Using Geospatial Semantic Graphs

Rintoul, Mark D.; Watson, Jean-Paul; Mclendon, William; Parekh, Ojas D.; Martin, Shawn

While collection capabilities have yielded an ever-increasing volume of aerial imagery, analytic techniques for identifying patterns in and extracting relevant information from this data have seriously lagged. The vast majority of imagery is never examined, due to a combination of the limited bandwidth of human analysts and limitations of existing analysis tools. In this report, we describe an alternative, novel approach to both encoding and analyzing aerial imagery, using the concept of a geospatial semantic graph. The advantages of our approach are twofold. First, intuitive templates can be easily specified in terms of the domain language in which an analyst converses. These templates can be used to automatically and efficiently search large graph databases, for specific patterns of interest. Second, unsupervised machine learning techniques can be applied to automatically identify patterns in the graph databases, exposing recurring motifs in imagery. We illustrate our approach using real-world data for Anne Arundel County, Maryland, and compare the performance of our approach to that of an expert human analyst.

More Details

Brief announcement: Subgraph Isomorphism on a MultiThreaded shared memory architecture

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Leung, Vitus J.; Mclendon, William

Graph algorithms tend to suffer poor performance due to the irregularity of access patterns within general graph data structures, arising from poor data locality, which translates to high memory latency. The result is that advances in high-performance solutions for graph algorithms are most likely to come through advances in both architectures and algorithms. Specialized MMT shared memory machines offer a potentially transformative environment in which to approach the problem. Here, we explore the challenges of implementing Subgraph Isomorphism (SI) algorithms based on the Ullmann and VF2 algorithms in the Cray XMT environment, where issues of memory contention, scheduling, and compiler parallelizability must be optimized. Copyright is held by the author/owner(s).

More Details

SNL software manual for the ACS Data Analytics Project

Stearley, Jon S.; Robinson, David G.; Hooper, Russell; Stickland, Michael; Mclendon, William; Williams, Aaron S.; Rodrigues, Arun

In the ACS Data Analytics Project (also known as 'YumYum'), a supercomputer is modeled as a graph of components and dependencies, jobs and faults are simulated, and component fault rates are estimated using the graph structure and job pass/fail outcomes. This report documents the successful completion of all SNL deliverables and tasks, describes the software written by SNL for the project, and presents the data it generates. Readers should understand what the software tools are, how they fit together, and how to use them to reproduce the presented data and additional experiments as desired. The SNL YumYum tools provide the novel simulation and inference capabilities desired by ACS. SNL also developed and implemented a new algorithm, which provides faster estimates, at finer component granularity, on arbitrary directed acyclic graphs.

More Details

Final report for %22High performance computing for advanced national electric power grid modeling and integration of solar generation resources%22, LDRD Project No. 149016

Schoenwald, David A.; Richardson, Bryan T.; Riehm, Andrew C.; Wolfenbarger, Paul; Adams, Brian M.; Reno, Matthew J.; Hansen, Clifford; Oldfield, Ron; Stamp, Jason E.; Stein, Joshua; Hoekstra, Robert J.; Nelson, Jeffrey; Munoz-Ramos, Karina; Mclendon, William; Russo, Thomas V.; Phillips, Laurence R.

Design and operation of the electric power grid (EPG) relies heavily on computational models. High-fidelity, full-order models are used to study transient phenomena on only a small part of the network. Reduced-order dynamic and power flow models are used when analysis involving thousands of nodes are required due to the computational demands when simulating large numbers of nodes. The level of complexity of the future EPG will dramatically increase due to large-scale deployment of variable renewable generation, active load and distributed generation resources, adaptive protection and control systems, and price-responsive demand. High-fidelity modeling of this future grid will require significant advances in coupled, multi-scale tools and their use on high performance computing (HPC) platforms. This LDRD report demonstrates SNL's capability to apply HPC resources to these 3 tasks: (1) High-fidelity, large-scale modeling of power system dynamics; (2) Statistical assessment of grid security via Monte-Carlo simulations of cyber attacks; and (3) Development of models to predict variability of solar resources at locations where little or no ground-based measurements are available.

More Details
Results 1–25 of 26
Results 1–25 of 26
Top