An Adaptive And Parameterized Job Grouping Algorithm For Scheduling Grid Jobs


Muthuvelu, Nithiapidary and Chai, Ian and Eswaran, C. (2008) An Adaptive And Parameterized Job Grouping Algorithm For Scheduling Grid Jobs. In: 10th International Conference on Advanced Communication Technology, 2008. ICACT 2008. IEEE, 975 -980. ISBN 978-89-5519-136-3

[img] Text
04493929.pdf - Published Version
Restricted to Repository staff only

Download (1MB)


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: Book Section
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 14 Nov 2013 07:24
Last Modified: 14 Nov 2013 07:24


Downloads per month over past year

View ItemEdit (login required)