Rapid distribution of tasks on a commodity grid

Authors:
Ladislau Bölöni;Damla Turgut;Taskin Kocak;Yongchang Ji;Dan C. Marinescu
Affiliations:
Department of Electrical and Computer Engineering, Orlando, FL;Department of Electrical and Computer Engineering, Orlando, FL;Department of Electrical and Computer Engineering, Orlando, FL;School of Computer Science, University of Central Florida, Orlando, FL;School of Computer Science, University of Central Florida, Orlando, FL
Venue:
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Year:
2005

Citing 5
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
On Fully Decentralized Resource Discovery in Grid Environments

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Orientation Refinement of Virus Structures with Unknown Symmetry

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A computational framework for the 3D structure determination of viruses with unknown symmetry

Journal of Parallel and Distributed Computing - High-performance computational biology
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management of commodity tasks from the tasks requiring specialized resources. We show that the performance of task execution on a commodity grid is the delay of entering into execution. This effectively transforms the resource allocation problem into a routing problem. We present an approach in which commodity tasks are distributed to the computation service providers by the use of a forwarding mesh based on randomized Hamilton cycles. We provide stochastically weighted algorithms for forwarding. Mathematical analysis and extensive simulations demonstrate that the approach is scalable and provides efficient task allocation on networks loaded up to 95% of their capacity.