LOAD BALANCING IN AMOEBA

Durugkar S.R.¹*, Pritam Jape²*
¹SCOE, Pune, MS, India.
²KBP, Poly, Kopargaon
* Corresponding Author : pritamaditya_77@rediffmail.com

Received : -     Accepted : -     Published : 15-12-2011
Volume : 1     Issue : 1       Pages : 1 - 2
Int J Robot Appl 1.1 (2011):1-2

In this paper we represent the use of load balancing using job initiation and process migration came out on Amoeba. And also indicate the need for a load balancing facility in a distributed system to improve system performance, e.g., the average response time of processes. A number of load balancing algorithms, including the bidding and neighboring algorithms, have been studied in this work. A comparison between these algorithms under various conditions is presented, which indicates that in a system with few computers a centralized algorithm outperforms a distributed one and job initiation plays an important role in a load balancing scheme.

[1] A. Barak, A. Shiloh, and R. Wheeler. Flood Prevention in the MOSIX Load-Balancing Scheme. TCOS Newsletter, 3(1), 1989  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[2] R.M. Bryant and R.A. Finkel. A Stable Distributed Scheduling Algorithm. In Proceedings of the 2nd International Conference on Distributed Computing Systems, April 1981  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[3] T.L. Casavant and J.G. Kuhl. A Taxonomy of Scheduling in General-purpose Distributed Computing Systems. IEEE Tkans. on Software Eng., 14(2), Feb. 1988  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[4] F. Douglis and J. Ousterhout. Transparent Process Migration: Design Alternatives and Sprite Implementation. Software and Ezperience, 1991  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus  

[5] P.K. Sinha, Distributed operating System  
» CrossRef   » Google Scholar   » PubMed   » DOAJ   » CAS   » Scopus