Advanced SearchSearch Tips
A Load Sharing Algorithm Including An Improved Response Time using Evolutionary Information in Distributed Systems
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Load Sharing Algorithm Including An Improved Response Time using Evolutionary Information in Distributed Systems
Lee, Seong-Hoon;
  PDF(new window)
A load sharing algorithm is one of the important factors in computer system. In sender-initiated load sharing algorithms, when a distributed system becomes to heavy system load, it is difficult to find a suitable receiver because most processors have additional tasks to send. The sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Because of these unnecessary request messages it results in inefficient communications, low cpu utilization, and low system throughput. To solve these problems, we propose a self-adjusting evolutionary algorithm for improved sender-initiated load sharing in distributed systems. This algorithm decreases response time and increases acceptance rate. Compared with the conventional sender-initiated load sharing algorithms, we show that the proposed algorithm performs better.
Evolutionary Information;Response Time;Distributed System;
 Cited by
D.L.Eager, E.D.Lazowska, J.Zahorjan, "Adaptive Load Sharing in Homogeneous Distributed Systems," IEEE Trans on Software Engineering, vol.12, no.5, May 1986, pp.662-675.

N. G.Shivaratri, P.Krueger, and M.Singhal, "Load Distributing for Locally Distributed Systems," IEEE COMPUTER, vol.25, no.12, December 1992, pp.33-44. crossref(new window)

J.Grefenstette, "Optimization of Control Parameters for Genetic Algorithms," IEEE Trans on SMC, vol.SMC-16, no.1, January 1986, pp.122-128. crossref(new window)

J.R. Filho and P. C. Treleaven, "Genetic-Algorithm Programming Environments," IEEE COMPUTER, June 1994, pp.28-43. crossref(new window)

T. Kunz, "The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme," IEEE Trans on Software Engineering, vol.17, No.7, July 1991, pp.725-730. crossref(new window)

T.Furuhashi, K.Nakaoka, Y.Uchikawa, "A New Approach to Genetic Based Machine Learning and an Efficient Finding of Fuzzy Rules," Proc. WWW'94, 1994, pp.114-122,.

J A. Miller, W D. Potter, R V. Gondham, C N. Lapena, "An Evaluation of Local Improvement Operators for Genetic Algorithms," IEEE Trans on SMC, vol.23, No 5, Sept 1993, pp.1340-1351. crossref(new window)

N.G.Shivaratri and P.Krueger, "Two Adaptive Location Policies for Global Scheduling Algorithms," Proc. 10th International Conference on Distributed Computing Systems, May 1990, pp.502-509.

Terence C. Fogarty, Frank Vavak, and Phillip Cheng, "Use of the Genetic Algorithm for Load Balancing of Sugar Beet Presses," Proc. Sixth International Conference on Genetic Algorithms, 1995, pp.617-624.

Garrism W. Greenwood, Christian Lang and steve Hurley, "Scheduling Tasks in Real-Time Systems using Evolutionary Strategies," Proc. Third Workshop on Parallel and Distributed Real-Time Systems, 1995, pp.195-196.

Gilbert Syswerda, Jeff Palmucci, "The application of Genetic Algorithms to Resource Scheduling," Proc. Fourth International Conference on Genetic Algorithms, 1991, pp.502-508.

Melanie Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1996.

M.Srinivas, and L.M.Patnait, "Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms," IEEE Trans on SMC, vol.24, no.4, April 1994, pp.656-667. crossref(new window)