Distributed job scheduling on computational Grids using multiple simultaneous requests

Even though middleware support for grid computing has been the subject of extensive research, scheduling policies for the grid context have not been much studied. In addition to processor utilization, it is important to consider the response times of jobs in evaluating the performance of grid schedu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:11th International Symposium on High-Performance Distributed Computing (HPDC-11 2002) s. 359 - 366
Hlavní autori: Subramani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, S.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2002
Predmet:
Computational modeling
Delay
Distributed computing
Grid computing
Information science
Metacomputing
Performance loss
Processor scheduling
Runtime
Supercomputers
ISBN:0769516866, 9780769516868
ISSN:1082-8907
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Even though middleware support for grid computing has been the subject of extensive research, scheduling policies for the grid context have not been much studied. In addition to processor utilization, it is important to consider the response times of jobs in evaluating the performance of grid scheduling strategies. In this paper we propose distributed scheduling algorithms that use multiple simultaneous requests at different sites. Trace-based simulations show that the use of multiple simultaneous requests provides significant performance benefits. We also show how this scheme can be adapted to provide priority to local jobs, without much loss of performance.
Bibliografia:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:0769516866
9780769516868
ISSN:1082-8907
DOI:10.1109/HPDC.2002.1029936