Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource allocation”

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 829 records · Page 46

Component-to-Optimization Workflow Demonstration

This report aims to demonstrate workflow-generating algorithms for optimizing dispatch across a broad range of Integrated Energy System applications using the Framework for Optimization of Resources and Economics (FORCE) tool suite. The optimization is performed at two different time scales. In the coarse time scale, the optimization focuses on a class of energy sources and consumers and aims to find the optimal combinations and flows of energy based on real-time price data information. In the fine time scale, the optimization focuses on a specific thermal energy delivery system and aims to find the optimal setpoints of components in order to meet the energy demands from coarse-time-scale optimizations. In this demonstration, the coarse-scale optimization is implemented using the newly developed Dispatch Optimization Variable Engine (DOVE), while the fine-scale optimization used Optimization of Real-Time Capacity Allocation (ORCA).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

QuComm: Optimizing Collective Communication for Distributed Quantum Computing

Distributed quantum computing (DQC) is a scalable way to build a large-scale quantum computing system while the error-prone nonlocal communication between DQC nodes may heavily degrade the fidelity of the distributed quantum program and thus demands specific compiler optimizations. Previous compilers on DQC communication optimization either assumes unlimited communication resource or a few communication qubits due to the hardware limitation. The former compilers may not be efficient when interfacing with communication-resource-constrained DQC hardware while the latter compilers lose the opportunities of optimizing collective communication and routing concurrent communication as they unnecessarily couple limited communication qubits with the implementation of expensive inter-node operations. In this paper, we invent the communication buffer, a communication facility consisting of idle qubits in each compute node, to decouple the execution of inter-node quantum operations from communication qubits: communication qubits are devoted to generating inter-node entanglement while internode operations are conducted in the communication buffer. The communication buffer provides an intermediate layer for inter-node communication and paves the way for collective communication optimization. We then propose QuComm, a buffer-based compiler framework that first performs smart buffer allocation according to communication characteristics of the distributed quantum program and then optimizes and collectively routes inter-node quantum operations. Experimental results on a hierarchical DQC system show that the proposed QuComm can reduce the most expensive inter-node communication request and the latency of various distributed quantum programs by 50.4% and 47.6% on average, respectively.

Wu, Anbang↗

Argonne Leadership Computing Facility 2011 annual report: Shaping future supercomputing

The ALCF's Early Science Program aims to prepare key applications for the architecture and scale of Mira and to solidify libraries and infrastructure that will pave the way for other future production applications. Two billion core-hours have been allocated to 16 Early Science projects on Mira. The projects, in addition to promising delivery of exciting new science, are all based on state-of-the-art, petascale, parallel applications. The project teams, in collaboration with ALCF staff and IBM, have undertaken intensive efforts to adapt their software to take advantage of Mira's Blue Gene/Q architecture, which, in a number of ways, is a precursor to future high-performance-computing architecture. The Argonne Leadership Computing Facility (ALCF) enables transformative science that solves some of the most difficult challenges in biology, chemistry, energy, climate, materials, physics, and other scientific realms. Users partnering with ALCF staff have reached research milestones previously unattainable, due to the ALCF's world-class supercomputing resources and expertise in computation science. In 2011, the ALCF's commitment to providing outstanding science and leadership-class resources was honored with several prestigious awards. Research on multiscale brain blood flow simulations was named a Gordon Bell Prize finalist. Intrepid, the ALCF's BG/P system, ranked No. 1 on the Graph 500 list for the second consecutive year. The next-generation BG/Q prototype again topped the Green500 list. Skilled experts at the ALCF enable researchers to conduct breakthrough science on the Blue Gene system in key ways. The Catalyst Team matches project PIs with experienced computational scientists to maximize and accelerate research in their specific scientific domains. The Performance Engineering Team facilitates the effective use of applications on the Blue Gene system by assessing and improving the algorithms used by applications and the techniques used to implement those algorithms. The Data Analytics and Visualization Team lends expertise in tools and methods for high-performance, post-processing of large datasets, interactive data exploration, batch visualization, and production visualization. The Operations Team ensures that system hardware and software work reliably and optimally; system tools are matched to the unique system architectures and scale of ALCF resources; the entire system software stack works smoothly together; and I/O performance issues, bug fixes, and requests for system software are addressed. The User Services and Outreach Team offers frontline services and support to existing and potential ALCF users. The team also provides marketing and outreach to users, DOE, and the broader community.

99 GENERAL AND MISCELLANEOUS↗

Field-scale mapping of California crop water productivity to inform water management in critically overdrafted groundwater basins

Crop water productivity (CWP) metrics can reveal how the dynamics of crop production and water use change across space and time. We use field-scale satellite inputs from 2016–2021 to estimate potential water savings for four crops (almonds, grapes, walnuts, and citrus—which collectively account for approximately one-third of California’s cropland area), within critically overdrafted groundwater sub-basins of California’s San Joaquin Valley. These annual estimates of field-level water savings potential are based on locally achievable CWP values for each crop type. Our findings show considerable spatial variation in CWP and potential water savings within each sub-basin. We find that increasing CWP to peak efficiency (defined as improving fields to the 95th percentile of observed CWP) for four crops could meet up to 36% of the estimated annual overdraft in San Joaquin Valley. For comparison, fallowing 5% of the four crop type fields in the same study area could potentially reduce annual overdraft by 11%. By delivering results at the field scale, our work can inform targeted interventions by irrigation district managers and more efficient allocation of state incentives for improved water management. For example, we estimate that state grant funding for water efficiency upgrades could have amplified potential water savings threefold by targeting investments to the least efficient fields.

54 ENVIRONMENTAL SCIENCES↗

Life Cycle Inventory of Current Photovoltaic Module Recycling Processes in Europe

With the rapid and accelerating growth of PV module installation and an increase of PV modules from the nineteen eighties and nineties reaching the end of their 30 year lifespan, their proper end of life treatment gets into focus. This report deals with the approaches, the environmental impacts and the recovered materials of PV module recycling. In this report, the environmental life cycle assessment of the current generation recycling of crystalline silicon (c-Si) and cadmium telluride (CdTe) PV modules is described. Due to the still limited waste stream today, c-Si PV modules are mainly treated in recycling plants designed for treatment of laminated glass, metals or electronic waste. Only the bulk materials glass, aluminium and copper are recovered, while the cells and other materials such as plastics are incinerated. CdTe PV modules have been treated in dedicated recycling plants for many years and life cycle inventories of this process have been published. The semiconductor is recovered in addition to glass and copper. Life cycle inventories of the recycling of current c-Si and CdTe PV modules are compiled following two modelling approaches related to recycling. The cut-off approach uses economic allocation to divide the total efforts of the recycling process between the treatment of the used PV module and the recovered products. The end-of-life approach considers the recycling process separately from the potentially avoided burdens due to recovered materials. The life cycle inventories of c-Si PV module recycling are based on data obtained from four European recyclers surveyed between 2015 and 2016. For CdTe PV module recycling, the life cycle inventories were established based on published data for the First Solar recycling facility in Germany. The life cycle impact assessment is done based on six environmental indicators previously identified as most relevant for PV electricity: particulate matter, freshwater ecotoxicity, human toxicity non-cancer effects, human toxicity cancer effects, mineral, fossil and renewable resource depletion and climate change. The life cycle inventories according to the cut-off approach can be applied to complement existing life cycle inventory data on PV systems. The environmental impacts of the recycling of c-Si PV modules are very small (maximum 1.1 %) compared to the impacts caused by the production of a 3 kWp residential PV system mounted on a slanted roof. In the case of CdTe PV module recycling, the treatment of the PV panels has the highest but still rather minor contribution in the indicator climate change (4.8 %). The life cycle inventories according to the end-of-life approach allow an assessment of the net environmental benefits of recycling. The recovery of glass, metals, and semiconductor material from c-Si and CdTe PV modules causes lower environmental impacts than the extraction, refinement and supply of the respective materials from primary resources. The highest potential benefits are observed in the indicator mineral, fossil and renewable resource depletion. The data quality of the recycling of c-Si PV modules is classified as fair since only limited information is available. In contrast, the data quality of CdTe PV module recycling is considered very good. The study was financed by the Swiss Federal Office of Energy (SFOE) and carried out in the framework of the Task 12 of the Photovoltaic Powers System Programme (PVPS) of the International Energy Agency (IEA).

14 SOLAR ENERGY↗

Network-Aware and Welfare-Maximizing Dynamic Pricing for Energy Sharing: Preprint

The proliferation of behind-the-meter (BTM) distributed energy resources (DER) within the electrical distribution network presents significant supply and demand flexibilities, but also introduces operational challenges such as voltage spikes and reverse power flows. In response, this paper proposes a network-aware dynamic pricing framework tailored for energy-sharing coalitions that aggregate small, but ubiquitous, BTM DER downstream of a distribution system operator's (DSO) revenue meter that adopts a generic net energy metering (NEM) tariff. By formulating a Stackelberg game between the energy-sharing market leader and its prosumers, we show that the dynamic pricing policy induces the prosumers toward a network-safe operation and decentrally maximizes the energysharing social welfare. The dynamic pricing mechanism involves a combination of a locational ex-ante dynamic price and an ex-post allocation, both of which are functions of the energy sharing's BTM DER. The ex-post allocation is proportionate to the price differential between the DSO NEM price and the energy sharing locational price. Simulation results using real DER data and the IEEE 13-bus test systems illustrate the dynamic nature of network-aware pricing at each bus, and its impact on voltage.

energy communities↗

Using architecture information and real-time resource state to reduce power consumption and communication costs in parallel applications.

As computer systems grow in both size and complexity, the need for applications and run-time systems to adjust to their dynamic environment also grows. The goal of the RAAMP LDRD was to combine static architecture information and real-time system state with algorithms to conserve power, reduce communication costs, and avoid network contention. We devel- oped new data collection and aggregation tools to extract static hardware information (e.g., node/core hierarchy, network routing) as well as real-time performance data (e.g., CPU uti- lization, power consumption, memory bandwidth saturation, percentage of used bandwidth, number of network stalls). We created application interfaces that allowed this data to be used easily by algorithms. Finally, we demonstrated the benefit of integrating system and application information for two use cases. The first used real-time power consumption and memory bandwidth saturation data to throttle concurrency to save power without increasing application execution time. The second used static or real-time network traffic information to reduce or avoid network congestion by remapping MPI tasks to allocated processors. Results from our work are summarized in this report; more details are available in our publications [2, 6, 14, 16, 22, 29, 38, 44, 51, 54].

Brandt, James M.↗

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↗

HarDWR - Raw Water Rights Records

A dataset within the Harmonized Database of Western U.S. Water Rights (HarDWR). For a detailed description of the database, please see the meta-record v2.0. Changelog v2.0 - Switched source data from collecting records from each state independently to using the WestDAAT dataset v1.0 - Initial public release Description In order to hold a water right in the western United States, an entity, (e.g., an individual, corporation, municipality, sovereign government, or non-profit) must register a physical document with the state's water regulatory agency. State water agencies each maintain their own database containing all registered water right documents within the state, along with relevant metadata such as the point of diversion and place of use of the water. All western U.S. states have digitized their individual water rights databases, as well as geospatial data defining the areas in which water rights are managed. Each state maintains and provides their own water rights data in accordance with individual state regulations and standards. In addition, while all states make their water rights publicly available, each provides their records in unique formats, meaning that file types, field availability, and terms vary from state to state. This leads to additional challenges to managing resources which cross state lines, or conducting consistent multi-state water analyses. For the first version of HarDWR, we collected the water rights databases from 11 Western States of the United States. In order to preform regional analyses with the collected data, the raw records had to be harmonized into one single format. The Water Data Exchange (WaDE) is a program dedicated to the sharing of water-related data for the Western U.S. in a singular consistent format. Created by the Western States Water Council (WSWC) to facilitate the collection and dissemination of water data among WSWC's member states and the public, WaDE provides an important service for those interested in water resource planning and management in their focus region. Of the services which WaDE provides, the one of the most interesting is the WestDAAT dataset, which is a collection of water rights data provided by the 18 WSWC member states that have been standardized into a single format, much like we had done on a more limited scale with HarDWR v1. For this version of HarDWR we decided to use WestDAAT, specifically a snapshot created in Feburary 2024, as our water rights source data. A full explanation of the benefits gained from this switch can be found in the description of the updated Harmonized Water Rights Records v2.0, but in short it has allowed us to focus more of our efforts on answering research questions and gaining a more realistic understanding of how water rights are allocated. For more information on how the data for WestDAAT was collected, please see the WaDE data summary. Terms of Use While WaDE works directly with the state agencies to collect and standardize the water rights records, the ultimate authority for the water rights data remains the individual states. Each state, and their respective water right authorities, have made their water right records available for non-commercial reference uses. In addition, the states make no guarantees as to the completeness, accuracy, or timeliness of their respective databases, let alone the modifications which we, the authors of this paper, have made to the collected records. None of the states should be held liable for using this data outside of its intended use. As several of the states update their water rights databases daily, the information provided here is not the latest possible, and should not be used for legal purposes. WestDAAT itself has irregular updates. Additional questions about the data the source states provided should be directed to the respective state agencies (see methods.csv and organization.csv files described below). In addition, although data was presented here was not collected directly from the states, several states requested specifically worked disclaimers when sharing their data. These disclaimers are included here as an acknowledgement from where the water rights data is primarily sourced. Colorado: "The data made available here has been modified for use from its original source, which is the State of Colorado. THE STATE OF COLORADO MAKES NO REPRESENTATIONS OR WARRANTY AS TO THE COMPLETENESS, ACCURACY, TIMELINESS, OR CONTENT OF ANY DATA MADE AVAILABLE THROUGH THIS SITE. THE STATE OF COLORADO EXPRESSLY DISCLAIMS ALL WARRANTIES, WHETHER EXPRESS OR IMPLIED, INCLUDING ANY IMPLIED WARRANTIES OF MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE. The data is subject to change as modifications and updates are complete. It is understood that the information contained in the Web feed is being used at one's own risk." Montana: "The Montana State Library provides this product/service for informational purposes only. The Library did not produce it for, nor is it suitable for legal, engineering, or surveying purposes. Consumers of this information should review or consult the primary data and information sources to ascertain the viability of the information for their purposes. The Library provides these data in good faith but does not represent or warrant its accuracy, adequacy, or completeness. In no event shall the Library be liable for any incorrect results or analysis; any direct, indirect, special, or consequential damages to any party; or any lost profits arising out of or in connection with the use or the inability to use the data or the services provided. The Library makes these data and services available as a convenience to the public, and for no other purpose. The Library reserves the right to change or revise published data and/or services at any time." Oregon: "This product is for informational purposes and may not have been prepared for, or be suitable for legal, engineering, or surveying purposes. Users of this information should review or consult the primary data and information sources to ascertain the usability of the information." File Descriptions The unmodified February, 2024 WestDAAT snapshot is composed of nine files. Below is a brief description of each file, as well as how they were utilized for HarDWR. WaDEDataDictionaryTerms.xlsx: As the file's name implies, this is a data dictionary for all of the below named files. This file describes the column names for each of the following files, with the exception of citation.txt which does not have any columns. The descriptions for each file are divided by tab,with the same name as their associated file, within this document. allocationamount.csv: The "main" file of the group, it contains the water right records for each state. Of particular note, each water right is broken down into one or more water allocations. Allocations may be withdrawn from one or more locations, or even multiple allocations associated with a particular location. This is a more subtle and realistic representation of how water is used than what was available in the first version of HarDWR. For the records from some states, this can mean that multiple allocations listed under a single right will appear as rows within this file. citation.txt: A combination of contact information for WaDE personnel, disclaimer about how the data should be used, and guidelines for citing WestDAAT. methods.csv: A file describing the source and method by which WaDE collected water rights data from each state. organization.csv: A file listing the water rights authoritative agencies for each state. sites.csv: This file provides the geographic, and other descriptors, of the physical location of allocations, called 'sites'. To reiterate, it is possible for one allocation to be associated with multiple sites, as well as one site to be associated with multiple allocations. The two descriptors which we were most interested in where the site's coordinates, as well as whether the site was classified as a Point of Diversion (POD) or a Place of Use (POU). As a general rule, PODs are geographic points, while POUs are areas typically represented as property boundaries or irregularly shaped polygons. sites_pouGeometry.csv: For those allocations with a POU site, this file contains the defining points for the associated polygons. variables.csv: A file describing the units in which an allocation's water amount is reported within WestDAAT. This information is essentially a repeat of the 'AllocationFlow_CFS' and 'AllocationVolume_AF' columns within allocationamount.csv, at least for our purposes. watersources: This file describes the source of water from which each site extracts from. For our purposes, this table was used to determine whether the water came from Surface Water, Groundwater, or Unspecified Water.

Lisk, Matthew↗

Revisiting the growth rate hypothesis: Towards a holistic stoichiometric understanding of growth

The growth rate hypothesis (GRH) posits that variation in organismal stoichiometry (C:P and N:P ratios) is driven by growth-dependent allocation of P to ribosomal RNA. The GRH has found broad but not uniform support in studies across diverse biota and habitats. We synthesise information on how and why the tripartite growth-RNA-P relationship predicted by the GRH may be uncoupled and outline paths for both theoretical and empirical work needed to broaden the working domain of the GRH. We found strong support for growth to RNA (r 2 = 0.59) and RNA-P to P (r 2 = 0.63) relationships across taxa, but growth to P relationships were relatively weaker (r 2 = 0.09). Together, the GRH was supported in ~50% of studies. Mechanisms behind GRH uncoupling were diverse but could generally be attributed to physiological (P accumulation in non-RNA pools, inactive ribosomes, translation elongation rates and protein turnover rates), ecological (limitation by resources other than P), and evolutionary (adaptation to different nutrient supply regimes) causes. These factors should be accounted for in empirical tests of the GRH and formalised mathematically to facilitate a predictive understanding of growth.

54 ENVIRONMENTAL SCIENCES↗

Grid Data Access on Widely Distributed Worker Nodes Using Scalla and SRM

Facing the reality of storage economics, NP experiments such as RHIC/STAR have been engaged in a shift of the analysis model, and now heavily rely on using cheap disks attached to processing nodes, as such a model is extremely beneficial over expensive centralized storage. Additionally, exploiting storage aggregates with enhanced distributed computing capabilities such as dynamic space allocation (lifetime of spaces), file management on shared storages (lifetime of files, pinning file), storage policies or a uniform access to heterogeneous storage solutions is not an easy task. The Xrootd/Scalla system allows for storage aggregation. We will present an overview of the largest deployment of Scalla (Structured Cluster Architecture for Low Latency Access) in the world spanning over 1000 CPUs co-sharing the 350 TB Storage Elements and the experience on how to make such a model work in the RHIC/STAR standard analysis framework. We will explain the key features and approach on how to make access to mass storage (HPSS) possible in such a large deployment context. Furthermore, we will give an overview of a fully 'gridified' solution using the plug-and-play features of Scalla architecture, replacing standard storage access with grid middleware SRM (Storage Resource Manager) components designed for space management and will compare the solution with the standard Scalla approach in use in STAR for the past 2 years. Integration details, future plans and status of development will be explained in the area of best transfer strategy between multiple-choice data pools and best placement with respect of load balancing and interoperability with other SRM aware tools or implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated Network Services for Exascale Data Movement

The Large Hadron Collider (LHC) experiments distribute data by leveraging a diverse array of National Research and Education Networks (NRENs), where experiment data management systems treat networks as a “blackbox” resource. After the High Luminosity upgrade, the Compact Muon Solenoid (CMS) experiment alone will produce roughly 0.5 exabytes of data per year. NREN Networks are a critical part of the success of CMS and other LHC experiments. However, during data movement, NRENs are unaware of data priorities, importance, or need for quality of service, and this poses a challenge for operators to coordinate the movement of data and have predictable data flows across multi-domain networks. The overarching goal of SENSE (The Software-defined network for End-to-end Networked Science at Exascale) is to enable National Labs and universities to request and provision end-to-end intelligent network services for their application workflows leveraging SDN (Software-Defined Networking) capabilities. This work aims to allow LHC Experiments and Rucio, the data management software used by CMS Experiment, to allocate and prioritize certain data transfers over the wide area network. In this paper, we will present the current progress of the integration of SENSE, Multi-domain end-to-end SDN Orchestration with QoS (Quality of Service) capabilities, with Rucio, the data management software used by CMS Experiment.

Balcas, Justas↗

Crossroads Workflows

The Department of Energy (DOE) compute facilities operate as resources for the National Nuclear Security Administration (NNSA) and Office of Science. In this document we describe a subset of scientific work flows which are run on current platforms. There is significant commonality to how Los Alamos National Laboratory (LANL), Sandia National Laboratory (SNL), Lawrence Liver- more National Laboratory (LLNL) and the National Energy Research Scientific Computing Center (NERSC) operate and conduct scienti c inquiry with supercomputers. In addition to presenting the commonality between the sites, we believe that opportunities exist to significantly optimize the operation of our facilities and more rapidly advance our scientific goals. In describing how our scientific work flows move from inception to realization we believe that we can enable significant improvements in how computer architectures support real scientific work flows. Briefly, in order for a team of scientists to access the large supercomputers at these facilities, the team must be granted an allocation. Allocations last for a fixed amount of time (usually 6 or 12 months), and a large number of teams will have overlapping allocations ensuring that a large amount of work is available in the scheduling queue. During the allocation, the scientists will construct work flows as described in this document. Many simultaneous allocations may use identical work flows with different data and scientific goals.

97 MATHEMATICS AND COMPUTING↗

Memorandum of Understanding for the 2010 Meson Test Beam Program T-995: Muon Detector / Tail Catcher R&D

This is a memorandum of understanding between the Fermi National Accelerator Laboratory and experimenters from Fermilab, Indiana University, Northern Illinois University, University of Notre Dame, Wayne State University, INFN (Trieste / Udine, Roma I, Padova, Ferrara) who have committed to participate in beam tests to be carried out during the 2010 MTBF pro gram. The memorandum is intended solely for the purpose of providing a budget estimate and a work allocation for Fermilab, the funding agencies and the participating institutions. It reflects an arrangement that currently is satisfactory to the parties. However, it is recognized and anticipated that changing circumstances of the evolving research program will necessitate revisions. The parties agree to negotiate amendments to this memorandum which will reflect such required adjustments. The test objectives are to continue the development of extruded scintillator-based muon counters begun in T-956 with emphasis on the use of Si Pixelated Photon Detectors (PPDs). The R&D program outlined here continues the T-956 studies using particle beams to test long strip counters, up to 6m, and new prototype TB4 electronics developed at Fermilab which the experimenters expect will lead to the assembly of future large-scale integrated systems that may be the subject for a future proposal. For the purpose of this work, T-995 will require limited space and resources which may be compatible with other users' equipment in the testing area. The T-995 experimenters may not always require control of the beam. The T-995 experimenters will use some of the same apparatus that is to be used by the experimenters who will study total absorption dual readout calorimetry at MTest (experiment T-1004). The T-995 and T-I004 experimenters both use newly designed Fermilab electronics to digitize the shape of the PPD pulse corresponding to the scintillator output. Both projects will share most of the data acquisition software and typically they will share the same beam instrumentation (beam defining counters and coincidence circuits). Both sets of experimenters will share some of the same counting house logic and analysis software for on-line data analysis. Some of the T-995 and T-I004 manpower available to the two projects will work on both projects although many of the studies will not run concurrently.

43 PARTICLE ACCELERATORS↗

Aggregation in bottom-up vulnerability assessments and equity implications: The case of Jordanian households’ water supply

Bottom-up methods for water resources modeling rely on acceptability thresholds to find, through a response surface, which deeply uncertain futures lead to system failure. They commonly treat water users as aggregate actors, which may preclude analysis of the equity impacts of interventions. This paper explores how aggregation choices for large groups of water users lead to different policy recommendations in response surface assessments. Herein, two aggregation methods with varying parameters are considered: percentile satisfaction targets and generalized mean. A 2-dimensional stress-test assessment across groundwater availability and population is applied to household water supply in Jordan. The study compares six different policies covering supply enhancement and rebalancing, using a country-wide multi-agent model that characterizes households across socioeconomic strata. For different aggregation levels, policies are ordered by their associated robustness index. Results show that aggregation choices may modify response surfaces as much as policy changes and strongly determine policy preference. Modifying allocation rules can substantially reduce the disparity in household vulnerability. Preferences defined by aggregation intervals provide a finer understanding of trade-offs among water users and may improve deliberation over equity under deep uncertainty.

54 ENVIRONMENTAL SCIENCES↗

Evolving Competitive Markets in SAPP: Leveraging Competitive Wholesale Electricity Markets to Drive Renewable Generation Capacity in the Southern African Power Pool (SAPP)

The SADC region has significant natural resource potential to increase renewable energy generation, improve electricity reliability, and support economic development. This research finds an apparent lack of confidence from electricity infrastructure investors in SAPP wholesale electricity markets, which increases risk perception and lowers the likelihood of capital deployment. With respect to free market fundamentals, competitive market obstacles and renewable energy development obstacles are characterized. Stakeholders identified the top obstacles to well-functioning competitive markets as insufficient transmission infrastructure for interconnection and regional movement of electricity, dominance of national single-buyer markets, and lack of or weak nation-state regulatory frameworks. Stakeholders prioritized the top three obstacles for renewable energy development as a lack of viable commercial arrangements for variable renewable energy (VRE) balancing, lack of functional and consistent nation-level regulations, and higher project costs related to reliance on imported equipment. With respect to potential solution options, stakeholders prioritized the development of new cost allocation and finance methods to facilitate new transmission expansion, training to educate new or potential new market entrants on SAPP processes, as well as modeling and analysis of regional SAPP participation benefits disaggregated to the nation-state level. From these perspectives, this research identified strategy options for consideration including transitioning SAPP to a regional transmission operator (RTO) for operation and planning of cross-border transmission facilities and market administration, shifting operations of SAPP member transmission systems to Independent System Operators (ISOs), establishing a regional regulatory authority and enhancing market data transparency. Implementing these reforms is expected to be challenging, but not insurmountable, given the domestic political, legal, and jurisdictional complexities of the SADC region.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Management of Risk and Uncertainty Through Optimized Co-Operation of Transmission Systems and Microgrids with Responsive Loads (Final Report)

The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Tale of Two Systems: Flexibility of Usage of Kraken and Nautilus at the National Institute for Computational Sciences

The National Institute for Computational Sciences (NICS) at the University of Tennessee currently operates two computational resources for the eXtreme Science and Engineering Discovery Environment (XSEDE), Kraken, a 112,896-core Cray XT5 for general purpose computation, and Nautilus, a 1,024-core SGI Altix UV 1000 for data analysis and visualization. We analyze a year's worth of accounting logs for Kraken and Nautilus to understand how users take advantage of these two systems and how analysis jobs differ from general HPC computation We find that researchers take advantage of the flexibility offered by these systems, running a wide variety of jobs at many scales and using the full range of core counts and available memory for their jobs. The jobs on Nautilus tend to use less walltime and more memory per core than the jobs run on Kraken. Additionally, researchers are more likely to run interactive jobs on Nautilus than on Kraken. Small jobs experience a good quality of service on both systems. This information can be used for the management and allocation of time on existing HPC and analysis systems as well as for planning for deploying future HPC and analysis systems.

Szczepanski, Amy F↗