Pushpa Publishing House

Journal Menu

Content

Volume 17 (2018)

Volume 16 (2016)

Volume 15 (2015)

Volume 14 (2015)

Volume 13 (2014)

Volume 12 (2014)

Volume 11 (2013)

Volume 10 (2013)

Volume 9 (2012)

Volume 8 (2012)

Volume 7 (2011)

Volume 6 (2011)

Volume 5 (2010)

Volume 4 (2010)

	Volume 4, Issue 2 Pg 93 - 184 (May 2010)
	Volume 4, Issue 1 Pg 1 - 92 (February 2010)

Volume 3 (2009)

Volume 2 (2008)

Volume 1 (2007)

Advances in Computer Science and Engineering

Advances in Computer Science and Engineering
Volume 4, Issue 2, Pages 123 - 133 (May 2010)

A DISCUSSION ON LOAD BALANCING STRATEGY FOR SCHEDULING MULTIPROCESSOR TASKS IN A GRID ENVIRONMENT
Jiann-Fu Lin, Horng-Twu Liaw, Cheng-Hsien Hsu and Lung-Fa Wang

Abstract:
Although load balancing problem in conventional parallel systems has been intensively studied, new challenges in grid environment still make it an interesting topic. In order to equally spread the load on each machine, maximize the utilization and minimize the total task processing time, many studies emphasize the importance of load balancing in a grid environment. This paper discusses if load balancing strategy works well for the problem of on-line scheduling non-preemptable multiprocessor task in a grid environment, in which the tasks are independent and each machine (node) in this grid environment contains several identical processors. We illustrate that load balancing is not necessary a good strategy for scheduling multiprocessor tasks in a grid environment by mathematically analyzing the performance bound of a heuristic algorithm with the consideration of load balancing. A simple example is also given to validate the analysis and to manifest that load balancing strategy performs poorly on the multiprocessor task scheduling problem for schedule length.

Keywords and phrases: task scheduling, grid environment, load balancing, performance bound.

Number of Downloads: 275 | Number of Views: 814