This paper presents QLSE (QoS-constrained list scheduling heuristics), a quality of service-based launch time scheduling algorithm for wide area grids. QLSE considers applications described by a task interaction graph (TIG) whose nodes and edges are labeled according to the Quality of Service requirements of the application. The high values obtained in the performance evaluation for both the tasks communication and computation throughput demonstrates the applicability of the proposed approach.
QoS-constrained List scheduling heuristics for parallel applications on grids
Tonellotto N;Baraglia R;Ferrini R;
2008
Abstract
This paper presents QLSE (QoS-constrained list scheduling heuristics), a quality of service-based launch time scheduling algorithm for wide area grids. QLSE considers applications described by a task interaction graph (TIG) whose nodes and edges are labeled according to the Quality of Service requirements of the application. The high values obtained in the performance evaluation for both the tasks communication and computation throughput demonstrates the applicability of the proposed approach.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_91882-doc_128796.pdf
solo utenti autorizzati
Descrizione: QoS-constrained List scheduling heuristics for parallel applications on grids
Tipologia:
Versione Editoriale (PDF)
Dimensione
798.25 kB
Formato
Adobe PDF
|
798.25 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
