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 n = 3 tasks on m = 2 processors.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-qucosa-80762 |
| Date | 01 November 2012 |
| Creators | Müller, Dirk, Werner, Matthias |
| Contributors | TU Chemnitz, Fakultät für Informatik, IRCCyN lab, |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject |
| Format | application/pdf, text/plain, application/zip |
| Source | RTNS 2011, Proc. of the 19th Int'l Conf. on Real-Time and Network Systems |
Page generated in 0.0017 seconds