A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems
From MaRDI portal
Publication:883272
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)- Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous 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
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph
- New MIP model for multiprocessor scheduling problem with communication delays
- An efficient implementation of the Min-Min heuristic
- A Performance Study of Task Scheduling Heuristics in HC Environment
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)
