Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme

Published: 01 July 1991 Publication History

Abstract

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.

References

[1]
{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]
{2} D. L. Eager, E. D. Lazowska, and J. Zahorjan, "Adaptive load sharing in homogeneous distributed systems," IEEE Trans. Software Eng. , vol. SE-12, pp. 662-675, May 1986.]]
[3]
{3} D. Ferrari, Computer Systems Performance Evaluation . Englewood, Cliffs, NJ: Prentice-Hall, 1978.]]
[4]
{4} W. E. Leland and T. J. Ott, "Load-balancing heuristics and process behavior," ACM 0-89791-184-9/86/0500-0054.]]
[5]
{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]
{6} K. S. Narendra and M. A. L. Thathachar, "Learning automata--A survey," IEEE Trans. Syst., Man. Cybern. , pp. 323-334, July 1974.]]
[7]
{7} C. C. Price and S. Krishnaprasad, "Software allocation models for distributed systems," in Proc. 5th Int. Conf. on Distributed Computing , 1984, pp. 40-47.]]
[8]
{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]
{9} J. A. Stankovic, "The analysis of a decentralized control algorithm for job scheduling utilizing Bayesian decision theory," in Proc. 1981 Int. Conf. on Parallel Processing , 1981, pp. 333-340.]]
[10]
{10} J. A. Stankovic, "Simulations of three adaptive, decentralized controlled, job scheduling algorithms," Comput. Networks , pp. 199-217, June 1984.]]
[11]
{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]
{12} J. A. Stankovic, "Stability and distributed scheduling algorithms," IEEE Trans. Software Eng. , vol. SE-11, pp. 1141-1152, Oct. 1985.]]
[13]
{13} H.S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms," IEEE Trans. Software Eng. , pp. 85-93, Jan. 1977.]]
[14]
{14} B. Stramm and F. Berman, "Communication-sensitive heuristics and algorithms for mapping compilers," in Proc. ACM SIGPLAN Conf. on Parallel Programming: Experiences with Applications, Languages and Systems , July 1988, pp. 222-234.]]
[15]
{15} A. Svensson, "History, an intelligent load sharing filter," in Proc. 10th Int. Conf. on Distributed Computing Syst. , May 1990, pp. 546-553.]]

Cited By

View all
  • (2023)A dynamic load balancing mechanism for distributed systemsJournal of Computer Science and Technology10.1007/BF0294312911:3(195-207)Online publication date: 22-Mar-2023
  • (2019)Modeling industry 4.0 based fog computing environments for application analysis and deploymentFuture Generation Computer Systems10.1016/j.future.2018.08.04391:C(48-60)Online publication date: 1-Feb-2019
  • (2018)KloadavgProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167253(1122-1128)Online publication date: 9-Apr-2018
  • Show More Cited By

Recommendations

Reviews

Jason Gait

The author describes a distributed real-time task scheduler implemented on an Ethernet of five diskless UNIX workstations. The load-balancing problem is NP-complete, so this paper studies scheduling heuristics. The scheduler is transparent to network topology and to the structure of incoming tasks. The global scheduler receives periodic state information from each local scheduler in the form of a token that allows the global scheduler to dispatch tasks to the local scheduler until the token is revoked. Each local scheduler distributes and revokes tokens based on local workload. The (artificial) workload model is determined by task arrival distribution (Poisson) and the distribution of per task resource requirements (exponential). The author studied nine token distribution and revocation policies based on no load balancing (all tokens revoked except local token), size of local run queue, size of free memory, context switch rate, system call rate, load average, free CPU time, the logical-or of run queue length and system call rate, and the logical-and of run queue length and system call rate. The author did not study the obvious experimental control policy—all tokens valid (completely random task distribution). The best result is obtained by using the run queue length alone to determine token distribution and revocation policy. With this policy, the performance of the global system (measured only by mean response time) is a factor of two better than it is using the worst policy (no load balancing). The author points out, however, that several of the candidate token distribution policies are influenced by tasks that are no longer in the system, possibly predetermining the result. In this paper the author is interested in distributed real time systems. He uses the UNIX network only as a testbed. The casual reader should be warned that these results do not apply to distributed UNIX systems.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering  Volume 17, Issue 7
July 1991
95 pages
ISSN:0098-5589
Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 July 1991

Author Tags

  1. 1-min load average
  2. Unix
  3. Unix workstations
  4. executable workload
  5. heuristic load balancing scheme
  6. learning systems
  7. microcomputer applications
  8. one-dimensional workload descriptors
  9. run queue
  10. scheduling
  11. stochastic learning automation
  12. stochastic processes
  13. system call rate
  14. task scheduler
  15. workload descriptions

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)A dynamic load balancing mechanism for distributed systemsJournal of Computer Science and Technology10.1007/BF0294312911:3(195-207)Online publication date: 22-Mar-2023
  • (2019)Modeling industry 4.0 based fog computing environments for application analysis and deploymentFuture Generation Computer Systems10.1016/j.future.2018.08.04391:C(48-60)Online publication date: 1-Feb-2019
  • (2018)KloadavgProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167253(1122-1128)Online publication date: 9-Apr-2018
  • (2016)A Survey of Task Allocation and Load Balancing in Distributed SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2015.240790027:2(585-599)Online publication date: 1-Feb-2016
  • (2013)A tenant-based resource allocation model for scaling Software-as-a-Service applications over cloud computing infrastructuresFuture Generation Computer Systems10.1016/j.future.2011.10.01329:1(273-286)Online publication date: 1-Jan-2013
  • (2012)Dispatcher Based Dynamic Load Balancing on Web Server SystemInternational Journal of System Dynamics Applications10.4018/ijsda.20120401021:2(15-27)Online publication date: 1-Apr-2012
  • (2010)Load Balancing Algorithms in Distributed Service Architectures for Medical ApplicationsInternational Journal of Healthcare Information Systems and Informatics10.4018/jhisi.20101103055:1(76-90)Online publication date: 1-Jan-2010
  • (2010)Sender initiated decentralized dynamic load balancing for multi cluster computational grid environmentProceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India10.1145/1858378.1858441(1-4)Online publication date: 16-Sep-2010
  • (2010)Performance evaluation of web servers using central load balancing policy over virtual machines on cloudProceedings of the Third Annual ACM Bangalore Conference10.1145/1754288.1754304(1-4)Online publication date: 22-Jan-2010
  • (2010)Dynamic cluster resource allocations for jobs with known memory demandsProceedings of the International Conference and Workshop on Emerging Trends in Technology10.1145/1741906.1741918(64-69)Online publication date: 26-Feb-2010
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media