- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
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
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2010
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-122004
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:57 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Karrenbauer, Andreas
- Rothvoß, Thomas
- Bibliothek der Universität Konstanz
Time of origin
- 2010
Other Objects (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