- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Dissertation, 2017
- Keyword
-
Scheduling
Computational complexity
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Saarländische Universitäts- und Landesbibliothek
- (when)
-
2018
- Creator
-
Wieder, Alexander
- Contributor
- DOI
-
10.22028/D291-27388
- URN
-
urn:nbn:de:bsz:291-scidok-ds-273887
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
22.04.0016, 11:07 AM CET
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
- Wieder, Alexander
- Brandenburg, Björn B.
- Saarländische Universitäts- und Landesbibliothek
Time of origin
- 2018
Other Objects (12)
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
Real-time semi-partitioned scheduling of fork-join tasks using work-stealing
A combined priority scheduling method for distributed machine learning
Static analysis of embedded software with priority scheduling and interrupts
Efficient priority rules for the resource-constrained project scheduling problem
Partitioned least squares
Partitioned chain grammars
Computing the maximum blocking time for scheduling with deferred preemption
Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
Approximation in stochastic scheduling: The power of LP-based priority policies
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
Real-time semi-partitioned scheduling of fork-join tasks using work-stealing
A combined priority scheduling method for distributed machine learning
Static analysis of embedded software with priority scheduling and interrupts
Efficient priority rules for the resource-constrained project scheduling problem
Partitioned least squares
Partitioned chain grammars
Computing the maximum blocking time for scheduling with deferred preemption
Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
Approximation in stochastic scheduling: The power of LP-based priority policies
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks
Real-time semi-partitioned scheduling of fork-join tasks using work-stealing
A combined priority scheduling method for distributed machine learning
Static analysis of embedded software with priority scheduling and interrupts
Efficient priority rules for the resource-constrained project scheduling problem
Partitioned least squares
Partitioned chain grammars
Computing the maximum blocking time for scheduling with deferred preemption
Technical Report on Bridge-Local Guaranteed Latency with Strict Priority Scheduling
Minimizing cache usage with fixed-priority and earliest deadline first scheduling