Load balancing consideration of both transmission and process responding time for multi-task assignment
by Yean-Fu Wen; Chih-Lung Chang
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 4, No. 2, 2014

Abstract: The existing load balancing research mainly the unilateral fairness of the transmission network or only stand for the processing host to handle fairness issue. This work addresses the load balancing between network and host to assign tasks to the related hosts along the path with minimal processing and transmission delays subject to the capacity of processing hosts and transmission links. Three task schedulers: first-come-first-service (FCFS), minimum task assign to minimum completion time (Min-Min), and the proposed minimised the maximal process and transmission time (Min-Max) allocation mechanisms, are adopted along with biased random sampling (BRS) mechanism to observe the distribution of interactive results. This study changes three variables manipulated with the number of hosts, the number of tasks, and the expected processing time and records the maximal/average responding time and fairness index, to analyse the load balancing results. The results show that the Min-Max and BRS of the match that is used to obtain the lowest responding time to satisfy the requirement of users.

Online publication date: Sat, 05-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com