Resource augmentation in load balancing.
From MaRDI portal
Publication:1588053
Recommendations
Cites work
- scientific article; zbMATH DE number 1305455 (Why is no real title available?)
- scientific article; zbMATH DE number 1306855 (Why is no real title available?)
- scientific article; zbMATH DE number 1003243 (Why is no real title available?)
- scientific article; zbMATH DE number 1559529 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- A lower bound for randomized on-line multiprocessor scheduling
- A lower bound for randomized on-line scheduling algorithms
- An optimal algorithm for preemptive on-line scheduling
- Bounds for Certain Multiprocessing Anomalies
- Scheduling in the dark
- Scheduling with deadlines and loss functions
Cited in
(8)- scientific article; zbMATH DE number 1617258 (Why is no real title available?)
- Minimizing the maximum starting time on-line
- Resource augmented semi-online bounded space bin packing
- Online multidimensional load balancing
- scientific article; zbMATH DE number 1445349 (Why is no real title available?)
- Applying extra-resource analysis to load balancing.
- The online best reply algorithm for resource allocation problems
- Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
This page was built for publication: Resource augmentation in load balancing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588053)