An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Lade...
Vorschaubild
Dateien
avcase_esa09.pdf
avcase_esa09.pdfGröße: 178.32 KBDownloads: 280
Datum
2009
Autor:innen
Rothvoß, Thomas
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
FIAT, Amos, ed., Peter SANDERS, ed.. Algorithms - ESA 2009. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 432-443. Lecture Notes in Computer Science. 5757. ISBN 978-3-642-04127-3. Available under: doi: 10.1007/978-3-642-04128-0_39
Zusammenfassung

We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments if utilization values are chosen uniformly at random. More precisely we prove that the expected waste is upper bounded by O(n3/4(log n)3/8). Here the waste denotes the ratio of idle times, cumulated over all processors and n gives the number of tasks.
The algorithm can be implemented to run in time O(n log n) and even in the worst case, an asymptotic approximation ratio of 2 is guaranteed. Experiments yield an average waste proportional to n 0.70, indicating that the above upper bound on the expected waste is almost tight.
While such average-case analyses are a classical topic of Bin Packing, to the best of our knowledge, this is the first result dealing with a theoretical average-case analysis for this scheduling problem, which was described by Liu and Layland more than 35 years ago and has received a lot of attention, especially in the real-time and embedded-systems community.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690KARRENBAUER, Andreas, Thomas ROTHVOSS, 2009. An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling. In: FIAT, Amos, ed., Peter SANDERS, ed.. Algorithms - ESA 2009. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 432-443. Lecture Notes in Computer Science. 5757. ISBN 978-3-642-04127-3. Available under: doi: 10.1007/978-3-642-04128-0_39
BibTex
@inproceedings{Karrenbauer2009Avera-6005,
  year={2009},
  doi={10.1007/978-3-642-04128-0_39},
  title={An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling},
  number={5757},
  isbn={978-3-642-04127-3},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms - ESA 2009},
  pages={432--443},
  editor={Fiat, Amos and Sanders, Peter},
  author={Karrenbauer, Andreas and Rothvoß, Thomas}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6005">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:42Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling</dcterms:title>
    <dcterms:abstract xml:lang="eng">We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments if utilization values are chosen uniformly at random. More precisely we prove that the expected waste is upper bounded by O(n3/4(log n)3/8). Here the waste denotes the ratio of idle times, cumulated over all processors and n gives the number of tasks.&lt;br /&gt;The algorithm can be implemented to run in time O(n log n) and even in the worst case, an asymptotic approximation ratio of 2 is guaranteed. Experiments yield an average waste proportional to n 0.70, indicating that the above upper bound on the expected waste is almost tight.&lt;br /&gt;While such average-case analyses are a classical topic of Bin Packing, to the best of our knowledge, this is the first result dealing with a theoretical average-case analysis for this scheduling problem, which was described by Liu and Layland more than 35 years ago and has received a lot of attention, especially in the real-time and embedded-systems community.</dcterms:abstract>
    <dc:creator>Rothvoß, Thomas</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:42Z</dcterms:available>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6005/1/avcase_esa09.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6005/1/avcase_esa09.pdf"/>
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dcterms:issued>2009</dcterms:issued>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6005"/>
    <dc:format>application/pdf</dc:format>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:bibliographicCitation>First publ. in: Algorithms : ESA 2009 ; 17th Annual European Symposium, Copenhagen, Denmark, September 7 - 9, 2009 / Amos Fiat ... (eds.). - Berlin: Springer, 2009. - pp. 432-443</dcterms:bibliographicCitation>
    <dc:contributor>Rothvoß, Thomas</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen