Publication
A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor
| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-12T12:10:34Z | |
| dc.date.available | 2014-02-12T12:10:34Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3858 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | no | por |
| dc.publisher | IPP-Hurray Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.title | A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 10 | por |
| oaire.citation.startPage | 1 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |