This Article 
 Bibliographic References 
 Add to: 
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
July 1991 (vol. 17 no. 7)
pp. 725-730

A task scheduler based on the concept of a stochastic learning automation, implemented on a network of Unix workstations, is described. Creating an artificial, executable workload, a number of experiments were conducted to determine the effect of different workload descriptions. These workload descriptions characterize the load at one host and determine whether a newly created task is to be executed locally or remotely. Six one-dimensional workload descriptors are examined. Two workload descriptions that are more complex are also considered. It is shown that the best single workload descriptor is the number of tasks in the run queue. The use of the worst workload descriptor, the 1-min load average, resulted in an increase of the mean response time of over 32%, compared to the best descriptor. The two best workload descriptors, the number of tasks in the run queue and the system call rate, are combined to measure a host's load. Experimental results indicate that no performance improvements over the scheduler versions using a one-dimensional workload descriptor can be obtained.

[1] T. L. Casavant and J. G. Kuhl, "A taxonomy of scheduling in general-purpose distributed computing systems,"IEEE Trans. Software Eng., vol. 14, pp. 141-154, Feb. 1988.
[2] D. Eager, E. Lazowska, and J. Zahorjan, "Adaptive load sharing in homogeneous distributed systems,"IEEE Trans. Software Eng., vol. SE-12, no. 5, pp. 662-675, May 1986.
[3] D. Ferrari,Computer Systems Performance Evaluation. Englewood, Cliffs, NJ: Prentice-Hall, 1978.
[4] W. E. Leland and T. J. Ott, "Load-balancing heuristics and process behavior,"ACM 0-89791-184-9/86/0500-0054.
[5] R. Mirchandaney and J. A. Stankovic, "Using stochastic learning automata for job scheduling in distributed processing systems,"J. Parallel Distributed Comput., pp. 527-551, 1986.
[6] K. S. Narendra and M. A. L. Thathachar, "Learning automata--A survey,"IEEE Trans. Syst., Man. Cybern., pp. 323-334, July 1974.
[7] C. C. Price and S. Krishnaprasad, "Software allocation models for distributed systems," inProc. 5th Int. Conf. on Distributed Computing, 1984, pp. 40-47.
[8] S. Pulidas, D. Towsley, and J. Stankovic, "Design of efficient parameter estimators for decentralized load balancing policies," Tech. Rep. 87-79, Univ. of Massachusetts, Amherst, Aug. 1987.
[9] J. A. Stankovic, "The analysis of a decentralized control algorithm for job scheduling utilizing Bayesian decision theory," inProc. 1981 Int. Conf. on Parallel Processing, 1981, pp. 333-340.
[10] J. A. Stankovic, "Simulations of three adaptive, decentralized controlled, job scheduling algorithms,"Comput. Networks, pp. 199-217, June 1984.
[11] J. A. Stankovic, "An application of Bayesian decision theory to decentralized control of job scheduling,"IEEE Trans. Comput., pp. 117-130, Feb. 1985.
[12] J. A. Stankovic, "Stability and distributed scheduling algorithms,"IEEE Trans. Software Eng., vol. SE-11, pp. 1141-1152, Oct. 1985.
[13] H.S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., pp. 85-93, Jan. 1977.
[14] B. Stramm and F. Berman, "Communication-sensitive heuristics and algorithms for mapping compilers," inProc. ACM SIGPLAN Conf. on Parallel Programming: Experiences with Applications, Languages and Systems, July 1988, pp. 222-234.
[15] A. Svensson, "History, an intelligent load sharing filter," inProc. 10th Int. Conf. on Distributed Computing Syst., May 1990, pp. 546-553.

Index Terms:
heuristic load balancing scheme; task scheduler; stochastic learning automation; Unix workstations; executable workload; workload descriptions; one-dimensional workload descriptors; 1-min load average; run queue; system call rate; learning systems; microcomputer applications; scheduling; stochastic processes; Unix
T. Kunz, "The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 725-730, July 1991, doi:10.1109/32.83908
Usage of this product signifies your acceptance of the Terms of Use.