An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Algorithms - ESA 2009 / Fiat, Amos; Sanders, Peter (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. - (Lecture Notes in Computer Science ; 5757). - S. 432-443. - ISBN 978-3-642-04127-3
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2010
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-122004
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:57 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Karrenbauer, Andreas
- Rothvoß, Thomas
- Bibliothek der Universität Konstanz
Entstanden
- 2010
Ähnliche Objekte (12)
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Approximation in batch and multiprocessor scheduling
Efficient and robust dynamic scheduling and synchronization in practical embedded real-time multiprocessor systems
Average monotonic cooperative games with nontransferable utility
Realtime multiprocessor for mobile ad hoc networks
Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten : heuristische Lösungsverfahren
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
A Novel ACO-Based Static Task Scheduling Approach for Multiprocessor Environments
Performance analysis of multiprocessor real-time systems with shared resources
Average-Case Approximation Ratio of Scheduling without Payments
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Approximation in batch and multiprocessor scheduling
Efficient and robust dynamic scheduling and synchronization in practical embedded real-time multiprocessor systems
Average monotonic cooperative games with nontransferable utility
Realtime multiprocessor for mobile ad hoc networks
Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten : heuristische Lösungsverfahren
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
A Novel ACO-Based Static Task Scheduling Approach for Multiprocessor Environments
Performance analysis of multiprocessor real-time systems with shared resources
Average-Case Approximation Ratio of Scheduling without Payments
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Approximation in batch and multiprocessor scheduling
Efficient and robust dynamic scheduling and synchronization in practical embedded real-time multiprocessor systems
Average monotonic cooperative games with nontransferable utility
Realtime multiprocessor for mobile ad hoc networks
Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten : heuristische Lösungsverfahren
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
A Novel ACO-Based Static Task Scheduling Approach for Multiprocessor Environments
Performance analysis of multiprocessor real-time systems with shared resources