An Optimal Algorithm for Scheduling Tasks within Deadline and Budget Constraints

Author

Song, Hu ; Yang, Shoubao ; Wu, Bin ; Liu, Xiaoqian ; Guo, Liangmin

Author_Institution

Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2009

fDate

25-27 Aug. 2009

Firstpage

62

Lastpage

65

Abstract

In the market-oriented grid environment, clients make use of grid computing resources to execute many independent tasks. According to the urgency of tasks and deficiency of client´ budget, not all the tasks could be completed as demanded. To maximize the number of completed tasks, a linear programming model based scheduling algorithm (LMBS) is proposed in this paper. Comparing with other algorithms, experiment results show that performance of LMBS is much better obviously.

Keywords

budgeting; grid computing; linear programming; scheduling; budget constraints; deadline constraints; grid computing resources; linear programming model; market-oriented grid environment; scheduling tasks; Computer science; Constraint optimization; Costs; Grid computing; Large-scale systems; Linear programming; Processor scheduling; Resource management; Scheduling algorithm; Time factors; linear programming model; market-oriented grid; scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

INC, IMS and IDC, 2009. NCM '09. Fifth International Joint Conference on

Conference_Location

Seoul

Print_ISBN

978-1-4244-5209-5

Electronic_ISBN

978-0-7695-3769-6

Type

conf

DOI

10.1109/NCM.2009.35

Filename

5331751