Two Approaches of Workflow Scheduling with QoS in the Grid

Two Approaches of Workflow Scheduling with QoS in the Grid

Fangpeng Dong (Queen’s University, Canada) and Selim G. Akl (Queen’s University, Canada)
DOI: 10.4018/978-1-60566-370-8.ch001
OnDemand PDF Download:


Over the past decade, Grid Computing has earned its reputation by facilitating resource sharing in larger communities and providing non-trivial services. However, for Grid users, Grid resources are not usually dedicated, which results in fluctuations of available performance. This situation raises concerns about the quality of services (QoS). The meaning of QoS varies with different concerns of different users. Objective functions that drive job schedulers in the Grid may be different from each other as well. Some are system-oriented, which means they make schedules to favor system metrics such as throughput,load-balance, resource revenue and so on. To narrow the scope of the problem to be discussed in this chapter and to make the discussion substantial, the scheduling objective function considered is minimizing the total completion time of all tasks in a workflow (also known as the makespan). Correspondingly, the meaning of QoS is restricted to the ability that scheduling algorithms can shorten the makespan of a workflow in an environment where resource performance is vibrant. This chapter introduces two approaches that can provide QoS features at the workflow scheduling algorithm level in the Grid. One approach is based on a workflow rescheduling technique, which can reallocate resources for tasks when a resource performance change is observed. The other copes with the stochastic performance change using pre-acquired probability mass functions (PMF) and produces a probability distribution of the final schedule length, which will then be used to handle the different QoS concerns of the users.

Complete Chapter List

Search this Book: