A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems
From MaRDI portal
Publication:883272
DOI10.1016/J.JPDC.2007.03.003zbMATH Open1118.68034OpenAlexW2018161377MaRDI QIDQ883272FDOQ883272
Authors: 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
Recommendations
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- A Performance Study of Task Scheduling Heuristics in HC Environment
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- A new heuristic for task scheduling in heterogeneous computing environment
- Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Cited In (8)
- New MIP model for multiprocessor scheduling problem with communication delays
- A Performance Study of Task Scheduling Heuristics in HC Environment
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
- An efficient implementation of the Min-Min heuristic
- A new heuristic for task scheduling in heterogeneous computing environment
- Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph
This page was built for publication: A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883272)
