Jul 2026· International Conference on Computer, Information and Telecommunication Systems· pp. 1-8· 0 citations· 28 references
Abstract
The correct and timely execution of complex workloads in distributed systems relies on effective task scheduling mechanisms. This paper examines scheduling strategies for pipeline workflow applications coexisting with mixed-criticality periodic real-time tasks that exhibit heterogeneous laxity constraints. These real-time tasks can temporarily switch to imprecise execution modes, enabling pipeline jobs to progress with reduced preemption. Although higher-priority real-time tasks may interrupt PW execution, their criticality-dependent laxity provides additional scheduling flexibility that can be exploited without violating timing guarantees. Building on this observation, we propose two scheduling approaches that apply approximate execution to periodic real-time tasks while limiting the performance degradation of PW applications. Simulation-based experiments evaluate the impact of such approximations on pipeline workflow progress and overall system performance across a range of operating scenarios.
Job scheduling in grid computing remains challenging due to heterogeneous resources, dynamic
workloads, and frequent failures. Traditional algorithms such as First-Come-First-Served and
Round Robin lack adaptive mechanisms for reliability in failure-prone environments. This study
develops an improved job scheduling...
I. Alabere· International Journal of Com...· 0 citations
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
Paxos consensus protocol is widely used in distributed systems, yet their performance can degrade under heterogeneous workloads and deadline-constrained requests. Traditional priority-based Paxos extensions rely on static scheduling policies that are unable to adapt to dynamically changing urgency. This paper proposes...
Elham Amini, J. Misic, Vojislav B. Mišić· IEEE Transactions on Network...· 0 citations
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.· Future Internet· 0 citations
Currently, the prevalence of heterogeneous multicore architectures even in real-time safety-critical embedded systems is rising, as an increasing number of applicationspecific accelerators are introduced into the core architecture to tackle more and more complex problems. This does create a challenge for the modern dev...
Jonas Hollmann, Jakob Arndt, Holger Blume· IEEE International Conferenc...· 0 citations
A retention-oriented scheduling framework for always-on arbitrary-deadline Directed Acyclic Graph workloads, consisting of two algorithms with a clear progression, and shows that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption.
Xiangzhen Xiao, Weijie Wang, Wei-Chen Liu et al.· ACM Transactions on Embedded...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.