DnUp Routing Algorithm Description
A brief description of the DnUp Infiniband Routing Algorithm.
99 GENERAL AND MISCELLANEOUS↗
SEARCH · Engineering Papers
Results for “Routing algorithm”
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.
A multi criteria analog model for assessing the vulnerability of rural catchments to road spills of hazardous substances
Road spills of hazardous substances are common in developing countries due to increasing industrialization and traffic accidents, and represent a serious threat to soils and water in catchments. There is abundant literature on equations describing the wash-off of pollutants from roads during a storm event and there are a number of watershed models incorporating those equations in storm water quality algorithms that route runoff and pollution yields through a drainage system towards the catchment outlet. However, methods describing catchment vulnerability to contamination by road spills based solely on biophysical parameters are scarce. These methods could be particularly attractive to managers because they can operate with a limited amount of easily collectable data, while still being able to provide important insights on the areas more prone to contamination within the studied watershed. The purpose of this paper was then to contribute with a new vulnerability model. To accomplish the goal, a selection of medium properties appearing in wash-off equations and routing algorithms were assembled and processed in a parametric framework based on multi criteria analysis to define the watershed vulnerability. However, parameters had to be adapted because wash-off equations and water quality models have been developed to operate primarily in the urban environment while the vulnerability model is meant to run in rural watersheds. The selected parameters were hillside slope, ground roughness (depending on land use), soil permeability (depending on soil type), distance to water courses and stream density. The vulnerability model is a spatially distributed algorithm that was prepared to run under the IDRISI Selva software, a GIS platform capable of handling spatial and alphanumeric data and execute the necessary terrain model, hydrographic and thematic analyses. For illustrative purposes, the vulnerability model was applied to the legally protected Environmental Protection Area (APA), located in the Uberaba region, state of Minas Gerais, Brazil. In this region, the risk of accidents causing chemical spills is preoccupying because large quantities of dangerous materials are transported in two important distribution highways while the APA is fundamental for the protection of water resources, the riverine ecosystems and remnants of native vegetation. In some tested scenarios, model results show 60% of vulnerable areas within the studied area. The most sensitive parameter to vulnerability is soil type. To prevent soils from contamination, specific measures were proposed involving minimization of land use conflicts that would presumably raise the soil's organic matter and in the sequel restore the soil's structural functions. Additionally, the present study proposed the preservation and reinforcement of riparian forests as one measure to protect the quality of surface water. - Highlights: • A multi criteria analog model was developed to assess rural catchment vulnerability along roads. • Model parameters were defined by analogy with urban wash-off equations and routing algorithms. • The model mixes up various biophysical and socio-economic parameters. • Model application was based on a scenario analysis. • The study is focused on the Environmental Protection Area of Uberaba River, Brazil.
54 ENVIRONMENTAL SCIENCES↗
Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms
Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.
42 ENGINEERING↗
Mass imbalances in EPANET water-quality simulations
EPANET is widely employed to simulate water quality in water distribution systems. However, in general, the time-driven simulation approach used to determine concentrations of water-quality constituents provides accurate results only for short water-quality time steps. Overly long time steps can yield errors in concentration estimates and can result in situations in which constituent mass is not conserved. The use of a time step that is sufficiently short to avoid these problems may not always be feasible. The absence of EPANET errors or warnings does not ensure conservation of mass. This paper provides examples illustrating mass imbalances and explains how such imbalances can occur because of fundamental limitations in the water-quality routing algorithm used in EPANET. In general, these limitations cannot be overcome by the use of improved water-quality modeling practices. This paper also presents a preliminary event-driven approach that conserves mass with a water-quality time step that is as long as the hydraulic time step. Results obtained using the current approach converge, or tend to converge, toward those obtained using the preliminary event-driven approach as the water-quality time step decreases. Improving the water-quality routing algorithm used in EPANET could eliminate mass imbalances and related errors in estimated concentrations. Furthermore, the results presented in this paper should be of value to those who perform water-quality simulations using EPANET or use the results of such simulations, including utility managers and engineers.
54 ENVIRONMENTAL SCIENCES↗
Transportation Modeling and Global Health
A patient in the United States has been diagnosed with Ebola. Fear and panic kicks in across the country, and hospitals are inundated with hundreds of people, some infected with the highly contagious disease and others not. Blood tests are needed for positive diagnoses, but the diagnostic labs are overwhelmed with blood samples to test, and staff are overworked and stressed. Infected people need to be quarantined and treated, but it's hard to find rooms to quarantine so many patients. Sick people who need triage and regular care for other emergencies are afraid to go to hospitals for fear of Ebola, which has a 50% fatality rate. And since hospitals are so overwhelmed, sick people often stay home, infecting heathy people around them; the U.S. is now in the grips a full-blown Ebola outbreak. Sandia's high-performance computers simulated such a nightmare scenario recently, and with good reason. An Ebola outbreak in the United States could be devastating if hospitals are not prepared. When an Ebola outbreak in West Africa became a global concern in 2014, health advisers were alarmed at the length of time it took to properly diagnose infected people. In rural areas in Liberia, for example, blood samples from ailing people would be sent to a laboratory for testing, but the closest lab was hundreds of miles away through difficult and sometimes impassable roads. In more urban areas, blood samples would be sent to nearby labs, but those labs were often already overburdened by the sheer volume of samples to test. Staff at some treatment centers were unaware that a lab a little farther away might have the capacity to take in more samples. Meanwhile, undiagnosed infected people were unknowingly spreading the disease to many others around them, worsening the outbreak. The U.S. Defense Threat Reduction Agency (DTRA) and Centers for Disease Control and Prevention (CDC) posed a serious question: how do we improve blood-sample transportation routes in Liberia to ensure that samples taken from ill people are tested as quickly as possible, ensuring a proper diagnosis and faster treatment? Sandia scientists, already experts in transportation modeling for nuclear materials, quickly swarmed on this problem. The Sandia Ebola response team immediately set out to collect data from the region using available maps and local information, and transformed the raw data to GIS maps. Then, applying Sandia transportation routing algorithms, the team identified the optimal routes to get blood samples to the best laboratory for testing, even if that lab was not geographically the closest. The models also showed the best possible locations for mobile diagnostic laboratories that would better support the very rural regions that were most affected by the Ebola outbreak.
59 BASIC BIOLOGICAL SCIENCES↗
Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles
This paper develops a multi-objective eco-routing algorithm (eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared with highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single-objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,”“moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared with the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.
Engineering↗
Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles.
This paper develops a multi-objective eco-routing algorithm (combined eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Eco-routing is a technique that finds the most energy efficient route. ICEV and BEV energy consumption patterns are significantly different with regard to their sensitivity to driving cycles. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared to highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce the BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,” “moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared to the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Data Informed Vehicle Trip Energy Estimation [SWR-17-30]
There is a need to accurately estimate trip energy consumption for vehicle trips where high resolution GPS data is not available, or where the trips are simply proposed and have not been driven. This need is most apparent in green routing algorithms, it is critical to accurately estimate the energy consumption for a route that has not been driven. The Data Informed Energy Estimation Software addresses this need by identifying the driving and roadway attributes most impactful on fuel consumption, and using large amounts of high resolution GPS data from real world driving to determine the average fuel consumption for all combinations of attributes. These attributes can include traffic conditions, vehicle speed, and road gradient among others. This aggregation technique results in a lookup table that provides energy consumption values for combinations of road and driving techniques. This lookup table is an extremely lightweight and versatile result that can be applied in a number of applications.
Holden, Jacob↗
Near-optimal routing of noisy quantum states
Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.
Sadlier III, Ronald↗
Route Energy Prediction (RouteE) Powertrain Validation Report
The National Renewable Energy Laboratory's flagship package in the RouteE suite, RouteE-Powertrain, is a mesoscopic energy model that predicts vehicle energy consumption given discrete attributes that describe each segment or link in a vehicle's path on a road network. High-frequency, physics-based, powertrain simulators, such as NREL's FASTSim, are well-suited to model vehicle energy consumption when real driving data and a detailed understanding of the vehicle powertrain specifications are available. However, there are a variety of situations in the past, present (real-time), and future where high-frequency driving data and/or vehicle information may not be available, but reliable energy consumption is still desired, such as energy-aware vehicle routing. These are the ideal applications for RouteE-Powertrain. The suite of RouteE tools also includes RouteE-Compass, which is an eco-routing software that incorporates energy consumption into network routing algorithms, and RouteE-Mobile, which is a prototype smartphone navigation app to demonstrate the integrated capabilities of the RouteE suite for real-world eco-routing. The focus of this validation report is to share key metrics about the data sets and models behind RouteE-Powertrain. The set of RouteE-Powertrain models discussed in this report are made available through the RouteE web API through the NREL Developer Network.
33 ADVANCED PROPULSION SYSTEMS↗
HipBone: A performance-portable graphics processing unit-accelerated C++ version of the NekBone benchmark
We present hipBone, an open-source performance-portable proxy application for the Nek5000 (and NekRS) computational fluid dynamics applications. HipBone is a fully GPU-accelerated C++ implementation of the original NekBone CPU proxy application with several novel algorithmic and implementation improvements which optimize its performance on modern fine-grain parallel GPU accelerators. Our optimizations include a conversion to store the degrees of freedom of the problem in assembled form in order to reduce the amount of data moved during the main iteration and a portable implementation of the main Poisson operator kernel. We demonstrate near-roofline performance of the operator kernel on three different modern GPU accelerators from two different vendors. We present a novel algorithm for splitting the application of the Poisson operator on GPUs which aggressively hides MPI communication required for both halo exchange and assembly. Our implementation of nearest-neighbor MPI communication then leverages several different routing algorithms and GPU-Direct RDMA capabilities, when available, which improves scalability of the benchmark. We demonstrate the performance of hipBone on three different clusters housed at Oak Ridge National Laboratory, namely, the Summit supercomputer and the Frontier early-access clusters, Spock and Crusher. Our tests demonstrate both portability across different clusters and very good scaling efficiency, especially on large problems.
Computer Science↗
Energy Impact of Connected and Automated Vehicle Technologies. Final report
The overarching goal of this project is to understand the potential impact of connected and automated vehicles. The goal was achieved through data collection, model development, algorithm designs, simulations, and limited field tests. The main outcomes from this project include: (1) we collected energy consumption and GPS data from 500 vehicles over one year, with a total mileage of 8 million miles; (2) Based on the collected data and other datasets collected at the University of Michigan, we developed a calibrated Ann Arbor model in Polaris (model developed by ANL), and the fuel economy accuracy was found to be around 3.9% by comparison with field collected data; (3) An open-source SUMO model of Ann Arbor was developed; (4) Eco-Routing algorithms in Ann Arbor using the SUMO model shows 6% fuel saving potential; (5) Experiments conducted at the Mcity test facility shows that human drivers roughly follow the Eco-driving suggestions roughly 70% of the time; (6) Based in the Ann Arbor travel patterns, we found that each shared automated vehicle can replace around 4 individually owned vehicles; and (7) Adaptive Traffic Signal Control Algorithm developed through this project has been validated both in simulations and preliminary test results. For connected and automated vehicles, on average the performance is 13% delay reduction, and 10% fuel reduction. While connected and automated vehicles are in their early stage of deployment, the results from this project confirm that there is significant potential for energy saving if the technologies are developed and used properly. The three main technologies studied in this project include eco-routing, shared autonomous rides, and adaptive traffic signal controls. The data collected and model developed through the project can be used to study many other connected and automated vehicle technologies.
02 PETROLEUM↗
Transatlantic flight times and climate change
Aircraft do not fly through a vacuum, but through an atmosphere whose meteorological characteristics are changing because of global warming. The impacts of aviation on climate change have long been recognised, but the impacts of climate change on aviation have only recently begun to emerge. These impacts include intensified turbulence and increased take-off weight restrictions. We investigate the influence of climate change on flight routes and journey times. We feed synthetic atmospheric wind fields generated from climate model simulations into a routing algorithm of the type used operationally by flight planners. We focus on transatlantic flights between London and New York, and how they change when the atmospheric concentration of carbon dioxide is doubled. We find that a strengthening of the prevailing jet-stream winds causes eastbound flights to significantly shorten and westbound flights to significantly lengthen in all seasons. Eastbound and westbound crossings in winter become approximately twice as likely to take under 5 h 20 min and over 7 h 00 min, respectively. Furthermore, for reasons that are explained using a conceptual model, the eastbound shortening and westbound lengthening do not cancel out, causing round-trip journey times to increase. Even assuming no future growth in aviation, the extrapolation of our results to all transatlantic traffic suggests that aircraft will collectively be airborne for an extra 2000 h each year, burning an extra 7.2 million gallons of jet fuel at a cost of US$ 22 million, and emitting an extra 70 million kg of carbon dioxide, which is equivalent to the annual emissions of 7100 average British homes. These results provide further evidence of the two-way interaction between aviation and climate change.
54 ENVIRONMENTAL SCIENCES↗
Graph Analytics on Jellyfish topology
Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.
Graph Analytics, network topology, interconnect, H↗
Model Based Validation of Intelligent Powertrain Strategies for Connected and Automated Vehicles
Systems incorporating Vehicle to Everything (V2X) and conventional cellular based communication in vehicles can significantly help improve energy consumption via a combination of intelligent powertrain control strategies, smarter routing algorithms and driving in such a way as to minimize fuel economy and the emission of carbon dioxide, known as "eco-driving." In projects led by the Southwest Research Institute (SwRI), large-scale traffic simulations are created to model real-world scenarios with dynamic behavior that is reactive to imposed changes. Coupled with high fidelity powertrain models, the closed loop framework enables research and development of such Connected and Automated Vehicle (CAV) enabled technologies at scale. This paper will discuss a traffic system simulation environment that was built based on the High Street urban corridor in Columbus, Ohio. Eco-driving strategies were tested at scale on a variety of powertrain platforms – internal combustion engines, hybrid electric and fully electric vehicles. Furthermore, the paper will focus on hybrid electric powertrain modeling along with details on how the powertrain model was leveraged to develop a sophisticated clustering scheme to help down-select speed traces from large scale simulation studies for validation on vehicle dynamometer. Nominal energy consumption improvement around 12% was observed with good match between simulation studies and vehicle testing.
33 ADVANCED PROPULSION SYSTEMS↗
funcX: Federated Function as a Service for Science
Here, funcX is a distributed function as a service (FaaS) platform that enables flexible, scalable, and high performance remote function execution. Unlike centralized FaaS systems, funcX decouples the cloud-hosted management functionality from the edge-hosted execution functionality. funcX's endpoint software can be deployed, by users or administrators, on arbitrary laptops, clouds, clusters, and supercomputers, in effect turning them into function serving systems. funcX's cloud-hosted service provides a single location for registering, sharing, and managing both functions and endpoints. It allows for transparent, secure, and reliable function execution across the federated ecosystem of endpoints-enabling users to route functions to endpoints based on specific needs. funcX uses containers (e.g., Docker, Singularity, and Shifter) to provide common execution environments across endpoints. funcX implements various container management strategies to execute functions with high performance and efficiency on diverse funcX endpoints. funcX also integrates with an in-memory data store and Globus for managing data that may span endpoints. We motivate the need for funcX, present our prototype design and implementation, and demonstrate, via experiments on two supercomputers, that funcX can scale to more than 130000 concurrent workers. We show that funcX's container warming-aware routing algorithm can reduce the completion time for 3,000 functions by up to 61% compared to a randomized algorithm and the in-memory data store can speed up data transfers by up to 3x compared to a shared file system.
97 MATHEMATICS AND COMPUTING↗
A Multi-Criteria Approach to Camera Motion Design for Volume Data Animation
We present an integrated camera motion design and path generation system for building volume data animations. Creating animations is an essential task in presenting complex scientific visualizations. Existing visualization systems use an established animation function based on keyframes selected by the user. This approach is limited in providing the optimal in-between views of the data. Alternatively, computer graphics and virtual reality camera motion planning is frequently focused on collision free movement in a virtual walkthrough. For semi-transparent, fuzzy, or blobby volume data the collision free objective becomes insufficient. Here, we provide a set of essential criteria focused on computing camera paths to establish effective animations of volume data. Our dynamic multi-criteria solver coupled with a force-directed routing algorithm enables rapid generation of camera paths. Once users review the resulting animation and evaluate the camera motion, they are able to determine how each criterion impacts path generation. In this paper, we demonstrate how incorporating this animation approach with an interactive volume visualization system reduces the effort in creating context-aware and coherent animations. This frees the user to focus on visualization tasks with the objective of gaining additional insight from the volume data.
42 ENGINEERING↗
Routing and Infrastructure simulation for Shared Electric vehicles (RISE)
FERIS is an agent-based model that simulates the activity of a fleet of electric taxis in a metropolitan area. Agent activities include serving trips, rebalancing to anticipate future demand, and relocating to charge. The modeling framework allows researchers to study the impact of different routing algorithms, battery range, and charging infrastructure on fleet performance, energy consumption, environmental impact, and cost of service.
Bauer, Gordon↗