Recommendations
Cited in
(28)- Improved bounds for on-line load balancing
- Load balancing to adjust for proximity in some network topologies
- On-line load balancing and network flow
- A survey on makespan minimization in semi-online environments
- Robust algorithms for total completion time
- Online load balancing with general reassignment cost
- scientific article; zbMATH DE number 1629979 (Why is no real title available?)
- Optimal load balancing on distributed homogeneous unreliable processors
- Path-independent load balancing with unreliable machines
- A scheduling algorithm for load balance sensitive storage
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- The power of deferral: maintaining a constant-competitive Steiner tree online
- To balance or unbalance load in size-interval task allocation
- Smart SMART Bounds for Weighted Response Time Scheduling
- Optimal load balancing and scheduling in a distributed computer system
- scientific article; zbMATH DE number 1751884 (Why is no real title available?)
- Simultaneously load balancing for every p-norm, with reassignments
- scientific article; zbMATH DE number 2086383 (Why is no real title available?)
- scientific article; zbMATH DE number 1419431 (Why is no real title available?)
- Dynamic windows scheduling with reallocation
- Principles of Distributed Systems
- Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility
- Load balancing for response time
- Online load balancing on uniform machines with limited migration
- A case for on-machine load balancing
- Online unrelated-machine load balancing and generalized flow with recourse
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- Reallocation problems in scheduling
This page was built for publication: Load Balancing for Response Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953243)
