We consider the problem of preemptive scheduling a set of periodically occurring jobs on a set of unrelated processors, that is, processors having different speeds for different jobs. We assume that each occurrence of a job has to be completely processed before the next occurrence of the same job. We provide a system of linear inequalities for testing the existence of a feasible schedule which can be solved in polynomial time. We then use the solution to this linear system, if any, for constructing a feasible schedule in a straightforward way.
|Autori:||BERTOSSI AA; BONUCCELLI M|
|Titolo:||A POLYNOMIAL FEASIBILITY TEST FOR PREEMPTIVE PERIODIC SCHEDULING OF UNRELATED PROCESSORS|
|Anno del prodotto:||1985|
|Digital Object Identifier (DOI):||10.1016/0166-218X(85)90024-1|
|Appare nelle tipologie:||1.1 Articolo in rivista|