Sciweavers

ICDCS
2009
IEEE
14 years 8 months ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
Matthew Lang, Paolo A. G. Sivilotti