scientific article; zbMATH DE number 1306855
From MaRDI portal
Publication:4252706
zbMath0938.68545MaRDI QIDQ4252706
Bala Kalyanasundaram, Kirk R. Pruhs
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Speed is more powerful than clairvoyance ⋮ Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors ⋮ The Canadian tour operator problem on paths: tight bounds and resource augmentation ⋮ Measuring the problem-relevant information in input ⋮ Online knapsack with resource augmentation ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Preemptive scheduling in overloaded systems. ⋮ Online bin packing with resource augmentation ⋮ Fault tolerant scheduling of tasks of two sizes under resource augmentation ⋮ A comparison of performance measures via online search ⋮ A Constant-Competitive Algorithm for Online OVSF Code Assignment ⋮ On packet scheduling with adversarial jamming and speedup ⋮ Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms ⋮ An analysis of totally clairvoyant scheduling ⋮ Greedy multiprocessor server scheduling ⋮ Approximation algorithms for problems in scheduling with set-ups ⋮ Minimizing the maximum starting time on-line ⋮ Optimal on-line flow time with resource augmentation ⋮ Competitive analysis of online real-time scheduling algorithms under hard energy constraint ⋮ Scheduling in the dark ⋮ Reallocation problems in scheduling ⋮ Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling ⋮ Resource augmentation in load balancing. ⋮ Applying extra-resource analysis to load balancing. ⋮ An approximation algorithm for scheduling trees of malleable tasks ⋮ Deadline-based scheduling of periodic task systems on multiprocessors. ⋮ Unnamed Item
