R. Anane
ABSTRACT
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.
- Anthony R., Load Sharing in Loosely-Coupled Distributed Systems: A rich information approach, D. Phil. thesis, Computer Science, University of York, UK, March 2000Google Scholar
- Anthony R., Goodeve D., A New Metric for expressing CPU Load, Proc 4th International Conference on Computer Science and Informatics, North Carolina, 3, 229--234, October 1998, Association for Intelligent MachineryGoogle Scholar
- Anthony R., Goodeve D., A Model of Process Behaviour, for Predictive Load Sharing, Proc 17th International Conference on Applied Informatics, Innsbruck, 226--230, February 1999, IASTEDGoogle Scholar
- Clark H., McMillin B., DAWGS - A Distributed Compute Server Utilizing Idle Workstations, Journal of Parallel and Distributed Computing, 175--186, 1992, Academic Press Google ScholarDigital Library
- Douglis F., Ousterhout J., Transparent Process Migration: Design Alternatives and the Sprite Implementation, Software - Practice and Experience, 21(8), 757--785, 1991, John Wiley Google ScholarDigital Library
- Goscinski A., Towards an operating system managing parallelism of computing on clusters, Future Generation Computer Systems, 17, 293--314, 2000, Elsevier Science Google ScholarDigital Library
- Goscinski A., Hobbs M., Silcock J., GENESIS: an efficient, transparent and easy to use cluster operating system, Parallel Computing, 28, 557--606, 2002, Elsevier Science Google ScholarDigital Library
- Hao Y., Liu J. S., Kim J., An All-Sharing load-Balancing Scheme on the CSMA/CD Network and its analysis, The Computer Journal, 37(4) 779--794, 1994Google ScholarCross Ref
- Krueger P., Chawla R., The Stealth Distributed Scheduler, Proc 11th Intl conference on distributed computing systems, 336--343, 1991, IEEEGoogle Scholar
- Le P., Srinivasan B., A migration tool to support resource and load sharing in heterogeneous computing environments, Computer Communications, 20, 361--375, 1997, Elsevier Science Google ScholarDigital Library
- Litzkow M. J., Livny M., Mutka M. W., Condor - A Hunter of Idle Workstations, Proc 8th International Conference on Distributed Computing Systems, 104--111, June 1988, IEEEGoogle Scholar
- Milojici D. S., Douglis F., Paindeveine Y., Wheeler R., Zhou S., Process Migration, Computing Surveys, 32(3), 241--299, September 2000, ACM Google ScholarDigital Library
- Nuttall M., A brief survey of systems providing process or object migration facilities, Operating Systems Review, 28(4), 64--80, 1994, ACM Google ScholarDigital Library
- O'Connor M., Tangney B., Cahill V., Harris N., Micro-Kernel support for migration, Distributed Systems Engineering, 1, 212--223, 1994, BCSGoogle ScholarCross Ref
- Sureswaran R., Samaka M., Knaggs J., LOADIST: A Distributed Processing Environment Based on Load Sharing, Proc Singapore Intl Conf on Networks / Intl Conf on Information Engineering, 518--522, 1995, IEEEGoogle ScholarCross Ref
- Svensson A., History, an Intelligent Load Sharing Filter, Proc 10th Intl Conference on Distributed Computing Systems, 546--533, 1990, IEEEGoogle Scholar
- Thomas A., Neilsen M., A Load Sharing System for a Network of Independent Workstations, Proc Intl Conf on Intelligent Information Systems, 97--100, 1995, ISMM-ACTA PressGoogle Scholar
- Zhou S., Zheng X., Wang J., Delisle P., Utopia: A Load Sharing Facility for Large Heterogeneous Distributed Computer Systems, Software - Practice and Experience, 23(12), 1305--1336, 1993, John Wiley Google ScholarDigital Library
Recommendations
Analysis of coordinated load sharing for large distributed systems
The performance of a distributed system (DS) is limited by how good the load sharing scheme used in the system is. This fact is especially true for a large-scale DS where the communication bandwidth between machines may be limited. Load sharing is the ...
A Proactive Secure Multisecret Sharing Threshold Scheme
SNPD '07: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01This paper presents a new proactive secure multisecret sharing threshold scheme. In the scheme, participants can share multiple secrets and compute sub-secret for rebuilding efficiently and securely, and sub-secret hold by participant is verifiable. The ...
A least flow-time first load sharing approach for distributed server farm
The most critical property exhibited by a heavy-tailed workload distribution (found in many WWW workloads) is that a very small fraction of tasks make up a large fraction of the workload, making the load very difficult to distribute in a distributed ...
Comments