ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

IMMEDIATE/BATCH MODE SCHEDULING ALGORITHMS FOR GRID COMPUTING: A REVIEW

Journal: INTERNATIONAL JOURNAL OF RESEARCH -GRANTHAALAYAH (Vol.5, No. 7)

Publication Date:

Authors : ; ; ;

Page : 1-13

Keywords : Grid Computing; Scheduling; MET; MCT; Min-Min; Max-Min;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Immediate/on-line and Batch mode heuristics are two methods used for scheduling in the computational grid environment. In the former, task is mapped onto a resource as soon as it arrives at the scheduler, while the later, tasks are not mapped onto resource as they arrive, instead they are collected into a set that is examined for mapping at prescheduled times called mapping events. This paper reviews the literature concerning Minimum Execution Time (MET) along with Minimum Completion Time (MCT) algorithms of online mode heuristics and more emphasis on Min-Min along with Max-Min algorithms of batch mode heuristics, while focusing on the details of their basic concepts, approaches, techniques, and open problems.

Last modified: 2017-08-16 18:45:23