— Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. T...
Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari,...
Audsley’s Optimal Priority Assignment (OPA) algorithm can be applied to multiprocessor scheduling provided that three conditions hold with respect to the schedulability tests us...
Robert I. Davis, Marko Bertogna, Vincenzo Bonifaci
The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have ...
The well-known “Janson’s inequality” gives Poisson-like upper bounds for the lower tail probability P(X (1 − ε)EX) when X is the sum of dependent indicator random variabl...