Skip to content

Bridging Stochastic Interference and Deterministic Scheduling: An Automated Design Framework for Heterogeneous Embedded Systems

2026 · IEEE Transactions on Automation Science and Engineering · Vol 23, pp. 12754-12768 · 0 citations · 44 references
Computer Science

Abstract

The automated design of heterogeneous embedded systems faces a fundamental challenge: bridging the gap between stochastic latency induced by resource contention and the deterministic requirements of real-time constraints. To address this, we propose a Hybrid Stochastic-Deterministic Modeling framework for contention-aware performance inference. This framework integrates queuing-theoretic analysis with deterministic schedulability verification, providing accurate end-to-end latency prediction under uncertain workloads. Building on this analytical foundation, we develop a Dual Evolutionary Path Resource Mapping (DEP-RM) algorithm. This method decouples the optimization process into structural exploration and mapping refinement, effectively resolving the conflict between global architectural diversity and local scheduling precision through an adaptive interaction mechanism. Experimental evaluations on a physical heterogeneous embedded platform demonstrate that the proposed framework achieves a prediction deviation of less than 5.6% compared to actual measurements, while the optimization algorithm reduces the global system execution time by approximately 40.7% against baseline designs. Note to Practitioners—This paper is motivated by the increasing difficulty of deploying complex real-time applications onto heterogeneous embedded platforms. In practical engineering, ensuring timing reliability is challenging because resource contention (such as shared memory conflicts) introduces unpredictable delays that traditional static tools often miss. This paper addresses this problem by introducing an automated resource mapping framework that explicitly models these stochastic hardware behaviors using a hybrid analytical approach. We present a dual-path optimization algorithm that automatically determines the best allocation of software tasks to hardware units. Experimental results on a physical multi-core platform demonstrate that this method can predict system latency with over 94% accuracy and reduce execution time by approximately 40% compared to manual or baseline designs. For practitioners, this implies a significant reduction in the “trial-and-error” design cycle for safety-critical systems, enabling more efficient utilization of heterogeneous hardware resources without compromising real-time guarantees.

View source

Similar papers

Open access Aug 2026

Hierarchical Scheduler with Adaptive Time-Budget Reallocation for Time-Triggered Edge-Fog-Cloud Architectures

The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, res...

Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al. · 0 citations
Book Open access Jul 2026

Toward an Integrated Theory of Adaptive Scheduling in High Performance Computing: A Queuing-Theoretic and Computational Learning Perspective.

An integrated theoretical framework for adaptive HPC scheduling that unifies queuing-theoretic models with computational learning techniques is proposed and established, establishing a principled basis for adaptive schedulers that can respond to workload uncertainty.

Rodgers Kimera, Ali Najib, David Kakeeto · 0 citations
Conference 2026

CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays

CacheFlow is presented, a framework that formulates total CRPD as a maximum-flow problem, and an iterative max-flow formulation is described to more efficiently integrate the max-flow solving in the context of standard fixed-priority response-time analysis.

Tiancheng He, Bryan C. Ward · 0 citations
Open access 2026

Adaptive Spotted Hyena Optimizer for Latency-Aware Task Scheduling in Heterogeneous Multicore Systems

The Latency-Aware Adaptive Spotted Hyena Optimizer (LA-ASHO) is proposed, a novel metaheuristic scheduling framework grounded in the social hunting behaviour of spotted hyenas that achieves statistically significant reductions in workflow completion latency relative to established baseline schedulers such as; Min-Min,...

Igiri C. G, Ejekwu Obunezi, Ujah Alechenu Israel · 0 citations
Open access Jul 2026

SPES: A Stochastic Predictive Energy-Aware Scheduling Approach for Efficient Multi-Region Cloud Computing

Cloud computing has transformed the delivery of modern applications and services by providing scalable, flexible, and cost-effective access to computing resources. One of the most critical challenges in cloud environments is the efficient distribution of dynamic workloads across heterogeneous resources, commonly addres...

M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al. · 0 citations
Conference 2026

Probabilistic Schedulability Analysis for Mixed-Criticality DAG Tasks on Multiprocessors

A probabilistic schedulability analysis that exploits the statistical rarity of multiple vertices within a DAG exceeding their expected execution budgets by grouping vertices within each DAG into small clusters and bounding the probability that more than one vertex in a cluster overruns.

Hiroto Takahashi, Atsushi Yano, Takuya Azumi · 0 citations

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