Deterministic load balancing in computer networks

The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem, research in the area mostly restricts itself to probabilistic or approximation algorithms, or to the average behavior of a network. The paper provides deterministic analysis of the problem for general networks. It focuses on the worst-case complexity analysis of the problem. It shows certain cases of the LBP to be NP-complete. The paper also discusses situations closely related to computer networks, where there is a global view of load distribution in the network; it provides a polynomial algorithm for solving the load balancing problem in this network.<<ETX>>

[1]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Larry D. Wittie,et al.  Wave Scheduling - Decentralized Scheduling of Task Forces in Multicomputers , 1984, IEEE Trans. Computers.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[5]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[6]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  Eli Upfal,et al.  A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems , 1987, J. Parallel Distributed Comput..

[8]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[10]  Joseph Carlo Pasquale,et al.  Intelligent decentralized control in large distributed computer systems , 1988 .

[11]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[12]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

[13]  Sayed A. Banawan.  An evaluation of load sharing in locally distributed systems , 1987 .

[14]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[15]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[16]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[17]  Marina C. Chen,et al.  From Local to Global: An Analysis of Nearest Neighbor Balancing on Hypercubes , 1988, SIGMETRICS.

[18]  R. G. Born,et al.  Analytic derivation of processor potential utilization in straight line, ring, square mesh, and hypercube networks , 1988, SIGMETRICS 1988.

[19]  M. Chen,et al.  From Local to Global: An Analysis of Nearest Neighbor Balancing on Hypercubes , 1988, SIGMETRICS.