Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
Partitioned preemptive EDF scheduling is very similar to bin packing, but there is a subtle difference. Estimating the probability of schedulability under a given total utilization has been studied empirically before. Here, we show an approach for closed-form formulae for the problem, starting with...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Universitätsbibliothek Chemnitz
2012
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-80762 http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-80762 http://www.qucosa.de/fileadmin/data/qucosa/documents/8076/rtns2011.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/8076/signatur.txt.asc |