| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429107 | Information Processing Letters | 2010 | 4 Pages |
Abstract
The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
