A Note on "Optimal Static Load Balancing in Distributed Computer Systems"
S. A. Mondal
Abstract
The problem of minimizing mean response time of generic jobs submitted to a heterogenous distributed computer systems is considered in this paper. A static load balancing strategy, in which decision of redistribution of loads does not depend on the state of the system, is used for this purpose. The article is closely related to a previous article on the same topic. The present article points out number of inconsistencies in the previous article, provides a new formulation, and discusses the impact of new findings, based on the improved formulation, on the results of the previous article.
Create a lesson
Related papers
Understanding NVIDIA Grace-Blackwell Unified Memory Through Placement-Controlled Microbenchmarks
Nathan Graddon, Aaron Jarmusch, Sunita Chandrasekaran
TrimSO(2): Fast and Memory-Efficient Training of Equivariant Interatomic Potentials
Chen Wang, Yuanchang Zhou, Guangming Tan et al.
JointServe: Serving Multi-Model Agents on Memory-Constrained GPUs
Daijin Hu
The Cost of Context: Profiling the Energy Footprint of Input Tokens in Large Language Models
Boris Ruf, Marcin Detyniecki
Scaling LLM Inference via Parallelism: Throughput-Latency Trade-off
Javad Mirzaei, Jeebak Mitra
Parallel Sparse Outputs for Tensor Compilers
Adrian Gushin, Pau Sum, Willow Ahrens