QoS guided min-min heuristic for grid task scheduling
From MaRDI portal
Publication:1411584
DOI10.1007/BF02948918zbMath1031.68034OpenAlexW2135938932MaRDI QIDQ1411584
XiaoShan He, Gregor Von Laszewski, Xian-He Sun
Publication date: 29 October 2003
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02948918
Related Items (9)
Entropic grid scheduling ⋮ An efficient implementation of the Min-Min heuristic ⋮ A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow ⋮ Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments ⋮ A genetic algorithm for task scheduling on NoC using FDH cross efficiency ⋮ Maximizing business value by optimal assignment of jobs to resources in grid computing ⋮ Cost-based decision-making in middleware virtualization environments ⋮ A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid ⋮ A minmax regret version of the time-dependent shortest path problem
Uses Software
Cites Work
This page was built for publication: QoS guided min-min heuristic for grid task scheduling
