An adaptive generalized scheduler for grid applications
The compute resources of a grid resource-service provider may be distributed over a wide geographical area. If the resource-service provider is to use his resources effectively, in addition to the characteristics of the compute-nodes and the applications, the characteristics of the communication net...
Saved in:
Published in | 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05) pp. 188 - 194 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2005
|
Subjects | |
Online Access | Get full text |
ISBN | 0769523439 9780769523439 |
ISSN | 1550-5243 |
DOI | 10.1109/HPCS.2005.14 |
Cover
Summary: | The compute resources of a grid resource-service provider may be distributed over a wide geographical area. If the resource-service provider is to use his resources effectively, in addition to the characteristics of the compute-nodes and the applications, the characteristics of the communication network must also be known. A generalized scheduler should be able to handle a diverse set of jobs, with arbitrary inter-dependencies among processes and arbitrary communication channel delays. On a grid, the scheduling algorithm should respond quickly to the changing workload and environmental conditions without causing much overhead. Hence it should be able to customize its strategy in accordance with the prevailing conditions. In this paper, the algorithm for an adaptive scheduler, which can be used to map a set of jobs, of wide diversity, to a dynamic set of nodes, with prior reservations, is being presented. The scheduler has been tested extensively. |
---|---|
ISBN: | 0769523439 9780769523439 |
ISSN: | 1550-5243 |
DOI: | 10.1109/HPCS.2005.14 |