Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load states information
From MaRDI portal
Publication:5956790
DOI10.1007/S00224-001-1022-6zbMATH Open0993.68145OpenAlexW2015439714MaRDI QIDQ5956790
Publication date: 28 February 2002
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-001-1022-6
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Tight bounds for parallel randomized load balancing 👍 👎
- On the analysis of randomized load balancing schemes 👍 👎
- \(O(n)\) algorithms for load balancing in distributed computing systems 👍 👎
- Optimal load balancing on distributed homogeneous unreliable processors 👍 👎
- Parallel Randomized Load Balancing: A Lower Bound for a More General Model 👍 👎
- RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING 👍 👎
- Tight bounds for parallel randomized load balancing 👍 👎
- On-line load balancing of temporary tasks revisited 👍 👎
This page was built for publication: Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load states information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956790)
