CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems

Computationally intensive applications embodied as workflows entail interdependent tasks that involve multifarious computation requirements and necessitate Heterogeneous Distributed Computing Systems (HDCS) to attain high performance. The scheduling of workflows on HDCS was demonstrated as an NP-Com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	CCF transactions on high performance computing (Online) 2024-10, Vol.6 (5), p.472-487
Hauptverfasser:	Sirisha, D., Prasad, S. Sambhu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Branch and bound methods Computer Hardware Computer Science Computer Systems Organization and Communication Networks Critical path Distributed processing Heuristic Heuristic scheduling Regular Paper Schedules Scheduling Task scheduling Workflow
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!