ReDAG-RT: Global Rate-Priority Scheduling for Real-Time Multi-DAG Execution in ROS 2

• URL: http://arxiv.org/abs/2603.18238v1
• Date: Wed, 18 Mar 2026 19:45:58 GMT
• Title: ReDAG-RT: Global Rate-Priority Scheduling for Real-Time Multi-DAG Execution in ROS 2
• Abstract summary: ReDAGRT is a user-space global scheduling framework for deterministic multi-DAG execution in ROS 2.<n>We formalize a multi-DAG task model for ROS 2 callback pipelines and analyze cross-DAG interference under Rate-Priority scheduling.<n>Results show up to 29.7 percent reduction in deadline miss rate, 42.9 percent reduction in 99th percentile response time, and 13.7 percent improvement over MultiThreadedExecutor.
• Score: 0.2981315866322933
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: ROS 2 has become a dominant middleware for robotic systems, where perception, estimation, planning, and control pipelines are structured as directed acyclic graphs of callbacks executed under a shared executor. However, default ROS 2 executors use best-effort dispatch without cross-DAG priority enforcement, leading to callback contention, structural priority inversion, and deadline instability under concurrent workloads. These limitations restrict deployment in time-critical and safety-sensitive cyber-physical systems. This paper presents ReDAGRT, a user-space global scheduling framework for deterministic multi-DAG execution in unmodified ROS 2. The framework introduces a Rate-Priority driven global ready queue that orders callbacks by activation rate, enforces per-DAG concurrency bounds, and mitigates cross-graph priority inversion without modifying the ROS 2 API, executor interface, or underlying operating system scheduler. We formalize a multi-DAG task model for ROS 2 callback pipelines and analyze cross-DAG interference under Rate-Priority scheduling. Response-time recurrences and schedulability conditions are derived within classical Rate-Monotonic theory. Experiments in a ROS 2 Humble environment compare ReDAGRT against SingleThreadedExecutor and MultiThreadedExecutor using synthetic multi-DAG workloads. Results show up to 29.7 percent reduction in deadline miss rate, 42.9 percent reduction in 99th percentile response time, and 13.7 percent improvement over MultiThreadedExecutor under comparable utilization. Asymmetric per-DAG concurrency bounds further reduce interference by 40.8 percent. These results demonstrate that deterministic and analyzable multi-DAG scheduling can be achieved entirely in the ROS 2 user-space execution layer, providing a practical foundation for real-time robotic middleware in safety-critical systems.

Related papers

• Empowering Cross-Domain Sequential Recommendation with Hybrid Tokenization and Serial-Parallel Decoding [63.74998371740272]
  Cross-domain sequential recommendation (CDSR) aims to model users' dynamic interest transitions and sequential patterns across multiple domains.<n>We propose GenCDSR, an effective and efficient generative framework for CDSR.<n>We show that GenCDSR achieves an average accuracy improvement of 1.5 percent and an average inference latency reduction of 85.1 percent compared with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-07-21T08:01:15Z)
• OSDAG: Online Scheduling for Efficient Multi-Robot Collaboration [2.2726869886741383]
  This paper presents OSDAG, a novel framework that integrates LLM-based task reasoning with Directed Acyclic Graph representation and constraint-aware online scheduling.<n> Experiments across five benchmark scenarios demonstrate that OSDAG achieves 5-15x faster reasoning time compared to dialogue-based methods, reduces makespan by up to 38% over sequential baselines, and maintains competitive success rates.
  arXiv  Detail & Related papers  (2026-06-13T11:22:34Z)
• Deterministic Execution of ROS 2 Applications via Lingua Franca [2.2960663045863363]
  The pub-sub pattern in ROS 2 is inherently nondeterministic.<n>We present a framework that is able to run an unmodified ROS 2 application under logical time.<n>We show that the order in which callbacks are executed differs in default ROS 2, while also having end-to-end latencies.
  arXiv  Detail & Related papers  (2026-06-08T08:37:43Z)
• SynerDiff: Synergetic Continuous Batching for Fast and Parallel Diffusion Model Inference [8.251374398589906]
  Existing continuous methods suffer from severe resource contention during UNet-VAE.<n>We propose SynerDiff, an efficient continuous system built on intra-inter level synergy.
  arXiv  Detail & Related papers  (2026-05-09T09:39:39Z)
• DiscreteRTC: Discrete Diffusion Policies are Natural Asynchronous Executors [57.944744187489185]
  We propose DiscreteRTC, which replaces external corrections with native unmasking.<n>DiscreteRTC is simpler to implement with 0 lines of code for async inpainting, faster at inference with only 0.7x computation compared with generating actions from scratch, and better at execution with 50% higher success rate in real-world dynamic pick task compared with flow-based RTC.
  arXiv  Detail & Related papers  (2026-04-27T23:04:03Z)
• Chimera: Latency- and Performance-Aware Multi-agent Serving for Heterogeneous LLMs [62.17306142810532]
  We present Chimera, a predictive scheduling system for multi-agent workflow serving on heterogeneous LLM clusters.<n>Chime traces the best latency, reducing end-to-end latency by 1.2--2.4$times$ and improving task performance by 8.0-9.5 percentage points on average over competitive baselines.
  arXiv  Detail & Related papers  (2026-03-23T17:01:42Z)
• FASTER: Rethinking Real-Time Flow VLAs [82.58822112377923]
  Real-time execution is crucial for deploying Vision-Language-Action (VLA) models in the physical world.<n>We show that reaction time follows a uniform distribution determined jointly by the Time to First Action (TTFA) and the execution horizon.<n>We propose Fast Action Sampling for ImmediaTE Reaction (FASTER) to overcome this issue.
  arXiv  Detail & Related papers  (2026-03-19T17:51:37Z)
• Fixed-Priority and EDF Schedules for ROS2 Graphs on Uniprocessor [2.6048907566358364]
  This paper addresses limitations of current scheduling methods in the Robot Operating System (ROS)2.<n>We propose a novel approach using the events executor to implement fixed-job-level-priority schedulers for arbitrary ROS2 graphs.<n>We show that our implementation generates the same schedules as a conventional fixed-priority DAG task scheduler.
  arXiv  Detail & Related papers  (2025-11-28T15:17:18Z)
• Dependency-Aware Task Offloading in Multi-UAV Assisted Collaborative Mobile Edge Computing [53.88774113545582]
  This paper presents a novel multi-unmanned aerial vehicle (UAV) assisted collaborative mobile edge computing (MEC) framework.<n>It aims to minimize the system cost, and thus realize an improved trade-off between task consumption and energy consumption.<n>We show that the proposed scheme can significantly reduce the system cost, and thus realize an improved trade-off between task consumption and energy consumption.
  arXiv  Detail & Related papers  (2025-10-23T02:55:40Z)
• Open-Vocabulary Spatio-Temporal Scene Graph for Robot Perception and Teleoperation Planning [55.90805559207812]
  In dynamic remote scenes, transmission latency during bidirectional communication creates gaps between remote perceived states and operator intent.<n>We present a representation that enriches open-vocabulary perception with temporal dynamics and lightweight latency annotations.<n>We show that our method achieves 74 percent node accuracy on the Replica benchmark, outperforming Concept.Graph.
  arXiv  Detail & Related papers  (2025-09-27T04:31:24Z)
• A first look at ROS 2 applications written in asynchronous Rust [0.0]
  Existing real-time scheduling and response-time analysis techniques for ROS 2 focus on applications written in C++.<n>We analyze the execution model of R2R -- an asynchronous Rust ROS 2 bindings and various asynchronous runtime Rusts.<n>We propose a structured approach for R2R applications aimed at deterministic real-time operation involving thread prioritization and callback-to-thread mapping schemes.
  arXiv  Detail & Related papers  (2025-05-27T15:21:58Z)
• FusionLLM: A Decentralized LLM Training System on Geo-distributed GPUs with Adaptive Compression [55.992528247880685]
  Decentralized training faces significant challenges regarding system design and efficiency. We present FusionLLM, a decentralized training system designed and implemented for training large deep neural networks (DNNs) We show that our system and method can achieve 1.45 - 9.39x speedup compared to baseline methods while ensuring convergence.
  arXiv  Detail & Related papers  (2024-10-16T16:13:19Z)
• Robust Fully-Asynchronous Methods for Distributed Training over General Architecture [11.480605289411807]
  Perfect synchronization in distributed machine learning problems is inefficient and even impossible due to the existence of latency, package losses and stragglers. We propose Fully-Asynchronous Gradient Tracking method (R-FAST), where each device performs local computation and communication at its own without any form of impact.
  arXiv  Detail & Related papers  (2023-07-21T14:36:40Z)
• A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph [65.70656676650391]
  We consider multiple Automated Guided Vehicles (AGVs) navigating a common workspace to fulfill various intralogistics tasks. One approach is to construct an Action Dependency Graph (ADG) which encodes the ordering of AGVs as they proceed along their routes. If the workspace is shared by dynamic obstacles such as humans or third party robots, AGVs can experience large delays. We present an online method to repeatedly modify acyclic ADG to minimize route completion times of each AGV.
  arXiv  Detail & Related papers  (2020-10-11T14:39:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.