This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

In this paper, we study two proportional-share resource management algorithms, Lottery Scheduling and Earliest Eligible Virtual Deadline First (EEVDF), and compare their performances in scheduling real time jobs having specific deadlines. Lottery scheduling is not used to schedule real time jobs; we test whether we can use it for this purpose by designing the ticket allocation policy according ...

Motivated by baterryless IoT devices, we consider the following scheduling problem. The input includes n unit time jobs $$\mathcal {J}= \left\{ J_1, \ldots , J_n \right\} $$ where each job $$J_i$$ has a release $$r_i$$ due date $$d_i$$ energy requirement $$e_i$$ and weight $$w_i$$ . We to be slotted; hence, all related values refer slots. Let $$T=\max _i\left\{ d_i also an $$h_t$$ value for eve...