scientific article; zbMATH DE number 1306855
From MaRDI portal
Publication:4252706
Cited in
(28)- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- Preemptive scheduling in overloaded systems.
- Resource augmentation in load balancing.
- Applying extra-resource analysis to load balancing.
- Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors
- Online knapsack with resource augmentation
- Fault tolerant scheduling of tasks of two sizes under resource augmentation
- Minimizing the maximum starting time on-line
- An approximation algorithm for scheduling trees of malleable tasks
- Deadline-based scheduling of periodic task systems on multiprocessors.
- Rejecting jobs to minimize load and maximum flow-time
- Online bin packing with resource augmentation
- A comparison of performance measures via online search
- An analysis of totally clairvoyant scheduling
- Greedy multiprocessor server scheduling
- Approximation algorithms for problems in scheduling with set-ups
- Optimal on-line flow time with resource augmentation
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- On the advice complexity of online bipartite matching and online stable marriage
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
- Speed is more powerful than clairvoyance
- Measuring the problem-relevant information in input
- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- Resource augmentation for weighted flow-time explained by dual fitting
- On packet scheduling with adversarial jamming and speedup
- Scheduling in the dark
- Reallocation problems in scheduling
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252706)
