BALANCE-a flexible parallel load balancing system for heterogeneous computing systems and networks

The design philosophy and implementation of the BALANCE system is described. BALANCE is a flexible, network independent and computer architecture independent load balancing system which is designed to support a wide range of software, including parallel and distributed applications as well as schedulers. The generic server and server system call structures are used as bases to enhance flexibility and to build complex services. BALANCE is not tied to a particular scheduling algorithm, rather the users are allowed to build their own schedulers. To demonstrate the flexibility and power of BALANCE, a set of system services and scheduling algorithms has been implemented and evaluated. A new delay scheduling algorithm which postpones the execution of jobs in high load situation is proposed. It is shown that this algorithm effectively improves system throughput and yet bounds the response times for the console commands.

[1]  Thomas Kunz,et al.  The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..

[2]  Gholamali C. Shoja.  A distributed facility for load sharing and parallel processing among workstations , 1991, J. Syst. Softw..

[3]  Jingwen Wang,et al.  Utopia: A load sharing facility for large, heterogeneous distributed computer systems , 1993, Softw. Pract. Exp..

[4]  R. Chawla,et al.  The Stealth distributed scheduler , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[5]  Benjamin W. Wah,et al.  Implementation of GAMMON: An Efficient Load Balancing Strategy for a Local Computer System , 1989, ICPP.

[6]  S. Manoharan,et al.  Taxonomy for assignment in parallel processor systems , 1991, [1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications.

[7]  Bruce M. McMillin,et al.  DAWGS - A Distributed Compute Server Utilizing Idle Workstations , 1992, J. Parallel Distributed Comput..

[8]  T. Kunz.  The Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme the Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme , 2007 .

[9]  M. Yue.  On the exact upper bound for the multifit processor scheduling algorithm , 1990 .

[10]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[11]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[12]  James R. Lyle,et al.  Load balancing from a Unix shell , 1988, Proceedings [1988] 13th Conference on Local Computer Networks.

[13]  Matt W. Mutka.  A comparison of workload models of the capacity available for sharing among privately owned workstations , 1991, Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences.

[14]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[15]  Samuel T. Chanson,et al.  Allocating Task Interaction Graphs to Processors in Heterogeneous Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[16]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..