Research Article
A model for parallel job scheduling on dynamical computer Grids
Article first published online: 26 MAR 2004
DOI: 10.1002/cpe.825
Copyright © 2004 John Wiley & Sons, Ltd.
Issue
1532-0634/asset/cover.gif?v=1&s=6094df24c795ce080ff6df6ff3b6bcec19adb708)
Concurrency and Computation: Practice and Experience
Special Issue: Middleware for Grid Computing
Volume 16, Issue 5, pages 461–468, 25 April 2004
Additional Information
How to Cite
Goldman, A. and Queiroz, C. (2004), A model for parallel job scheduling on dynamical computer Grids. Concurrency and Computation: Practice and Experience, 16: 461–468. doi: 10.1002/cpe.825
Publication History
- Issue published online: 26 MAR 2004
- Article first published online: 26 MAR 2004
- Manuscript Revised: 10 SEP 2003
- Manuscript Accepted: 5 SEP 2003
- Manuscript Received: 10 AUG 2003
Funded by
- CNPq proc.. Grant Number: 55.2028/02-9
- Abstract
- References
- Cited By
Keywords:
- Grid computing;
- multi-site execution;
- scheduling of parallel applications
Abstract
This work presents a model that allows the execution of parallel applications in a Grid environment. Our main focus is on how to share the idle cycles of clusters and computers to execute real parallel applications. We present a new model which introduces the notions of locality and adaptability. The locality is used for job allocation, and for job migration. The adaptability provides a simple mechanism to allow clusters to join or leave a Grid. We also propose the middleware architecture to implement the model, and provide some simulation results to show the main characteristics of the model. Copyright © 2004 John Wiley & Sons, Ltd.

1532-0634/asset/olbannerleft.gif?v=1&s=a4e4e145787de94e1d91eaab3c8c29d8a9d96a26)