Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed Asynchronous”

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.

180 records · Page 10

Aspect-Oriented Programming

Computer science has experienced an evolution in programming languages and systems from the crude assembly and machine codes of the earliest computers through concepts such as formula translation, procedural programming, structured programming, functional programming, logic programming, and programming with abstract data types. Each of these steps in programming technology has advanced our ability to achieve clear separation of concerns at the source code level. Currently, the dominant programming paradigm is object-oriented programming - the idea that one builds a software system by decomposing a problem into objects and then writing the code of those objects. Such objects abstract together behavior and data into a single conceptual and physical entity. Object-orientation is reflected in the entire spectrum of current software development methodologies and tools - we have OO methodologies, analysis and design tools, and OO programming languages. Writing complex applications such as graphical user interfaces, operating systems, and distributed applications while maintaining comprehensible source code has been made possible with OOP. Success at developing simpler systems leads to aspirations for greater complexity. Object orientation is a clever idea, but has certain limitations. We are now seeing that many requirements do not decompose neatly into behavior centered on a single locus. Object technology has difficulty localizing concerns invoking global constraints and pandemic behaviors, appropriately segregating concerns, and applying domain-specific knowledge. Post-object programming (POP) mechanisms that look to increase the expressiveness of the OO paradigm are a fertile arena for current research. Examples of POP technologies include domain-specific languages, generative programming, generic programming, constraint languages, reflection and metaprogramming, feature-oriented development, views/viewpoints, and asynchronous message brokering. (Czarneclu and Eisenecker s book includes a good survey of many of these technologies).

Elrad, Tzilla↗

Real Time Phasor Analytics (RTPA) and RTPA-SCR System Strength Online Tool

This presentation showcases the Real-Time Phasor Analytics (RTPA) framework for monitoring inertia and assessing system strength in power grids. RTPA is an open-source tool designed to standardize access to data from Power Management Units (PMUs) and Phasor Data Concentrators (PDCs). It facilitates real-time connectivity to multiple PDCs in accordance with the IEEE C37.118-2 standard and supports asynchronous data stream integration. Additionally, RTPA can simulate a PDC server streaming C37.118-2 data and provides Python bindings for seamless interaction with the framework, eliminating the need for direct Rust programming.

24 POWER TRANSMISSION AND DISTRIBUTION↗

I/O Parallelization for the Goddard Earth Observing System Data Assimilation System (GEOS DAS)

The National Aeronautics and Space Administration (NASA) Data Assimilation Office (DAO) at the Goddard Space Flight Center (GSFC) has developed the GEOS DAS, a data assimilation system that provides production support for NASA missions and will support NASA's Earth Observing System (EOS) in the coming years. The DAO's support of the EOS project along with the requirement of producing long-term reanalysis datasets with an unvarying system levy a large I/O burden on the future system. The DAO has been involved in prototyping parallel implementations of the GEOS DAS for a number of years and is now converting the production version from shared-memory parallelism to distributed-memory parallelism using the portable Message-Passing Interface (MPI). If the MPI-based GEOS DAS is to meet these production requirements, we must make I/O from the parallel system efficient. We have designed a scheme that allows efficient I/O processing while retaining portability, reducing the need for post-processing, and producing data formats that are required by our users, both internal and external. The first phase of the GEOS DAS Parallel I/O System (GPIOS) will expand upon the common method of gathering global data to a Single PE for output. Instead of using a PE also tasked with primary computation, a number of PEs will be dedicated to I/O and its related tasks. This allows the data transformations and formatting required prior to output to take place asynchronously with respect to the GEOS DAS assimilation cycle, improving performance and generating output data sets in a format convenient for our users. I/O PEs can be added as needed to handle larger data volumes or to meet user file specifications. We will show I/O performance results from a prototype MPI GCM integrated with GPIOS. Phase two of GPIOS development will examine ways of integrating new software technologies to further improve performance and build scalability into the system. The maturing of MPI-IO implementations and other supporting libraries such as parallel HDF should provide performance gains while retaining portability.

Lucchesi, R.↗

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗

Special purpose parallel computer architecture for real-time control and simulation in robotic applications

This is a real-time robotic controller and simulator which is a MIMD-SIMD parallel architecture for interfacing with an external host computer and providing a high degree of parallelism in computations for robotic control and simulation. It includes a host processor for receiving instructions from the external host computer and for transmitting answers to the external host computer. There are a plurality of SIMD microprocessors, each SIMD processor being a SIMD parallel processor capable of exploiting fine grain parallelism and further being able to operate asynchronously to form a MIMD architecture. Each SIMD processor comprises a SIMD architecture capable of performing two matrix-vector operations in parallel while fully exploiting parallelism in each operation. There is a system bus connecting the host processor to the plurality of SIMD microprocessors and a common clock providing a continuous sequence of clock pulses. There is also a ring structure interconnecting the plurality of SIMD microprocessors and connected to the clock for providing the clock pulses to the SIMD microprocessors and for providing a path for the flow of data and instructions between the SIMD microprocessors. The host processor includes logic for controlling the RRCS by interpreting instructions sent by the external host computer, decomposing the instructions into a series of computations to be performed by the SIMD microprocessors, using the system bus to distribute associated data among the SIMD microprocessors, and initiating activity of the SIMD microprocessors to perform the computations on the data by procedure call.

Fijany, Amir↗

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

Thirumalainambi, Rajkumar↗

SVM-Based Synchronized Fault Detection for 100% Renewable Microgrids

Traditional protection schemes face significant challenges when applied to microgrids with high penetrations of renewables with inverter-based resources (IBRs). The proliferation of advanced sensing and communication technologies has generated copious data, offering an opportunity to overcome these limitations using data-driven machine learning approaches. This work proposes a novel approach based on a support vector machine (SVM) for detecting faults within a 100% renewable microgrid. The approach encompasses a systematic offline training stage for the development of a linear SVM-based fault detection algorithm. This process covers offline data collection from the microgrid under study, the extraction of features such as positive- and negative-sequence components and the total harmonic distortion of the voltage and current measurements of the relays, and the design of the linear SVM-based classifier. During the online implementation, however, different classifiers can exhibit asynchronicity in detecting the fault inception at different subcycle-to-cycle period-level delays. To circumvent this asynchronicity issue, a separate algorithm is developed for each relay to estimate the fault inception time as close to the real fault time. The performance of the proposed SVM-based synchronized fault detection method is evaluated using online time-domain simulation studies on a microgrid test system. The results corroborate the reliability of the fault detection scheme when tested under various fault cases (fault types, locations, and impedances) and non-fault cases during both grid-tied and islanded operation modes.

100% microgrid↗

SVM-Based Synchronized Fault Detection for 100% Renewable Microgrids: Preprint

Traditional protection schemes face significant challenges when applied to microgrids with high penetrations of renewables with inverter-based resources (IBRs). The proliferation of advanced sensing and communication technologies has generated copious data, offering an opportunity to overcome these limitations using data-driven machine learning approaches. This work proposes a novel approach based on a support vector machine (SVM) for detecting faults within a 100% renewable microgrid. The approach encompasses a systematic offline training stage for the development of a linear SVM-based fault detection algorithm. This process covers offline data collection from the microgrid under study, the extraction of features such as positive- and negative-sequence components and the total harmonic distortion of the voltage and current measurements of the relays, and the design of the linear SVM-based classifier. During the online implementation, however, different classifiers can exhibit asynchronicity in detecting the fault inception at different subcycle-to-cycle period-level delays. To circumvent this asynchronicity issue, a separate algorithm is developed for each relay to estimate the fault inception time as close to the real fault time. The performance of the proposed SVM-based synchronized fault detection method is evaluated using online time-domain simulation studies on a microgrid test system. The results corroborate the reliability of the fault detection scheme when tested under various fault cases (fault types, locations, and impedances) and non-fault cases during both grid-tied and islanded operation modes.

100% microgrid↗

Photodissociation dynamics of the tert -butyl perthiyl radical

Here, the photodissociation dynamics of the tert-butyl perthiyl (t-BuSS) radical are investigated by fast-beam coincidence translational spectroscopy. A fast (6 keV-8 keV) beam of neutral t-BuSS radicals is produced via photodetachment of the corresponding anion, followed by photodissociation at 248 nm (5.00 eV) or 193 nm (6.42 eV) and coincident detection of the neutral products. Photofragment mass and translational energy distributions are obtained at both wavelengths. At 248 nm, the dominant product channel (90%) is found to be S loss, with a product translational energy distribution that peaks close to the maximum available energy and an anisotropic photofragment angular distribution, indicating dissociation along a repulsive excited state. A minor channel (10%) leading to the formation of S 2 + t-Bu is also observed. At 193 nm, both two- and three-body dissociation are observed. The formation of S 2 + t-Bu is the dominant two-body product channel, with multiple electronic states of the S 2 molecule produced via excited-state dissociation processes. The formation of S + t-BuS is a minor two-body channel at this dissociation energy. The three-body channels are S 2 + H + isobutene, S 2 + CH 3 + propene, and S + SH + isobutene. The first two of these channels result from a sequential dissociation process in which the loss of S 2 from t-BuSS results in ground-state t-Bu with sufficient internal energy to undergo secondary fragmentation. The third three-body channel, S + SH + isobutene, is attributed to the loss of internally excited HS 2 from t-BuSS, which then rapidly dissociates to form S + SH in an asynchronous concerted dissociation process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

Hardening DOE R&D Software Tools for Web-based Visualization SBIR Phase I Final Report

Ubiquitous web-based visualization is essential to delivering large-scale data visualization to various stakeholders, from the scientist to the board member. These stakeholders will not tolerate a stalled application or a pop-up window asking them to wait for the processing to complete. They require a responsive and interactive visualization environment with high-quality imagery suitable for detailed analysis and boardroom presentations. At Kitware, Inc., we have accomplished web visualization to this point, leveraging state-of-the-art tools like HTML5, CSS3, SVG, Canvas, and WebGL. Solutions that leverage a combination of these technologies are necessary to handle workloads that vary significantly in data size efficiently. However, it is not always practical to move large data to the web client for visualization. Kitware's ParaView as a Service combines client-side visualization using both distributed processing and remote rendering on big data impractical to move. Existing distributed processing and remote rendering solution's interactivity is below the expectations of web-based applications. Our project examined proposed solutions to the areas outlined above in ParaView as a Service. We have investigated concurrent pipelines, streaming images, progressive rendering, and optimization of algorithms and data movement to address these concerns. For the Phase I project, we completed the proposed work plan. As a result, the project produced three prototypes of essential importance for web visualization and the ParaView as a Service community. We created a simple desktop application for an interactive streamline placement prototype, a web-based interactive streamline placement prototype, and a web-based progressive rendering utilizing raytracing prototype. These prototypes relied on the hardening of emerging software toolkits funded by the Department of Energy (DOE) Advanced Scientific Computing Research (ASCR) program (such as ParaView, VTK-m, and Mochi). We blended these components into web-based visualization prototypes that meet the industry's expectations for interactivity and responsiveness. The Phase I project had four essential focus areas: 1. Develop prototype ParaView as a Service backend server using asynchronous, non-blocking design principles. 2. Develop a prototype web application that uses the ParaView as a Service backend server for remote data visualization. 3. Implement image streaming with encoding/compression and progressive rendering capabilities in the proposed platform. 4. Evaluate the prototype developed and summarize observations, including the challenges and pitfalls of our approach. After our successful completion of Phase I, we are strongly positioned to propose a successful Phase II project.

Geveci, Berk↗

TBAA20: Task-Based Algorithms and Applications

The new challenges posed by Exascale system architectures have resulted in difficulty achieving a desired scalability using traditional distributed ­memory runtimes. Task­-based programming models show promise in addressing these challenges, providing application developers with a productive and performant approach to programming on next generation systems. Empirical studies show that task-based models can overcome load ­balancing issues that are inherent to traditional distributed ­memory runtimes, and that task-­based runtimes perform comparably to those systems when balanced. This panel is designed to explore the advantages of task-­based programming models on modern and future HPC systems from an industry, university, and national lab perspective. It aims at gathering application experts and proponents of these models to present concrete and practical examples of using task­-based runtimes to overcome the challenges posed by Exascale system architectures. This report describes the objectives, activities, and outcomes of the panel TBAA: Task­-Based Algorithms and Applications which was held at the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 20) on November 18, 2020.

97 MATHEMATICS AND COMPUTING↗

Interplanetary Microlaser Transponders

The feasibility of an asynchronous (i.e. independently firing) interplanetary laser transponder, capable of ranging between Earth and Mars and using the automated SLR2000 Satellite Laser Ranging (SLR) system as an Earth base station, has been suggested. Since that time, we have received a small amount of discretionary funding to further explore the transponder concept and to develop and test an engineering breadboard. Candidate operational scenarios for acquiring and tracking the opposite laser terminal over interplanetary distances have been developed, and breadboard engineering parameters were chosen to reflect the requirements of an Earth-Mars link Laboratory tests have been devised to simulate the Earth- Mars link between two independent SLR2000 transceivers and to demonstrate the transfer of range and time in single photon mode. The present paper reviews the concept of the asynchronous microlaser transponder, the transponder breadboard design, an operational scenario recently developed for an asteroid rendezvous, and the laboratory test setup. The optical head of the transponder breadboard fits within a cylinder roughly 15 cm in diameter and 32 cm in length and is mounted in a commercial two axis gimbal driven by two computer-controlled stepper motors which allows the receiver optical axis to be centered on a simulated Earth image. The optical head is built around a small optical bench which supports a 14.7 cm diameter refractive telescope, a prototype 2 kHz SLR2000 microlaser transmitter, a quadrant microchannel plate photomultiplier (MCP/PMT), a CCD array camera, spatial and spectral filters, assorted lenses and mirrors, and protective covers and sun shields. The microlaser is end-pumped by a fiber-coupled diode laser array. An annular mirror is employed as a passive transmit/receive (T/R) switch in an aperture-sharing arrangement wherein the transmitted beam passes through the central hole and illuminates only the central 2.5 cm of the common telescope (adequate to achieve a 10 arcsecond full laser beam divergence) while the receiver uses the remainder of the 14.7 cm aperture. Additional electronic instrumentation includes the diode pump array and associated heat sink and current drivers, rubidium frequency standard, timing distribution module, range gate generator, a recently developed all-digital correlation range receiver, and system computer. Acquisition of the opposite transponder terminal requires a search within a three-dimensional volume determined by the initial pointing uncertainty and a maximum 500 microsecond uncertainty in the laser time of fire at the opposite terminal for totally uncorrelated Earth and spacecraft clocks. The angular search is aided by a sensitive CCD array capable of imaging the Earth, Moon, and surrounding stars within the nominal + 0.5 degree cone of uncertainty associated with the initial pointing of a spacecraft body or microwave communications dish.

Degnan, John J.↗

Cybersecurity Enhancement for Multi-Infeed High-Voltage DC Systems

Composed of multiple two-terminal high-voltage DC (HVDC) transmission systems, a multi-infeed HVDC (MIDC) system exchanges massive power among multiple asynchronous AC systems. However, as an intrinsically cyber-physical system, an MIDC system could suffer from cyber-attacks, leading to massive power mismatches in multiple AC systems, and resulting in catastrophic consequences. Since the sequential responses of an MIDC system and interconnected AC systems are in different timescales, this paper first establishes a two-timescale model to evaluate the sequential impacts caused by cyber-attacks. Then, an event-triggered cyber-defense strategy is proposed to enhance the cybersecurity of an MIDC system by mitigating multiple non-simultaneous cyber-attacks. Whenever new cyber-attack events occur, the proposed cyber-defense strategy, which is mathematically modeled as a mixed-integer quadratic programming problem, is executed on-line and updated in an event-triggered manner. Here, simulation results on an MIDC system demonstrate that the low-cost and almost blind cyber-attacks can cause severe frequency deviations, and the proposed strategy can mitigate multi-cyber-attacks effectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Designing and prototyping extensions to the Message Passing Interface in MPICH

As HPC system architectures and the applications running on them continue to evolve, the MPI standard itself must evolve. The trend in current and future HPC systems toward powerful nodes with multiple CPU cores and multiple GPU accelerators makes efficient support for hybrid programming critical for applications to achieve high performance. However, the support for hybrid programming in the MPI standard has not kept up with recent trends. The MPICH implementation of MPI provides a platform for implementing and experimenting with new proposals and extensions to fill this gap and to gain valuable experience and feedback before the MPI Forum can consider them for standardization. Here, in this work, we detail six extensions implemented in MPICH to increase MPI interoperability with other runtimes, with a specific focus on heterogeneous architectures. First, the extension to MPI generalized requests lets applications integrate asynchronous tasks into MPI’s progress engine. Second, the iovec extension to datatypes lets applications use MPI datatypes as a general-purpose data layout API beyond just MPI communications. Third, a new MPI object, MPIX_Stream, can be used by applications to identify execution contexts beyond MPI processes, including threads and GPU streams. MPIX stream communicators can be created to make existing MPI functions thread-aware and GPU-aware, thus providing applications with explicit ways to achieve higher performance. Fourth, MPIX Streams are extended to support the enqueue semantics for offloading MPI communications onto a GPU stream context. Fifth, thread communicators allow MPI communicators to be constructed with individual threads, thus providing a new level of interoperability between MPI and on-node runtimes such as OpenMP. Lastly, we present an extension to invoke MPI progress, which lets users spawn progress threads with fine-grained control to adapt the communication performance to their application designs. We describe the design and implementation of these extensions, provide usage examples, and highlight their expected benefits with performance results.

97 MATHEMATICS AND COMPUTING↗

Optimized allocation method of the VSC-MTDC system for frequency regulation reserves considering the cost

In recent years, the interconnection of asynchronous power grids through the VSC-MTDC system has been proposed and extensively studied in light of the potential benefits of economical bulk power exchanges and frequency regulation reserves sharing. This paper proposed an optimized allocation method for sharing frequency regulation reserves among the interconnected power systems and the corresponding frequency regulation control of the VSC-MTDC system under emergency frequency deviation events. Firstly, the frequency regulation reserve classification is proposed. In the classification, the available frequency response capacity reserves of each interconnection are divided into commercial reserves and regular reserves. While the commercial reserves are procured through long-term contracts, the regular reserves are purchased based on market prices of frequency regulation services. Secondly, based on the proposed frequency regulation reserve classification, a novel frequency regulation control is then introduced for the VSC-MTDC system. This control method could minimize the costs of the disturbed power grid for the needed frequency response supports from the other power grids. Simulation verifications are performed on a modified IEEE 39 bus system and a highly reduced power system model representing the North American grids. The simulation verification indicates that the developed frequency regulation control significantly reduced ancillary service costs of the disturbed power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The International Space Station: A Unique Platform for Remote Sensing of Natural Disasters

Assembly of the International Space Station (ISS) was completed in 2012, and the station is now fully operational as a platform for remote sensing instruments tasked with collecting scientific data about the Earth system. Remote sensing systems are mounted inside the ISS, primarily in the U.S. Destiny Module's Window Observational Research Facility (WORF), or are located on the outside of the ISS on any of several attachment points. While NASA and other space agencies have had remote sensing systems orbiting Earth and collecting publicly available data since the early 1970s, these sensors are carried onboard free-flying, unmanned satellites. These satellites are traditionally placed into Sun-synchronous polar orbits that allow imaging of the entire surface of the Earth to be repeated with approximately the same Sun illumination (typically local solar noon) over specific areas, with set revisit times that allow uniform data to be taken over long time periods and enable straightforward analysis of change over time. In contrast, the ISS has an inclined, Sun-asynchronous orbit (the solar illumination for data collections over any location changes as the orbit precesses) that carries it over locations on the Earth between approximately 52degnorth and 52deg south latitudes (figure 1). The ISS is also unique among NASA orbital platforms in that it has a human crew. The presence of a crew provides options not available to robotic sensors and platforms, such as the ability to collect unscheduled data of an unfolding event using handheld digital cameras as part of the Crew Earth Observations (CEO) facility and on-the-fly assessment of environmental conditions, such as cloud cover, to determine whether conditions are favorable for data collection. The crew can also swap out internal sensor systems installed in the WORF as needed. The ISS orbit covers more than 90 percent of the inhabited surface of the Earth, allowing the ISS to pass over the same ground locations at different times of the day and night. This is important for two reasons: 1) certain surface processes (i.e., development of coastal fog banks) occur at times other than local solar noon, making it difficult to collect relevant data from traditional satellite platforms, and 2) it provides opportunities for the ISS to collect data for short-duration events, such as natural disasters, that polar-orbiting satellites may miss due to their orbital dynamics - in essence, the ISS can be "in the right place at the right time" to collect data. An immediate application of ISS remote sensing data collection is that the data can be used to provide information for humanitarian aid after a natural disaster. This activity contributes directly to the station's Benefits to Humanity mission. The International Charter, Space and Major Disasters (also known as the International Disaster Charter, or IDC) is an agreement between agencies of several countries to provide - on a best-effort basis - remotely sensed data related to natural disasters to requesting countries in support of disaster response. In the United States, the lead agency for interaction with the IDC is the United States Geological Survey (USGS); when an IDC request, or activation, is received, the USGS notifies the science teams for NASA instruments with targeting information for data collection. In the case of the ISS, Earth scientists in the JSC ARES Directorate, in association with the ISS Program Science Office, coordinate targeting and data collection with the USGS. If data is collected, it is passed back to the USGS for posting on its Hazards Data Distribution System and made available for download. The ISS was added to the USGS's list of NASA remote sensing assets that could respond to IDC activations in May 2012. Initially, the NASA ISS sensor systems available to respond to IDC activations included the ISS Agricultural Camera (ISSAC), an internal multispectral visible-near infrared wavelength system mounted in the WORF; CEO, a project that collects imagery through the ISS windows using off-the-shelf handheld digital visible-wavelength cameras; and the Hyperspectral Imager for the Coastal Oceans (HICO), a visible to near-infrared system mounted externally on the Japanese Experiment Module - Exposed Facility. Since May 2012, there have been 37 IDC activations; ISS sensor systems have collected data for 10 of these events.

Stefanov, William L.↗