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:qucosa:19622 |
Date | 01 November 2012 |
Creators | Müller, Dirk, Werner, Matthias |
Contributors | Technische Universität Chemnitz |
Publisher | IRCCyN lab |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
Source | RTNS 2011, Proc. of the 19th Int'l Conf. on Real-Time and Network Systems |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.053 seconds