An iterative heuristic for scheduling grid workflows with budget constraints

Workflow scheduling which guarantees anticipated QoS (quality of service) is a complex problem in grids. In this paper, the budget-constrained scheduling of workflows represented by DAG (directed acyclic graph) with the objective of time optimization is considered. A new priority rule-based iterativ...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ying-Chun Yuan, Ke-Jian Wang, Xin-Sheng Sun, Tao Guo
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!