On-Line Task Granularity Adaptation for Dynamic Grid Applications


Nithiapidary, Muthuvelu and Rajkumar, Buyya and Eswaran, Chikkannan and Chai, Ian (2010) On-Line Task Granularity Adaptation for Dynamic Grid Applications. In: Algorithms and Architectures for Parallel Processing. Lecture Notes in Computer Science . Springer Berlin Heidelberg, 10th International Conference, ICA3PP 2010, Busan, Korea, May 21-23, 2010. Proceedings. Part I, pp. 266-277. ISBN 978-3-642-13118-9

Full text not available from this repository.


Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting computation-communication ratio by adjusting the task granularity at the grid scheduler. We propose an on-line scheduling algorithm which performs task grouping to support an unlimited number of user tasks, arriving at the scheduler at runtime. The algorithm decides the task granularity based on the dynamic nature of a grid environment: task processing requirements; resource-network utilisation constraints; and users QoS requirements. Simulation results reveal that our algorithm reduces the overall application processing time and communication overhead significantly while satisfying the runtime constraints set by the users and the resources.

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: 08 Nov 2013 09:01
Last Modified: 08 Nov 2013 09:01
URII: http://shdl.mmu.edu.my/id/eprint/4373


Downloads per month over past year

View ItemEdit (login required)