In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
Alexis A. Dowhuszko, Graciela Corral-Briones, Jyri...
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
Abstract We propose an approach to certify the information flow security of multi-threaded programs independently from the scheduling algorithm. A scheduler-independent verificatio...