Return to search

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 n = 3 tasks on m = 2 processors.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:19622
Date01 November 2012
CreatorsMüller, Dirk, Werner, Matthias
ContributorsTechnische Universität Chemnitz
PublisherIRCCyN lab
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text
SourceRTNS 2011, Proc. of the 19th Int'l Conf. on Real-Time and Network Systems
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0017 seconds