A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems

DOI10.1016/j.jpdc.2007.03.003zbMath1118.68034OpenAlexW2018161377MaRDI QIDQ883272

Ping Luo, Kevin Lü, Zhongzhi Shi

Publication date: 4 June 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.03.003

zbMATH Keywords

heterogeneous computingindependent tasksgreedy heuristictask consistencytask priority graph

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (4)

An efficient implementation of the Min-Min heuristic ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ A Performance Study of Task Scheduling Heuristics in HC Environment ⋮ A new heuristic for task scheduling in heterogeneous computing environment

This page was built for publication: A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems