Implementation of a proactive load sharing scheme

This paper presents a proactive approach to load sharing and describes the architecture of a scheme, Concert, based on this approach. A proactive approach is characterized by a shift of emphasis from reacting to load imbalance to avoiding its occurrence. In contrast, in a reactive load sharing scheme, activity is triggered when a processing node is either overloaded or underloaded. The main drawback of this approach is that a load imbalance is allowed to develop before costly corrective action is taken. Concert is a load sharing scheme for loosely-coupled distributed systems. Under this scheme, load and task behaviour information is collected and cached in advance of when it is needed. Concert uses Linux as a platform for development. Implemented partially in kernel space and partially in user space, it achieves transparency to users and applications whilst keeping the extent of kernel modifications to a minimum. Non-preemptive task transfers are used exclusively, motivated by lower complexity, lower overheads and faster transfers. The goal is to minimize the average response-time of tasks. Concert is compared with other schemes by considering the level of transparency it provides with respect to users, tasks and the underlying operating system.

[1]  B. Srinivasan,et al.  A migration tool to support resource and load sharing in heterogeneous computing environments , 1997, Comput. Commun..

[2]  Mark Nuttall,et al.  A brief survey of systems providing process or object migration facilities , 1994, OPSR.

[3]  Fred Douglis,et al.  Transparent process migration: Design alternatives and the sprite implementation , 1991, Softw. Pract. Exp..

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

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

[6]  Junguk L. Kim,et al.  An All-Sharing Load-Balancing Scheme on the COMA/CD Network and its Analysis , 1994, Comput. J..

[7]  Richard Anthony,et al.  A Model of Process Behavior, for Predictive Load Sharing , 1999, Applied Informatics.

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

[9]  R. Sureswaran,et al.  LOADIST: a distributed processing environment based on load sharing , 1995, Proceedings of IEEE Singapore International Conference on Networks and International Conference on Information Engineering '95.

[10]  Anders Svensson History, an intelligent load sharing filter , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[11]  Dejan S. Milojicic,et al.  Process migration , 1999, ACM Comput. Surv..

[12]  Brendan Tangney,et al.  Micro-kernel support for migration , 1994, Distributed Syst. Eng..

[13]  Andrzej M. Goscinski,et al.  Towards an operating system managing parallelism of computing on clusters , 2000, Future Gener. Comput. Syst..

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

[15]  Andrzej M. Goscinski,et al.  GENESIS: an efficient, transparent and easy to use cluster operating system , 2002, Parallel Comput..