A Controlled Scheduling Algorithm Decreasing the Incidence of Starvation in Grid Environments

Authors:
Minna Liu;Kairi Ou;Yuelong Zhao;Tian Sun
Affiliations:
School of Computer Science and Engineering, South China University of Technology, Guangzhou, China 510006;School of Computer Science and Engineering, South China University of Technology, Guangzhou, China 510006;School of Computer Science and Engineering, South China University of Technology, Guangzhou, China 510006;School of Computer Science and Engineering, South China University of Technology, Guangzhou, China 510006
Venue:
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Year:
2009

Citing 6
Cited 0

Dynamic mapping of a class of independent tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems

Proceedings of the 43rd annual Southeast regional conference - Volume 1
An Effective Starvation Avoidance Mechanism to Enhance the Token Coherence Protocol

PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fair scheduling algorithm accounting for the weight and execution time of tasks is critical in the Grid environment. The MTWCT (Minimize Total Weighted Completion Time) has been proved to minimize the total weighted completion time of a set of independent tasks in a processor, but it results in another problem that the response time of some tasks is far longer. To decrease the incidence of the starvation phenomena, an improved algorithm named CSA (Controlled Scheduling algorithm) based on MTWCT is proposed, which computes the ρ factors of tasks by the execution time and weight of step chains, and selects the unexecuted step chain in terms of ρ factor and the executed time of task. Experimental results exhibit that CSA compared with the MTWCT, decreases the completion time of short tasks and the average turnaround time by sacrificing a little total weighted completion time.