Resource allocation algorithm for light communication grid-based workflows within an SLA context

DOI10.1080/17445760802225868zbMath1181.68021OpenAlexW2059289731WikidataQ62044995 ScholiaQ62044995MaRDI QIDQ3612794

Minh Quan Dang, Jörn Altmann

Publication date: 10 March 2009

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760802225868

zbMATH Keywords

mappinggrid computingservice level agreementlight communication workflow

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Uses Software

• GridFlow
• Pegasus

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Effective neighbourhood functions for the flexible job shop problem
• An advanced tabu search algorithm for the job shop problem
• C.P.M. Scheduling with Small Communication Delays and Task Duplication
• Tabu Search—Part I
• Tabu Search—Part II
• A comparison of list schedules for parallel processing systems
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems