Resource co-allocation for parallel tasks in computational grids

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Tasks running in computational Grids may require multiple types of resources simultaneously. Thus, co-allocation of multiple types of resources is needed when scheduling tasks. Traditional list scheduling heuristics cannot address the problem of resource co-allocation in computational Grids. This paper presents models for computational Grids and parallel tasks running in computational Grids. Based on these models, a parallel task scheduling algorithm for resource co-allocation in computational Grids is proposed. The algorithm identifies the critical resource of parallel tasks and tries to schedule a task as early as possible when all the resources required by the task are available. Simulation results show that the algorithm can gain performance improvement, especially in the resource competitive computational Grid.

Cite

CITATION STYLE

APA

Wang, L., Cai, W., Lee, B. S., See, S., & Jie, W. (2003). Resource co-allocation for parallel tasks in computational grids. In Proceedings of the International Workshop on Challenges of Large Applications in Distributed Environments, CLADE 2003 (pp. 88–95). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/CLADE.2003.1210004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free