A two-step QoS priority for scheduling in Grid

Author

Panda, S.K. ; Khilar, Pabitra Mohan

Author_Institution

Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Rourkela, India

fYear

2012

fDate

6-8 Dec. 2012

Firstpage

502

Lastpage

507

Abstract

Quality of Service (QoS) is an important property of Scheduling. Demand of QoS is varying from application to application. In the case of scheduling, it is nothing but task and processor requirements. Task requirement refers to bandwidth, speed, operating system, architecture and many more of the processor. But, processor requirement refers to data size, location, deadline, trust level and many more of the task. Our goal is to match and schedule the task-processor pair which leads to reduction in Makespan. In this paper, we propose a two-step QoS priority for scheduling in Grid. Bounded and unbounded priorities are introduced as a two-step priority. Based on the priority, tasks are schedule to the processor. Our experiment case shows optimum result than previous scheduling algorithms like Min-Min, QoS guided Min-Min algorithm.

Keywords

processor scheduling; quality of service; QoS guided min-min algorithm; bandwidth requirement; data location; data size; grid scheduling; makespan reduction; operating system; processor requirements; quality of service; task requirements; task-processor pair scheduling; trust level; two-step QoS priority; Amplitude shift keying; Flowcharts; Quality of service; Quality of Service; makespan; priority; scheduling; sufferage;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on

Conference_Location

Solan

Print_ISBN

978-1-4673-2922-4

Type

conf

DOI

10.1109/PDGC.2012.6449872

Filename

6449872