A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

Karrenbauer, Andreas; Rothvoß, Thomas

A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

Dateien

Karrenbauer etal.pdfGröße: 4.13 MBDownloads: 478

Datum

2011

Autor:innen

Karrenbauer, Andreas

Rothvoß, Thomas

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Zukunftskolleg
Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Sammelband

Publikationsstatus

Published

Erschienen in

JANSEN, Klaus, ed., Roberto SOLIS-OBA, ed.. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 166-177. Lecture Notes in Computer Science. 6534. ISBN 978-3-642-18317-1. Available under: doi: 10.1007/978-3-642-18318-8_15

Zusammenfassung

We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k ∈ N it yields solutions with at most ( 3 2 + 1 k )OPT +9k many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to run in time O(n ²), where n is the number of tasks. It is based on custom-tailored weights for the tasks such that a greedy maximal matching and subsequent partitioning by a first-fit strategy yields the result.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

KARRENBAUER, Andreas, Thomas ROTHVOSS, 2011. A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks. In: JANSEN, Klaus, ed., Roberto SOLIS-OBA, ed.. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 166-177. Lecture Notes in Computer Science. 6534. ISBN 978-3-642-18317-1. Available under: doi: 10.1007/978-3-642-18318-8_15

BibTex

@incollection{Karrenbauer201132app-17269,
  year={2011},
  doi={10.1007/978-3-642-18318-8_15},
  title={A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks},
  number={6534},
  isbn={978-3-642-18317-1},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Approximation and Online Algorithms},
  pages={166--177},
  editor={Jansen, Klaus and Solis-Oba, Roberto},
  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/17269">
    <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/52"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:title>A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-12-01T13:18:56Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17269/2/Karrenbauer%20etal.pdf"/>
    <dcterms:abstract xml:lang="eng">We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k ∈ N it yields solutions with at most ( 3 2 + 1 k )OPT +9k many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to run in time O(n &lt;sup&gt;2&lt;/sup&gt;), where n is the number of tasks. It is based on custom-tailored weights for the tasks such that a greedy maximal matching and subsequent partitioning by a first-fit strategy yields the result.</dcterms:abstract>
    <dcterms:bibliographicCitation>First publ. in: Lecture Notes in Computer Science ; 6534 (2011). - S. 166-177</dcterms:bibliographicCitation>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17269/2/Karrenbauer%20etal.pdf"/>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>2011</dcterms:issued>
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dc:contributor>Rothvoß, Thomas</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-07-31T22:25:05Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Rothvoß, Thomas</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17269"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja