Skip to content
Open access

A Structure-Aware Hybrid Scheduling Framework for Mixed-Dependency Workflow Scheduling in V2X Testing

Sep 2026 · Algorithms · Vol 19, pp. 753 · 0 citations · 31 references

TL;DR

This paper presents AOE–CP (AON DAG with Edge-Weighted Transformation and Critical Path Scheduling), a structure-aware hybrid scheduling architecture for V2X testing that achieves performance gains through domain-specific structural reorganization rather than new scheduling rules.

Abstract

Efficient workflow scheduling is essential for improving testing efficiency in large-scale Vehicle-to-Everything (V2X) protocol conformance testing. Existing directed acyclic graph (DAG) schedulers treat all test components uniformly, overlooking the inherent structural heterogeneity of V2X workflows which contain mixed independent and precedence-constrained components. This leads to cross-subsystem interference, low resource utilization, and extended makespan. This paper presents AOE–CP (AON DAG with Edge-Weighted Transformation and Critical Path Scheduling), a structure-aware hybrid scheduling architecture for V2X testing. Unlike existing heuristic-based improvements, AOE–CP achieves performance gains through domain-specific structural reorganization rather than new scheduling rules. It integrates three mechanisms: (i) structural decomposition to decouple independent and dependent components and resolve their conflicting optimization objectives; (ii) critical path thread isolation to eliminate cross-subsystem resource competition and guarantee zero critical path waiting time for V2X dominant-topology workflows; (iii) atomic operation-based time estimation supporting fully offline scheduling without runtime profiling overhead. Experiments show that, for large-scale workflow scenarios, AOE–CP reduces normalized makespan by 14–16% and 22–24% compared with HEFT (Heterogeneous Earliest Finish Time) and CPOP (Critical Path On Processor), respectively. Scheduling overhead is only 2.1 ms for 1000-component workflows. AOE-CP reaches makespan saturation with four threads, versus 12 for HEFT and 28 for CPOP, demonstrating superior resource efficiency and scalability. The framework can also be generalized to other mixed-dependency workflow scenarios.

Read PDF

Similar papers

Book Open access Aug 2026

G-STAR: Graph-based Scheduling with Trace-driven Adaptive Routing for Industrial LLM-based Multi-Agent Systems

Large Language Model-based Multi-Agent Systems (LLM-MAS) have shown exceptional promise for complex tasks, including retrieval-augmented generation and autonomous data analytics. However, their deployment in resource-constrained industrial environments faces critical challenges, such as unpredictable end-to-end latency...

Jia-Bao Song, Yun-Sheng Xia, Bei-Bei Kong et al. · 0 citations
Review 2026

The Systems Architecture of LLM Multi-Agent Systems: Routing, Memory, and Resource Optimisation

This survey presents a systematic taxonomy and technical review of dynamic orchestration strategies designed to address communication overhead, KV cache management challenges, and increased token consumption within large Language Model-based Multi-Agent Systems.

Heet Nagoriya, H. Raithatha · 0 citations
Open access Sep 2026

An Integrated Qos Dependency Aware and Multi Objective Metaheuristic Framework For Cloud Task Scheduling

Cloud task scheduling involves heterogeneous virtual machines, differentiated service requirements, workflow precedence constraints, and competing time, energy, cost, and utilization objectives. We propose an integrated three-model framework. QTSF clusters independent tasks using normalized service and resource attribu...

M. Rupasri, G. P. S. Varma, H. Indukuri · 0 citations
Sep 2026

LLM4ETS: Self‐Evolving Algorithm Design for Edge Task Scheduling via Large Language Models

With the rapid proliferation of 5G and the Internet of Things, ensuring low latency in edge computing has become crucial for real‐time processing applications. However, existing task scheduling approaches often struggle to balance multiple optimization objectives effectively due to manual parameter tuning and slo...

Yu-Qi Zhao, Shen-Dong Gao, Ya-Tong Wang et al. · 0 citations
Preprint Sep 2026

Latency-Aware Orchestration for Multi-Agent LLM Workflows on Heterogeneous GPUs

Concurrent multi-agent workflows expose future dependencies and serving-state requirements while running on heterogeneous GPU pools with time-varying load, model residency, and resource availability. The logical workflow defines the required computation, whereas its physical scheduling units, model-lifecycle actions, r...

Jing-Hao Wang, Yi-Feng Zhang, Xiao Zhou et al. · 0 citations
Preprint Aug 2026

TOPAS: Workflow-Aware Prefix-State Scheduling for Multi-Agent LLM Serving

A Task-Oriented Prefix-Aware Scheduler that jointly decides which agent prefixes to keep in the cache and which requests to schedule for execution and scores candidate post-decision states by trading off the expected reduction in each task's longest remaining service path against the near-term benefit of downstream pre...

Hongqiu Ni, Han Tian, Chi Zhang et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.