Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks

Description

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.

Links & Downloads

1. urn:nbn:de:bsz:ch1-qucosa-80762
2. https://monarch.qucosa.de/id/qucosa%3A19622
3. https://monarch.qucosa.de/api/qucosa%3A19622/attachment/ATT-0/
4. https://monarch.qucosa.de/api/qucosa%3A19622/attachment/ATT-1/

Tags

info:eu-repo/classification/ddc/004

ddc:004

Scheduling; Heuristik

Additional Fields

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