Open AccessResearch on Fine-grained Job scheduling in Grid Computing
Author(s) -
Yeqing Liao,
Quan Liu
Publication year - 2009
Publication title -
international journal of information engineering and electronic business
Language(s) - English
Resource type - Journals
eISSN - 2074-9031
pISSN - 2074-9023
DOI - 10.5815/ijieeb.2009.01.02
Subject(s) - computer science , distributed computing , job scheduler , grid computing , grid , scheduling (production processes) , fair share scheduling , dynamic priority scheduling , flow shop scheduling , rate monotonic scheduling , the internet , parallel computing , operating system , mathematical optimization , cloud computing , schedule , mathematics , geometry
Grid computing is the technology used in building Internet-wide computing environment and integrating distributed and heterogeneous resources. However, in Grid environment, job scheduling is confronted with a great challenge. This paper focuses on lightweight jobs scheduling in Grid Computing. An Adaptive Fine-grained Job Scheduling (AFJS) algorithm is proposed. Compared with other fine-grained job scheduling algorithms based on grouping, AFJS can outperform them according to the experimental results. And some other related problems are also illustrated.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom