Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed parallel programming”

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 307 records · Page 17

Network issues for large mass storage requirements

File Servers and Supercomputing environments need high performance networks to balance the I/O requirements seen in today's demanding computing scenarios. UltraNet is one solution which permits both high aggregate transfer rates and high task-to-task transfer rates as demonstrated in actual tests. UltraNet provides this capability as both a Server-to-Server and Server-to-Client access network giving the supercomputing center the following advantages highest performance Transport Level connections (to 40 MBytes/sec effective rates); matches the throughput of the emerging high performance disk technologies, such as RAID, parallel head transfer devices and software striping; supports standard network and file system applications using SOCKET's based application program interface such as FTP, rcp, rdump, etc.; supports access to the Network File System (NFS) and LARGE aggregate bandwidth for large NFS usage; provides access to a distributed, hierarchical data server capability using DISCOS UniTree product; supports file server solutions available from multiple vendors, including Cray, Convex, Alliant, FPS, IBM, and others.

Perdue, James↗

Use of Neutron Flux Calculated by Shift in a Grizzly Reactor Pressure Vessel Fracture Simulation

The reactor pressure vessel (RPV) plays the critical role of containing the reactor and coolant in a light water reactor nuclear power plant, and must be able to safely perform this function under a variety of normal and off-normal transient loading conditions. The RPV is subjected to harsh environmental conditions (elevated temperature and high neutron flux) whenever the plant is operating, which leads to embrittlement of the steel over time. RPVs contain populations of flaws introduced during the manufacturing process, and the primary safety concern is that during a transient event, a fracture could initiate at the site of one of these flaws and lead to rupture of the RPV. RPVs are very rugged structures, and the probability of this occurring is very low, but as the RPV's steel becomes embrittled over time, its resistance to fracture decreases and this becomes more likely. Assessing the likelihood of RPV fracture during a transient event involves performing a probabilistic fracture mechanics analysis, in which random sampling procedures are used to assess the probability of fracture of a population of flaws. Grizzly offers unique capabilities for modeling the RPV using 1D, 2D, or 3D representations, taking advantage of parallel computing for this type of analysis. One of the important inputs to Grizzly is the spatial distribution of the neutron fluence, which has a large impact on the material embrittlement, and should thus be characterized as accurately as possible. The VERA core simulator developed by the CASL program takes advantage of high performance computing resources to perform high-fidelity multiphysics simulations of reactor physics, including the effects of neutron transport, fuel performance, and thermal hydraulics. Recently a capability was developed to also evaluate neutron fluxes away from the reactor core through the Shift code. This allows for a detailed 3D map of the spatial variation of the fluence in components such as the RPV to be computed, which is ideal for use with Grizzly. This report documents a procedure developed to use the fluences computed in Shift in a Grizzly simulation, which allows for improved realisim in the prediction of the effects of environmental exposure on propensity for reactor pressure vessel fracture. This capability demonstrated on RPVs with multiple types of configurations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Velocity-space synthesis of ISEE-1 measurements of the three dimensional electron distribution function

A computer package which produces contour plots of the three dimensional electron distribution function measured by an electron spectrometer aboard ISEE-1 is described. Examples of the contour plots and an explanation of how to use the program, including the necessary computer code for running the program on the GSFC 360/91 computer is presented. The method by which the discrete measurements of the distribution function, given by points on the four dimensional surface are synthesized into a smooth surface in a three dimensional space which can be contoured is described. The velocity components are parallel and perpendicular to the magnetic field, respectively, in the proper frame of the electrons.

Fitzenreiter, R. J.↗

Performance and Application of Parallel OVERFLOW Codes on Distributed and Shared Memory Platforms

The presentation discusses recent studies on the performance of the two parallel versions of the aerodynamics CFD code, OVERFLOW_MPI and _MLP. Developed at NASA Ames, the serial version, OVERFLOW, is a multidimensional Navier-Stokes flow solver based on overset (Chimera) grid technology. The code has recently been parallelized in two ways. One is based on the explicit message-passing interface (MPI) across processors and uses the _MPI communication package. This approach is primarily suited for distributed memory systems and workstation clusters. The second, termed the multi-level parallel (MLP) method, is simple and uses shared memory for all communications. The _MLP code is suitable on distributed-shared memory systems. For both methods, the message passing takes place across the processors or processes at the advancement of each time step. This procedure is, in effect, the Chimera boundary conditions update, which is done in an explicit "Jacobi" style. In contrast, the update in the serial code is done in more of the "Gauss-Sidel" fashion. The programming efforts for the _MPI code is more complicated than for the _MLP code; the former requires modification of the outer and some inner shells of the serial code, whereas the latter focuses only on the outer shell of the code. The _MPI version offers a great deal of flexibility in distributing grid zones across a specified number of processors in order to achieve load balancing. The approach is capable of partitioning zones across multiple processors or sending each zone and/or cluster of several zones into a single processor. The message passing across the processors consists of Chimera boundary and/or an overlap of "halo" boundary points for each partitioned zone. The MLP version is a new coarse-grain parallel concept at the zonal and intra-zonal levels. A grouping strategy is used to distribute zones into several groups forming sub-processes which will run in parallel. The total volume of grid points in each group are approximately balanced. A proper number of threads are initially allocated to each group, and in subsequent iterations during the run-time, the number of threads are adjusted to achieve load balancing across the processes. Each process exploits the multitasking directives already established in Overflow.

Djomehri, M. Jahed↗

A Sparse Distributed Gigascale Resolution Material Point Method

In this paper, we present a four-layer distributed simulation system and its adaptation to the Material Point Method (MPM). The system is built upon a performance portable C++ programming model targeting major High-Performance-Computing (HPC) platforms. A key ingredient of our system is a hierarchical block-tile-cell sparse grid data structure that is distributable to an arbitrary number of Message Passing Interface (MPI) ranks. We additionally propose strategies for efficient dynamic load balance optimization to maximize the efficiency of MPI tasks. Our simulation pipeline can easily switch among backend programming models, including OpenMP and CUDA, and can be effortlessly dispatched onto supercomputers and the cloud. Finally, we construct benchmark experiments and ablation studies on supercomputers and consumer workstations in a local network to evaluate the scalability and load balancing criteria. We demonstrate massively parallel, highly scalable, and gigascale resolution MPM simulations of up to 1.01 billion particles for less than 323.25 seconds per frame with 8 OpenSSH-connected workstations.

97 MATHEMATICS AND COMPUTING↗

A Concept for Run-Time Support of the Chapel Language

A document presents a concept for run-time implementation of other concepts embodied in the Chapel programming language. (Now undergoing development, Chapel is intended to become a standard language for parallel computing that would surpass older such languages in both computational performance in the efficiency with which pre-existing code can be reused and new code written.) The aforementioned other concepts are those of distributions, domains, allocations, and access, as defined in a separate document called "A Semantic Framework for Domains and Distributions in Chapel" and linked to a language specification defined in another separate document called "Chapel Specification 0.3." The concept presented in the instant report is recognition that a data domain that was invented for Chapel offers a novel approach to distributing and processing data in a massively parallel environment. The concept is offered as a starting point for development of working descriptions of functions and data structures that would be necessary to implement interfaces to a compiler for transforming the aforementioned other concepts from their representations in Chapel source code to their run-time implementations.

James, Mark↗

A Fine-grained Asynchronous Bulk Synchronous parallelism model for PGAS applications

The Partitioned Global Address Space (PGAS) model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. Separately, the actor model has been gaining popularity as a productive asynchronous message-passing approach for distributed objects in enterprise and cloud computing platforms, typically implemented in languages such as Erlang, Scala or Rust. To the best of our knowledge, there has been no past work on using the actor model to deliver both productivity and scalability to irregular PGAS applications with large number of small messages. In this paper, we introduce a new programming system for PGAS applications, in which point-to-point remote operations can be expressed as fine-grained asynchronous actor messages. In our approach, the programmer does not need to worry about programming complexities related to message aggregation and termination detection. Our approach can be viewed as extending the classical Bulk Synchronous Parallelism model with fine-grained asynchronous communications within a phase or superstep. Here, we believe that our approach offers a desirable point in the productivity-performance space for PGAS applications, with more scalable performance and higher productivity relative to past approaches. Specifically, for seven irregular mini-applications from the Bale Kernels and three graph kernels executed using 2048 cores in the NERSC Cori system, our approach shows geometric mean performance improvements of ≥ 20X relative to standard PGAS versions (UPC and OpenSHMEM) while maintaining comparable productivity to those versions.

97 MATHEMATICS AND COMPUTING↗

In Pursuit of the FIP Effect in Late-Type Stellar Coronae

Spectral line data for several coronally active stars, in addition to EUVE Deep Survey light curves, have been analysed under this program. Much difficulty has been encountered in the study that has resulted in fewer stars being analysed than had been hoped. The difficulties stemmed from the analysis of low X-ray spectra taken with the ASCA satellite that produced results that are strongly discrepant with respect to the EUVE results. There is no obvious explanation for this, though it appears that analysis of ASCA data systematically underestimate metal abundance in hot plasmas. Consequently, the final emphasis in our analyses has been on EUVE data. Observed line profiles have being fitted in order to measure their fluxes using IDL software specially developed under this and parallel efforts.The observed line profiles deviate from pure gaussian forms, but we have found the benefits of using additional functional forms in the fitting process to be of only very small value for the lines with highest S/N. The resulting line fluxes have being processed in terms of the coronal EM using new techniques. Resulting EM distribution models are being used to finalize metallicity and abundance estimates for the stars in the program. Special account of the influence of missing lines in the spectral models has been taken.

Drake, Jeremy↗

Compiling global name-space parallel loops for distributed execution

Distributed memory machines do not provide hardware support for a global address space. Thus programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. The compiler support required to allow programmers to express their algorithms using a global name-space is examined. A general method is presented for analysis of a high level source program and its translation into a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile time. Otherwise, run-time code is generated to implement the required data movement. The analysis required in both situations is described and the performance of the generated code on the Intel iPSC/2 is presented.

Koelbel, Charles↗

THE SPECTRAL ENERGY DISTRIBUTIONS OF z ∼ 8 GALAXIES FROM THE IRAC ULTRA DEEP FIELDS: EMISSION LINES, STELLAR MASSES, AND SPECIFIC STAR FORMATION RATES AT 650 MYR

Using new ultradeep Spitzer/InfraRed Array Camera (IRAC) photometry from the IRAC Ultra Deep Field program, we investigate the stellar populations of a sample of 63 Y-dropout galaxy candidates at z ∼ 8, only 650 Myr after the big bang. The sources are selected from HST/ACS+WFC3/IR data over the Hubble Ultra Deep Field (HUDF), two HUDF parallel fields, and wide area data over the CANDELS/GOODS-South. The new Spitzer/IRAC data increase the coverage in [3.6] and [4.5] to ∼120h over the HUDF reaching depths of ∼28 (AB,1σ). The improved depth and inclusion of brighter candidates result in direct ≥3σ InfraRed Array Camera (IRAC) detections of 20/63 sources, of which 11/63 are detected at ≥5σ. The average [3.6]-[4.5] colors of IRAC detected galaxies at z ∼ 8 are markedly redder than those at z ∼ 7, observed only 130 Myr later. The simplest explanation is that we witness strong rest-frame optical emission lines (in particular [O III] λλ4959, 5007 + Hβ) moving through the IRAC bandpasses with redshift. Assuming that the average rest-frame spectrum is the same at both z ∼ 7 and z ∼ 8 we estimate a rest-frame equivalent width of contributing 0.56{sup +0.16}{sub -0.11} mag to the [4.5] filter at z ∼ 8. The corresponding W{sub Hα}=430{sup +160}{sub -110} Å implies an average specific star formation rate of sSFR=11{sub -5}{sup +11} Gyr{sup –1} and a stellar population age of 100{sub -50}{sup +100} Myr. Correcting the spectral energy distribution for the contribution of emission lines lowers the average best-fit stellar masses and mass-to-light ratios by ∼3 ×, decreasing the integrated stellar mass density to ρ{sup *}(z=8,M{sub UV}<-18)=0.6{sup +0.4}{sub -0.3}×10{sup 6} M{sub sun} Mpc{sup –3}.

79 ASTRONOMY AND ASTROPHYSICS↗

Application Characterization at Scale: Lessons learned from developing a distributed Open Community Runtime system for High Performance Computing

Since 2012, the U.S. Department of Energy’s X-Stack program has been developing solutions including runtime systems, programming models, languages, compilers, and tools for the Exascale system software to address crucial performance and power requirements. Fine grain programming models and runtime systems show a great potential to efficiently utilize the underlying hardware. Thus, they are essential to many X-Stack efforts. An abundant amount of small tasks can better utilize the vast parallelism available on current and future machines. Moreover, finer tasks can recover faster and adapt better, due to a decrease in state and control. Nevertheless, current applications have been written to exploit old paradigms (such as Communicating Sequential Processor and Bulk Synchronous Parallel processing). To fully utilize the advantages of these new systems, applications need to be adapted to these new paradigms. As part of the applications’ porting process, in-depth characterization studies, focused on both application characteristics and runtime features, need to take place to fully understand the application performance bottlenecks and how to resolve them. This paper presents a characterization study for a novel high performance runtime system, called the Open Community Runtime, using key HPC kernels as its vehicle. This study has the following contributions: one of the first high performance, fine grain, distributed memory runtime system implementing the OCR standard (version 0.99a); and a characterization study of key HPC kernels in terms of runtime primitives running on both intra and inter node environments. Running on a general purpose cluster, we have found up to 1635x relative speed-up for a parallel tiled Cholesky Kernels on 128 nodes with 16 cores each and a 1864x relative speed-up for a parallel tiled Smith-Waterman kernel on 128 nodes with 30 cores.

Application characterization↗

Influence of Antarctic and Greenland Continental Shelf Circulation on High‐Latitude Oceans in E3SM

The science objectives of this project are to simulate and understand the impacts of both deep-basin warm-water intrusions and land-ice melt on the continental shelf circulations and sea-ice distributions around the margins of Greenland and Antarctica. As well, the role of subsurface ocean heat from the Atlantic on declining sea-ice cover in the Arctic is explored. Mesoscale processes and fine bathymetry are implicated in cross-shelf property transports around both Greenland and Antarctica. Therefore, we configured and ran an atmospheric reanalysis-forced global ocean/sea-ice simulation on a grid that reduces from 8 km at the Equator to 2 km at the poles (UH8to2) with 60 vertical levels. It was produced using the Energy Exascale Earth System Model ‘‘HiLAT’’ code (E3SMv0-HiLAT) that uses the Parallel Ocean Program (POP) and CICE5 as its ocean and sea-ice components, respectively. Two main UH8to2 simulations were carried out: one for 1975-2009 and the other for July 2016-2020 after it was initialized from a 1/25° data-assimilative ocean/sea-ice prediction system ocean/sea-ice state. The UH8to2 is not coupled to an active land-ice model. Rather, land-ice melt is represented by observationally informed freshwater fluxes (FWFs). Short (multi-year) UH8to2 simulations were conducted to understand sensitivities when Greenland ice sheet (GrIS) melt is released only at the ocean surface or when it is distributed over the upper water column in accordance with fjord melt plume behavior; these cases were compared with a no GrIS melt case. West Greenland continental shelf currents were fastest in the vertical distribution case and an increase in baroclinic conversion at the shelf break associated with increased eddy kinetic energy was found relative to the surface release case. Further, salinity is lower and meltwater volume greater in the eastern Labrador Sea in the vertical distribution case. For the Arctic, the veracity of the UH8to2 was evaluated for 2017-2020 using available observations. Simulated seasonal sea-ice thickness and concentration are realistic, but the ice is unrealistically thin in the central and eastern Arctic in the fall. Comparisons of vertical sections of ocean temperature, salinity, and buoyancy collected from Ice-Tethered Profilers (ITPs) in the eastern Arctic in the fall and winter of 2019/2020 and co-located/concurrent UH8to2 fields show the stratification over the top 100 m of the water column is too low in the model, the simulated mixed layer too deep, and the simulated subsurface Atlantic Water (AW) too warm; these biases may contribute to the sea-ice biases. A model intercomparison study using the UH8to2 and a forced 1/25° regional Arctic ocean/sea-ice (uses the HYbrid Coordinate Ocean Model and CICE5) simulation further investigates the relationship between AW and sea-ice in the eastern Arctic. The models show a mesoscale-rich pulse of Atlantic Water extending into the eastern basin that reaches maximum intensity in late winter of 2018, after which it decreases in strength. Concurrent and co-located sea-ice melt or the inhibition of sea-ice growth is seen and is attributed to halocline mesoscale eddies doming into the mixed layer with convection bringing this heat into the vicinity of the sea-ice.

58 GEOSCIENCES↗

The evolution of concepts of vestibular peripheral information processing: toward the dynamic, adaptive, parallel processing macular model

In a letter to Robert Hooke, written on 5 February, 1675, Isaac Newton wrote "If I have seen further than certain other men it is by standing upon the shoulders of giants." In his context, Newton was referring to the work of Galileo and Kepler, who preceded him. However, every field has its own giants, those men and women who went before us and, often with few tools at their disposal, uncovered the facts that enabled later researchers to advance knowledge in a particular area. This review traces the history of the evolution of views from early giants in the field of vestibular research to modern concepts of vestibular organ organization and function. Emphasis will be placed on the mammalian maculae as peripheral processors of linear accelerations acting on the head. This review shows that early, correct findings were sometimes unfortunately disregarded, impeding later investigations into the structure and function of the vestibular organs. The central themes are that the macular organs are highly complex, dynamic, adaptive, distributed parallel processors of information, and that historical references can help us to understand our own place in advancing knowledge about their complicated structure and functions.

Review, Tutorial↗

Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study

Traditional implementations of parallel graph operations on distributed memory platforms are written using Message Passing Interface (MPI) point to point communication primitives such as Send-Recv (blocking and nonblocking). Apart from this classical model, the MPI community has over the years added other communication models; however, their suitability for handling the irregular traffic workloads typical of graph operations remain comparatively less explored. Our aim in this paper is to study these relatively underutilized communication models of MPI for graph applications. More specifically, we evaluate MPI’s one-sided programming, or Remote Memory Access (RMA), and nearest neighborhood collectives using a process graph topology. There are features in these newer models that are intended to better map to irregular communication patterns, as exemplified in graph algorithms. As a concrete application for our case study, we use distributed memory implementations of a weighted graph matching algorithm to investigate performances of MPI-3 RMA and neighborhood collective operations compared to nonblocking Send- Recv. A matching in a graph is a subset of edges such that no two matched edges are incident on the same vertex. A maximum weight matching is a matching of maximum weight computed as the sum of the weights of matched edges. Algorithms for optimal matching have quadratic complexity and are difficult to parallelize. More importantly, execution of graph matching is dominated by high volume of irregular memory accesses, making it an ideal candidate for studying the effects of various MPI communication models on graph applications at scale. Our neighborhood collectives and RMA implementations yields up to 6× speedup over traditional optimized nonblocking Send-Recv implementations, on thousands of cores of the NERSC Cori supercomputer. We believe the lessons learned from this case study can be adopted to benefit a wider range of graph application codes.

Ghosh, Sayan↗

System life and reliability modeling for helicopter transmissions

A computer program which simulates life and reliability of helicopter transmissions is presented. The helicopter transmissions may be composed of spiral bevel gear units and planetary gear units - alone, in series or in parallel. The spiral bevel gear units may have either single or dual input pinions, which are identical. The planetary gear units may be stepped or unstepped and the number of planet gears carried by the planet arm may be varied. The reliability analysis used in the program is based on the Weibull distribution lives of the transmission components. The computer calculates the system lives and dynamic capacities of the transmission components and the transmission. The system life is defined as the life of the component or transmission at an output torque at which the probability of survival is 90 percent. The dynamic capacity of a component or transmission is defined as the output torque which can be applied for one million output shaft cycles for a probability of survival of 90 percent. A complete summary of the life and dynamic capacity results is produced by the program.

Savage, M.↗

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Oliker, Leonid↗

Parallelization of an Object-Oriented Unstructured Aeroacoustics Solver

A computational aeroacoustics code based on the discontinuous Galerkin method is ported to several parallel platforms using MPI. The discontinuous Galerkin method is a compact high-order method that retains its accuracy and robustness on non-smooth unstructured meshes. In its semi-discrete form, the discontinuous Galerkin method can be combined with explicit time marching methods making it well suited to time accurate computations. The compact nature of the discontinuous Galerkin method also makes it well suited for distributed memory parallel platforms. The original serial code was written using an object-oriented approach and was previously optimized for cache-based machines. The port to parallel platforms was achieved simply by treating partition boundaries as a type of boundary condition. Code modifications were minimal because boundary conditions were abstractions in the original program. Scalability results are presented for the SCI Origin, IBM SP2, and clusters of SGI and Sun workstations. Slightly superlinear speedup is achieved on a fixed-size problem on the Origin, due to cache effects.

Baggag, Abdelkader↗

Establishing a Technical Assistance Network to Build Capacity in Southwest Alaska (Southwest Alaska Energy Network - Final Report)

The Southwest Alaska Municipal Conference (SWAMC) is a non-profit regional membership economic development organization that represents the Aleutian/Pribilof Islands, Bristol Bay, and Kodiak regions of southwest Alaska. SWAMC applied for the DOE-OIE Establishment of an Inter-Tribal Technical Assistance Energy Providers Network grant FOA to work with our partners to provide energy planning and project development technical assistance. The project team was made up of SWAMC, three regional organizations, a management consulting firm, and a panel of technical consultants. SWAMC sub-contracted with the three Alaska Native regional non-profit organizations – Aleutian Pribilof Islands Association (APIA), Bristol Bay Native Association (BBNA), and Kodiak Area Native Association (KANA) – to fund full or partial Regional Energy Coordinator (REC) positions. The project period ran from September 2016 to March 2020. The project goal was to help southwest Alaska regional tribal partners and communities to develop efficient and financially sustainable structures for identifying and developing energy projects that enhance community resiliency and energy sustainability. This project established energy coordinators and management structures in the Aleutian, Bristol Bay, and Kodiak regions to expand technical assistance capacity of regional residents; demonstrate this capacity by advancing energy efficiency, heat, and power supply projects; and secure long-term funding commitments to establish a sustained technical assistance structure. The project team expanded technical assistance capacity of energy coordinators and regional stakeholders in several ways: by providing funding for the SWAMC project manager to attend three Office of Indian Energy trainings; for energy coordinators to attend numerous energy conferences; for utility clerks from several villages to receive one-on-one reporting training on Alaska’s Power Cost Equalization electric subsidy program; and for the Kodiak REC to complete the Arctic Remote Energy Networks Academy and NREL’s Executive Energy Leadership Academy. The energy coordinators demonstrated and shared their increased capacity by hosting several public events: SWAMC hosted two full-day energy workshops in February 2017 and 2018; the Kodiak REC hosted seven Energy Committee meetings for Kodiak stakeholders and gave several presentations at other events; and SWAMC and BBNA organized a Bristol Bay Regional Energy Visioning Session in May 2019. The project team created platforms to both share and request information to involve energy stakeholders in this project, including an energy website, a Facebook group, a periodic newsletter, surveys, mass emails, and paper mailers. An increase in regional capacity was demonstrated through several grant awards, including a $1.2 million USDA grant for Akhiok for an electric distribution infrastructure replacement; an AHFC Kickstarter grant for Aleknagik to audit 2 Tribal and 3 City buildings; and installation of an Air Source Heat Pump demonstration project in Atka. Two communities and one region – Ouzinkie (May 2017), Ugashik (July 2017), and the Bristol Bay region (May 2019) – utilized DOE’s technical assistance services to hold Strategic Energy Planning sessions with NREL and DOE facilitation assistance. And in early 2018, SWAMC established a parallel program, funded through a USDA Energy Audit and Renewable Energy Development grant to provide subsidized energy audits for small businesses in the region. SWAMC and partners have now completed energy audits of over 60 businesses (buildings and fishing vessels) and are currently operating a third round of the USDA program. Fifteen of those business owners have now received additional grant funding to cover 25% of the cost of the energy efficiency upgrades identified in the audit. This technical assistance structure will be sustained beyond DOE grant funding in several forms. As a sign of increased grant writing and project management capacity, the Kodiak Regional Energy Coordinator applied for and received a USDA Community Facilities Technical Assistance and Training grant to continue work begun under this program. Energy coordination tasks have been folded into existing economic development positions at SWAMC and at BBNA, ensuring long-term outreach and support in the region.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗