An adaptive and parameterized job grouping algorithm for scheduling grid jobs


Nithiapidary, Muthuvelu and Ian, Chai and C., Eswaran (2008) An adaptive and parameterized job grouping algorithm for scheduling grid jobs. In: 10th International Conference on Advanced Communication Technology , 17-20 FEB 2008 , Phoenix Pk, SOUTH KOREA.

Full text not available from this repository.


An unorganized deployment of grid applications with a large amount of fine-grain jobs would let the communication overhead dominate the overall processing time, resulting in a low computation-communication ratio. Grid's dynamic nature complicates the planning of the job scheduling activity for minimizing the application processing time. This paper presents a grid job scheduling algorithm, based on a parameterized job grouping strategy, which is adaptive to the runtime grid environment. Jobs are grouped based on the job processing requirements, resource policies, network conditions and user's QoS requirements. Simulations using the GridSim toolkit reveal that the algorithm reduces the overall application processing time significantly.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 21 Sep 2011 07:38
Last Modified: 21 Sep 2011 07:38


Downloads per month over past year

View ItemEdit (login required)