A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial feasibility test for preemptive periodic scheduling of unrelated processors |
scientific article; zbMATH DE number 3930344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial feasibility test for preemptive periodic scheduling of unrelated processors |
scientific article; zbMATH DE number 3930344 |
Statements
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (English)
0 references
1985
0 references
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 of this linear system, if any, for constructing a feasible schedule in a straightforward way.
0 references
preemptive scheduling
0 references
periodically occurring jobs
0 references
system of linear inequalities
0 references
feasible schedule
0 references
0.9000374
0 references
0.90000737
0 references
0 references
0.8846786
0 references
0.8840231
0 references
0 references
0.87306005
0 references
0.87295604
0 references
0 references
