Search NASA⌕ Search

SEARCH · Search NASA

Results for “traffic optimization”

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.

340 records · Page 19

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↗

Experiments and Analyses of Data Transfers Over Wide-Area Dedicated Connections

Dedicated wide-area network connections are increasingly employed in high-performance computing and big data scenarios. One might expect the performance and dynamics of data transfers over such connections to be easy to analyze due to the lack of competing traffic. However, non-linear transport dynamics and end-system complexities (e.g., multi-core hosts and distributed filesystems) can in fact make analysis surprisingly challenging. We present extensive measurements of memory-to-memory and disk-to-disk file transfers over 10 Gbps physical and emulated connections with 0–366 ms round trip times (RTTs). For memory-to-memory transfers, profiles of both TCP and UDT throughput as a function of RTT show concave and convex regions; large buffer sizes and more parallel flows lead to wider concave regions, which are highly desirable. TCP and UDT both also display complex throughput dynamics, as indicated by their Poincare maps and Lyapunov exponents. For disk-to-disk transfers, we determine that high throughput can be achieved via a combination of parallel I/O threads, parallel network threads, and direct I/O mode. Our measurements also show that Lustre filesystems can be mounted over long-haul connections using LNet routers, although challenges remain in jointly optimizing file I/O and transport method parameters to achieve peak throughput.

Rao, Nageswara S.↗

Human-Machine Shared Control for Path Following Considering Driver Fatigue Characteristics

Fatigue driving has been regarded as one of the most important factors that cause traffic accidents. This paper proposes a robust human-machine shared control strategy to improve the vehicle performance for different driver fatigue states. Firstly, the time-varying driver steering model is proposed to address the model mismatch caused by fatigue driving. And the driver fatigue evaluation system is established based on facial features to quantify driver fatigue levels. Based on the quantified fatigue levels, a novel strategy for allocating authorities of the driver and controller is developed for building the driver-vehicle interaction system. Then, to weaken the influence of parameter perturbations caused by the time-varying driver states, we design a fatigue-based shared controller through state feedback. The actuator saturation and system constraints are considered in the controller design through the robust set-invariance property to improve vehicle safety and driving comfort. The driver-in-the-loop platform is conducted to validate the effectiveness of the proposed shared steering controller. In conclusion, the experimental results show that the proposed strategy can adaptively optimize the human-machine authorities according to fatigue states and comprehensively improve vehicle performance.

97 MATHEMATICS AND COMPUTING↗

Allocating limited deicing resources in winter snow events

As the number and severity of snowfall events continue to grow, the need to direct road maintenance intelligently during these snowfall events will also grow. In several locations, local governments lack the resources to treat all roadways completely during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming (MIP) formulation to allocate resources to manage snowfall on roads using meteorological, geographical, and environmental parameters. Furthermore, given that MIPs often scale poorly with problem size, we also present a constructive heuristic designed for the problem. Finally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.

97 MATHEMATICS AND COMPUTING↗

Scaling and Quality of Modularity Optimization Methods for Graph Clustering

Real-world graphs exhibit structures known as “communities” or “clusters” consisting of a group of vertices with relatively high connectivity between them, as compared to the rest of the vertices in the network. Graph clustering or community detection is a fundamental graph operation used to analyze real-world graphs occurring in the areas of computational biology, cybersecurity, electrical grids, etc. Similar to other graph algorithms, owing to irregular memory accesses and inherently sequential nature, current algorithms for community detection are challenging to parallelize. However, in order to analyze large networks, it is important to develop scalable parallel implementations of graph clustering that are capable of exploiting the architectural features of modern supercomputers. In response to the 2019 Streaming Graph Challenge, we present quality and performance analysis of our distributed- memory community detection using Vite, which is our distributed memory implementation of the popular Louvain method, on the ALCF Theta supercomputer. Clustering methods such as Louvain that rely on modularity maximization are known to suffer from the resolution limit problem, preventing identification of clusters of certain sizes. Hence, we also include quality analysis of our shared-memory implementation of the Fast-tracking Resistance method, in comparison with Louvain on the challenge datasets. Furthermore, we introduce an edge-balanced graph distribution for our distributed memory implementation, that significantly reduces communication, offering up to 80% improvement in the overall execution time. In addition to performance/quality analysis, we also include details on the power/energy consumption, and memory traffic of the distributed-memory clustering implementation using real-world graphs with over a billion edges.

Ghosh, Sayan↗

Modeling and dynamical topology properties of VANET based on complex networks theory

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

36 MATERIALS SCIENCE↗

Human Factors and Technologies Design to Improve User Acceptance of Pooled Rideshare for Increasing Transportation System Energy Efficiency

This multi-year project delivered a comprehensive, human-factors-driven framework to understand, model, and improve pooled rideshare (PR) adoption in the United States. Through three large-scale national survey studies involving more than 16,000 participants across multiple cities and demographic groups, the research established one of the most extensive datasets to date on user perceptions, behavioral barriers, and service expectations related to pooled rideshare. These data revealed key human factors barriers of user acceptance of PR and suggested potential actionable experience optimizations that could lead to increased PR usage. This foundational knowledge guided the development of novel human-factors models and behavioral choice models that quantify how psychological, demographic, and trip-level factors influence willingness to pool. Building on these empirical insights, the project developed advanced behavioral modeling tools, including mixed logit and integrated choice and latent variable models, to capture both observable and latent influences on PR adoption. These models significantly improved the ability to predict riders’ acceptance of pooled trips, explaining choice heterogeneity through latent constructs such as safety, service experience, privacy concerns, time sensitivity, and environmental attitudes. Together, these models provide a robust analytical foundation for designing PR systems that more effectively meet user needs. The project translated human-factors insights and behavioral models into actionable technology innovations by extending POLARIS—an agent-based, activity-based travel simulation platform—into a fully functional pooled rideshare simulation environment. New PR modules, acceptance models, and regional scenarios were implemented for Greenville, SC and Austin, TX, enabling high-fidelity validation of algorithmic strategies under realistic demand and traffic conditions. The simulation platform supported the development and evaluation of adaptive discount-based assignment algorithms, enhanced willingness-to-pay formulations, demographic-aware incentive mechanisms, and a proactive joint assignment and repositioning strategy. Simulation results demonstrated substantial gains in pooling uptake, average vehicle occupancy, energy efficiency, and fleet profitability. In Greenville, pooling adoption more than doubled, while reductions in vehicle-miles traveled and energy consumption were significant. In Austin, pooling improvements were achieved with minimal service-quality trade-offs, and profitability increased across all fleet sizes. Through this research, we developed a comprehensive understanding of the human factors barriers that limit user acceptance of pooled rideshare services. These insights enabled the design of human-factors-aware pooled rideshare technologies that more effectively address user concerns and improve adoption rates. By integrating these models into an advanced agent-based simulation framework, we demonstrated that higher adoption of pooled rideshare can lead to measurable improvements in energy efficiency and system performance. Together, these contributions establish a validated pathway from human-centered analysis to technology development and energy-saving outcomes, supporting national goals for more sustainable and efficient mobility systems.

Jia, Yunyi↗

Neuroevolution Application to Collaborative and Heuristics-Based Connected and Autonomous Vehicle Cohort Simulation at Uncontrolled Intersection

Artificial intelligence is gaining tremendous attractiveness and showing great success in solving various problems, such as simplifying optimal control derivation. This work focuses on the application of Neuroevolution to the control of Connected and Autonomous Vehicle (CAV) cohorts operating at uncontrolled intersections. The proposed method implementation’s simplicity, thanks to the inclusion of heuristics and effective real-time performance are demonstrated. The resulting architecture achieves nearly ideal operating conditions in keeping the average speeds close to the speed limit. It achieves twice as high mean speed throughput as a controlled intersection, hence enabling lower travel time and mitigating energy inefficiencies from stop-and-go vehicle dynamics. Low deviation from the road speed limit is hence continuously sustained for cohorts of at most 50 m long. This limitation can be mitigated with additional lanes that the cohorts can split into. The concept also allows the testing and implementation of fast-turning lanes by simply replicating and reconnecting the control architecture at each new road crossing, enabling high scalability for complex road network analysis. The controller is also successfully validated within a high-fidelity vehicle dynamic environment, showing its potential for driverless vehicle control in addition to offering a new traffic control simulation model for future autonomous operation studies.

Jacquelin, Frederic (ORCID:0000000183154344)↗

Polar Ocean Observations: A Critical Gap in the Observing System and Its Effect on Environmental Predictions From Hours to a Season

There is a growing need for operational oceanographic predictions in both the Arctic and Antarctic polar regions. In the former, this is driven by a declining ice cover accompanied by an increase in maritime traffic and exploitation of marine resources. Oceanographic predictions in the Antarctic are also important, both to support Antarctic operations and also to help elucidate processes governing sea ice and ice shelf stability. However, a significant gap exists in the ocean observing system in polar regions, compared to most areas of the global ocean, hindering the reliability of ocean and sea ice forecasts. This gap can also be seen from the spread in ocean and sea ice reanalyses for polar regions which provide an estimate of their uncertainty. The reduced reliability of polar predictions may affect the quality of various applications including search and rescue, coupling with numerical weather and seasonal predictions, historical reconstructions (reanalysis), aquaculture and environmental management including environmental emergency response. Here, we outline the status of existing near-real time ocean observational efforts in polar regions, discuss gaps, and explore perspectives for the future. Specific recommendations include a renewed call for open access to data, especially real-time data, as a critical capability for improved sea ice and weather forecasting and other environmental prediction needs. Dedicated efforts are also needed to make use of additional observations made as part of the Year of Polar Prediction (YOPP; 2017– 2019) to inform optimal observing system design. To provide a polar extension to the Argo network, it is recommended that a network of ice-borne sea ice and upper-ocean observing buoys be deployed and supported operationally in ice-covered areas together with autonomous profiling floats and gliders (potentially with ice detection capability) in seasonally ice covered seas. Finally, additional efforts to better measure and parameterize surface exchanges in polar regions are much needed to improve coupled environmental prediction.

54 ENVIRONMENTAL SCIENCES↗

Audi e-tron Green Light Optimized Speed Advisory On-Road Data

To aid researchers in studying the capabilities and benefits of vehicle-to-infrastructure communication, Argonne National Laboratory collected a robust set of on-road driving data of the Audi Green Light Optimized Speed Advisory (GLOSA) system implemented in the e-tron battery electric vehicle. This dataset includes 33 tests, each roughly 27 miles in length and roughly 45 to 75 minutes in duration. The team selected Kane County Highway Route 34 from Main Street in Batavia, Illinois to Middlecreek Lane in St. Charles, Illinois as the route do to its high density of GLOSA-active lights and the most opportunities to observe the system per hour of test time. The data include parameters from the following sources: GLOSA system driving the dash indicators, multiple powertrain parameters including real-time battery power/energy consumption, GPS, front radar gap, and rear radar gap. ![audio-e-tron image](audi-e-tron.jpg)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Open-Source Data for MAC-POSTS: Mobility Data Analytics Center - Prediction, Optimization, and Simulation Toolkit for Transportation Systems

MAC-POSTS (Mobility Data Analytics Center - Prediction, Optimization, and Simulation toolkit for Transportation Systems) is a toolkit for dynamic transportation network modeling. Developed by the Mobility Data Analytics Center (MAC) at Carnegie Mellon University, this package implements many classic dynamic transportation network models, as well as new models proposed by MAC members. It has served as one building block for many other models and research projects. As such, this package used to be treated as an internal research project of the MAC lab, and admittedly, the code base is messy, and the interface is hard to use. However, we are working hard to make it a generally usable and useful toolkit for dynamic transportation network modeling. We would really appreciate any feedback, comments, suggestions, or criticisms.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are continuously thrashed, they should be retrieved from the system memory and the procedure is slowed down by the increased latency. Efficient implementations of string matching algorithms have been the fo- cus of several works, targeting Field Programmable Gate Arrays [4, 25, 15, 5], highly multi-threaded solutions like the Cray XMT [34], multicore proces- sors [19] or heterogeneous processors like the Cell Broadband Engine [35, 22]. Recently, several researchers have also started to investigate the use Graphic Processing Units (GPUs) for string matching algorithms in security applica- tions [20, 10, 32, 33]. Most of these approaches mainly focus on reaching high peak performance, or try to optimize the memory occupation, rather than looking at performance stability. However, hardware solutions supports only small dictionary sizes due to lack of memory and are difficult to customize, while platforms such as the Cell/B.E. are very complex to program.

Tumeo, Antonino↗

Lessons learnt from post EIS evaluations of national road schemes in Ireland

The Irish National Roads Authority (NRA) recently completed over twenty post environmental impact assessment evaluations of noise chapters prepared as part of Environmental Impact Statements (EISs) for new national road schemes in Ireland. The study focused on a range of issues including a review of noise monitoring procedures, noise prediction methodologies and an assessment of the effectiveness of noise mitigation measures currently in use on national road schemes. This review was carried out taking cognisance of best international practices for noise assessment and methodologies used to mitigate road traffic noise. The primary focus of the study was to assess the actual noise impacts of national road scheme developments and to revise, where necessary, methodologies recommended in the current NRA guidance document describing the treatment of noise on national road schemes. This paper presents a summary of the study and identifies a number of key areas that should be considered prior to the development of future guidance documents. - Highlights: Black-Right-Pointing-Pointer Presents a post-EIS evaluation of noise assessments for national roads in Ireland. Black-Right-Pointing-Pointer The effectiveness of some noise mitigation measures is critically evaluated. Black-Right-Pointing-Pointer Issues related to the current EIS noise assessment methodologies are discussed. Black-Right-Pointing-Pointer Implications for alterations to the NRA noise guidelines.

54 ENVIRONMENTAL SCIENCES↗

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗

SDN-NGenIA, a Software Defined Next Generation Integrated Architecture for HEP and Data Intensive Science

This project aims to enable the LHC and other leading programs in high energy physics and other global science domains funded by the DOE to operate with a new level of efficiency and control, through the development of a Next Generation Integrated Architecture (NGenIA) based on intelligent software defined network (SDN)-driven network systems coupled to high throughput applications. While the initial focus is on the challenging LHC use case, the systems and products being developed are general, and apply to many fields of data intensive science ranging from astrophysical sky surveys to bioinformatics and earth observation, as well as other organizations facing the challenges of extracting knowledge from distributed multi-petabyte data stores. A central concept in this development program is a new paradigm ‘consistent network operations’ among widely distributed computing and storage facilities, where stable high throughput flows, at set rates, cross load-balanced network paths, up to flexible high water marks that are adjusted in real time to accommodate other network traffic. The large smooth flows are launched and managed by SDN services that act in concert with the experiments’ site-resident data distribution and management systems, to meet the expanding needs of the science programs. The technical goals include the construction of autonomous, intelligent site-resident services that interact dynamically with network-resident services, and with the science programs’ principal data distribution and management tools, to request or command network resources in support of high throughput petascale to exascale workflow Specific work items include: 1. Developing compact Data Transfer Nodes (DTNs) with auto-tuning functions that support data transfer rates in the 100 Gbps to the 1 Tbps range when used with high throughput data transfer applications 2. Deep site orchestration among virtualized clusters, storage subsystems and subnets to successfully coschedule CPU, storage and network resources 3. Science-program designed site architectures, operational modes, and policy and resource usage priorities, adjudicated across multiple network domains and virtual organizations, using the orchestration functions and methods 4. Seamlessly extending end-to-end operation across both extra-site and intra-site boundaries through the use of Open vSwitch (OVS), FireQoS + next generation Science DMZs 5. Novel methods of system integration that enable granular control of extreme scale long distance transfers through flow matching of scattered source-destination address pairs to multi-domain dynamic circuits 6. Funneling massive sets of streams to DTNs at the site edge hosting petascale buffer pools configured for flows of 100 Gbps and up, exploiting state of the art data transfers 7. Adaptive scheduling based on pervasive end-to-end monitoring, including DTN or compute-node resident agents providing comprehensive end-system profiling 8. Developing unsupervised and supervised machine learning and modeling methods to optimize the workflow involving terabyte to multi-petabyte datasets.

47 OTHER INSTRUMENTATION↗

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗