This paper compares FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis and finds that when CRPD is accounted for, the performance gains by EDF over FP, while still notable, are diminished.
This paper introduces a job-level dynamic cache allocation strategy for multicore systems in which critical real-time tasks execute on a dedicated core while sharing the LLC with best-effort workloads executing on the remaining cores.
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
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 rapid proliferation of Internet of Things (IoT) devices has intensified demands for low-latency, resource-efficient task scheduling at the network edge. Conventional policies such as Round-Robin and First-Come-First-Serve (FCFS) fail to satisfy the Quality-of-Service (QoS) requirements of Industrial-IoT and autonom...
Shibang Maity, Roshan Panda, M. Tanisha et al.· International Conference on...· 0 citations
SNF-ICON is presented, an event-driven controller combining smallest-need-first (SNF) gang scheduling, predictive wake timing, and adaptive warm-spare control that reduces average waiting time relative to the FCFS-based baseline in all six cases and remains close to at least one heuristic energy baseline in five.
