skip to main content


The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, September 29 until 11:59 PM ET on Saturday, September 30 due to maintenance. We apologize for the inconvenience.

Title: A Vector‐Based River Routing Model for Earth System Models: Parallelization and Global Applications

A vector‐river network explicitly uses realistic geometries of river reaches and catchments for spatial discretization in a river model. This enables improving the accuracy of the physical properties of the modeled river system, compared to a gridded river network that has been used in Earth System Models. With a finer‐scale river network, resolving smaller‐scale river reaches, there is a need for efficient methods to route streamflow and its constituents throughout the river network. The purpose of this study is twofold: (1) develop a new method to decompose river networks into hydrologically independent tributary domains, where routing computations can be performed in parallel; and (2) perform global river routing simulations with two global river networks, with different scales, to examine the computational efficiency and the differences in discharge simulations at various temporal scales. The new parallelization method uses a hierarchical decomposition strategy, where each decomposed tributary is further decomposed into many sub‐tributary domains, enabling hybrid parallel computing. This parallelization scheme has excellent computational scaling for the global domain where it is straightforward to distribute computations across many independent river basins. However, parallel computing for a single large basin remains challenging. The global routing experiments show that the scale of the vector‐river network has less impact on the discharge simulations than the runoff input that is generated by the combination of land surface model and meteorological forcing. The scale of vector‐river networks needs to consider the scale of local hydrologic features such as lakes that are to be resolved in the network.

more » « less
Author(s) / Creator(s):
 ;  ;  ;  ;  ;  ;  ;  
Publisher / Repository:
DOI PREFIX: 10.1029
Date Published:
Journal Name:
Journal of Advances in Modeling Earth Systems
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. The DDEC6 method is one of the most accurate and broadly applicable atomic population analysis methods. It works for a broad range of periodic and non-periodic materials with no magnetism, collinear magnetism, and non-collinear magnetism irrespective of the basis set type. First, we show DDEC6 charge partitioning to assign net atomic charges corresponds to solving a series of 14 Lagrangians in order. Then, we provide flow diagrams for overall DDEC6 analysis, spin partitioning, and bond order calculations. We wrote an OpenMP parallelized Fortran code to provide efficient computations. We show that by storing large arrays as shared variables in cache line friendly order, memory requirements are independent of the number of parallel computing cores and false sharing is minimized. We show that both total memory required and the computational time scale linearly with increasing numbers of atoms in the unit cell. Using the presently chosen uniform grids, computational times of ∼9 to 94 seconds per atom were required to perform DDEC6 analysis on a single computing core in an Intel Xeon E5 multi-processor unit. Parallelization efficiencies were usually >50% for computations performed on 2 to 16 cores of a cache coherent node. As examples we study a B-DNA decamer, nickel metal, supercells of hexagonal ice crystals, six X@C 60 endohedral fullerene complexes, a water dimer, a Mn 12 -acetate single molecule magnet exhibiting collinear magnetism, a Fe 4 O 12 N 4 C 40 H 52 single molecule magnet exhibiting non-collinear magnetism, and several spin states of an ozone molecule. Efficient parallel computation was achieved for systems containing as few as one and as many as >8000 atoms in a unit cell. We varied many calculation factors ( e.g. , grid spacing, code design, thread arrangement, etc. ) and report their effects on calculation speed and precision. We make recommendations for excellent performance. 
    more » « less
  2. Abstract

    Stream confluences are ubiquitous interfaces in freshwater networks and serve as junctions of previously independent landscapes. However, few studies have investigated how confluences influence the transport, mixing, and fate of organic matter (OM) and inorganic nutrients at the scale of river networks. To understand how network biogeochemical fluxes may be altered by confluences, we conducted two sampling campaigns at five confluences in summer and fall 2021 spanning the extent of a mixed land use stream network. We sampled the confluence mainstem and tributary reaches as well as throughout the mixing zone downstream. We predicted that biologically reactive solutes would mix non‐conservatively downstream of confluences and that alterations to downstream biogeochemistry would be driven by differences in chemistry and size of the tributary and upstream reaches. In our study, confluences were geomorphically distinct (e.g., wider, deeper, unique erosional, and depositional features) downstream compared to reaches upstream of the confluence. Dissolved OM and nutrients mixed non‐conservatively downstream of the five confluences. Biogeochemical patterns downstream of confluences were only partially explained by contributing reach chemistry and drainage area. We found that the relationship between geomorphic variability, water residence time, and microbial respiration differed between reaches upstream and downstream of confluences. The lack of explanatory power from network‐scale drivers suggests that non‐conservative mixing downstream of confluences may be driven by biogeochemical processes within the confluence mixing zone. The unique geomorphology, non‐conservative biogeochemistry, and ubiquity of confluences highlights a need to account for the distinct functional role of confluences in water resource management in freshwater networks.

    more » « less
  3. We present the first all-optical network, Baldur, to enable power-efficient and high-speed communications in future exascale computing systems. The essence of Baldur is its ability to perform packet routing on-the-fly in the optical domain using an emerging technology called the transistor laser (TL), which presents interesting opportunities and challenges at the system level. Optical packet switching readily eliminates many inefficiencies associated with the crossings between optical and electrical domains. However, TL gates consume high power at the current technology node, which makes TL-based buffering and optical clock recovery impractical. Consequently, we must adopt novel (bufferless and clock-less) architecture and design approaches that are substantially different from those used in current networks. At the architecture level, we support a bufferless design by turning to techniques that have fallen out of favor for current networks. Baldur uses a low-radix, multi-stage network with a simple routing algorithm that drops packets to handle congestion, and we further incorporate path multiplicity and randomness to minimize packet drops. This design also minimizes the number of TL gates needed in each switch. At the logic design level, a non-conventional, length-based data encoding scheme is used to eliminate the need for clock recovery. We thoroughly validate and evaluate Baldur using a circuit simulator and a network simulator. Our results show that Baldur achieves up to 3,000X lower average latency while consuming 3.2X-26.4X less power than various state-of-the art networks under a wide variety of traffic patterns and real workloads, for the scale of 1,024 server nodes. Baldur is also highly scalable, since its power per node stays relatively constant as we increase the network size to over 1 million server nodes, which corresponds to 14.6X-31.0X power improvements compared to state-of-the-art networks at this scale. 
    more » « less
  4. Abstract

    Feedbacks between geomorphic processes and riparian vegetation in river systems are an important control on fluvial morphodynamics and on vegetation composition and distribution. Invasion by nonnative riparian species alters these feedbacks and drives management and restoration along many rivers, highlighting a need for ecogeomorphic models to assist with understanding feedbacks between plants and fluvial processes, and with restoration planning. In this study, we coupled a network‐scale sediment model (Sediment Routing and Floodplain Exchange; SeRFE) that simulates bank erosion and sediment transport in a spatially explicit manner with a recruitment potential analysis for a species of riparian vegetation (Arundo donax) that has invaded river systems and wetlands in Mediterranean climates worldwide. We used the resulting ecogeomorphic framework to understand both network‐scale sediment balances and the spread and recruitment ofA. donaxin the Santa Clara River watershed of Southern California. In the coupled model, we simulated a 1‐year time period during which a 5‐year recurrence interval flood occurred in the mainstem Santa Clara River. Outputs identify key areas acting as sources ofA. donaxrhizomes, which are subsequently transported by flood flows and deposited in reaches downstream. These results were validated in three study reaches, where we assessed postflood geomorphic and vegetation changes. The analysis demonstrates how a coupled model approach is able to highlight basin‐scale ecogeomorphic dynamics in a manner that is useful for restoration planning and prioritization and can be adapted to analogous ecogeomorphic questions in other watersheds.

    more » « less
  5. Chiplet-based architectures have been proposed to scale computing systems for deep neural networks (DNNs). Prior work has shown that for the chiplet-based DNN accelerators, the electrical network connecting the chiplets poses a major challenge to system performance, energy consumption, and scalability. Some emerging interconnect technologies such as silicon photonics can potentially overcome the challenges facing electrical interconnects as photonic interconnects provide high bandwidth density, superior energy efficiency, and ease of implementing broadcast and multicast operations that are prevalent in DNN inference. In this paper, we propose a chiplet-based architecture named SPRINT for DNN inference. SPRINT uses a global buffer to simplify the data transmission between storage and computation, and includes two novel designs: (1) a reconfigurable photonic network that can support diverse communications in DNN inference with minimal implementation cost, and (2) a customized dataflow that exploits the ease of broadcast and multicast feature of photonic interconnects to support highly parallel DNN computations. Simulation studies using ResNet50 DNN model show that SPRINT achieves 46% and 61% execution time and energy consumption reduction, respectively, as compared to other state-of-the-art chiplet-based architectures with electrical or photonic interconnects. 
    more » « less