This Article 
 Bibliographic References 
 Add to: 
Efficient Task Migration Algorithm for Distributed Systems
July 1992 (vol. 3 no. 4)
pp. 488-499
The objective of the study was to achieve balanced load among processors, reduce the communication overhead of the load balancing algorithm, and improve resource utilization, which results in better average response time. A communication protocol and a fully distributed algorithm for dynamic load balancing through task migration in a connected N-processor network are presented. Each processor communicates its load directly with only a subset (of the size square root N) of processors, reducing communication traffic and average response time. It is proved that the given algorithm will perform task migration even if there is only one light load processor and one heavy load processor in the system. Simulation results show that the proposed scheme can save up to 60% of the protocol messages used by the broadcast algorithms and can reduce the average response time.

[1] A. A. Albert and R. Sandler,An Introduction to Finite Projective Planes. New York: Holt, Rinehart and Winston, 1968.
[2] S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing. Boston, MA: Kluwer Academic, 1987.
[3] S. H. Bokhari, "Dual processor scheduling with dynamic reassignment,"IEEE Trans. Software Eng., vol. vol. SE-5, no. 4, July 1979.
[4] S. H. Bokhari, "Partitioning problems in parallel and pipelined and distributed computing,"IEEE Trans. Comput., vol. 37, no. 1, Jan. 1988.
[5] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, no. 6, Nov. 1981.
[6] R. H. Bruck and H. J. Ryser, "The nonexistence of certain finite projective planes,"Canadian J. Math., vol. 1, pp. 88-93, 1949.
[7] T. L. Casvant and J. G. Kuhl, "A taxonomy of scheduling in general-purpose distributed computing systems,"IEEE Trans. Software Eng., vol. 14, no. 2, Feb. 1988.
[8] K. Efe. "Heuristic models of task assignment scheduling in distributed systems,"IEEE Comput. Mag., pp. 50-56, June 1982.
[9] C. Gao, J. W. S. Liu, and M. Railey, "Load balancing algorithm in homogeneous distributed systems," Tech. Rep. UIUC-DCS-84-1168, Dep. Comput. Sci., Univ. Illinois, Urbana-Champaign, 1984.
[10] F. C. H. Lin and R. M. Keller, "The gradient model load balancing method,"IEEE Trans. Software Eng., vol. SE-13, pp. 32-38, Jan. 1987.
[11] V. M. Lo, "Heuristic algorithm for task assignment in distributed systems,"IEEE Trans. Comput., vol. 37, no. 11, Nov. 1988.
[12] M. Maekawa, "A√N algorithm for mutual exclusion in decentralized systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, May 1985.
[13] L. M. Ni and K. Hwang, "Optimal load balancing in a multiple processor system with many job classes,"IEEE Trans. Software Eng., vol. SE-11, no. 5, May 1985.
[14] L. M. Ni, C. Xu, and T. B. Gendreau, "A distributed drafting algorithm for load balancing,"IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1153-1161, Oct. 1985.
[15] J.-C. Ryou and J. S. K. Wong, "A task migration algorithm for load balancing in a distributed system," inProc. 22nd Annu. Hawaii Int. Conf. Syst. Sci., Vol. II, Jan. 1989, pp. 641-1048, Nominated as a candidate for best paper awards.
[16] C.-C. Shen and W.-H. Tsai, "A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion,"IEEE Trans. Comput., vol. C-34, no. 3, Mar. 1985.
[17] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, no. 1, Jan. 1977.

Index Terms:
Index Termstask migration algorithm; distributed systems; balanced load; communication overhead;load balancing algorithm; respource utilization; average resonse time; communicationprotocol; distributed algorithm; dynamic load balancing; communication traffic; protocolmessages; distributed processing; parallel algorithms; protocols
T.T.Y. Suen, J.S.K. Wong, "Efficient Task Migration Algorithm for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 488-499, July 1992, doi:10.1109/71.149966
Usage of this product signifies your acceptance of the Terms of Use.