On-Line task granularity adaptation for dynamic grid applications

Authors:
Nithiapidary Muthuvelu;Ian Chai;Eswaran Chikkannan;Rajkumar Buyya
Affiliations:
Persiaran Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia;Persiaran Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia;Persiaran Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia;Dept of Computer Science and Software Engineering, The University of Melbourne, Carlton, Victoria, Australia
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 8
Cited 2

Grids and grid technologies for wide-area distributed computing

Software—Practice & Experience
Grid Computing: Making the Global Infrastructure a Reality

Grid Computing: Making the Global Infrastructure a Reality
A dynamic job grouping-based scheduling for deploying applications with fine-grained tasks on global grids

ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
Neuroscience instrumentation and distributed analysis of brain activity data: a case for eScience on global Grids: Research Articles

Concurrency and Computation: Practice & Experience
The Internet Operating System: Middleware for Adaptive Distributed Computing

International Journal of High Performance Computing Applications
Introduction to grid computing

Introduction to grid computing
Group-Based Optimizaton for Parallel Job Scheduling with Scojo-PECT-O

HPCS '08 Proceedings of the 2008 22nd International Symposium on High Performance Computing Systems and Applications
Resource usage policy expression and enforcement in grid computing

GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing

Task granularity policies for deploying bag-of-task applications on global grids

Future Generation Computer Systems
On-Line, non-clairvoyant optimization of workflow activity granularity on grids

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.