A high performance,low complexity algorithm for compile-time task scheduling in heterogeneous systems
Authors:
- T. HagrasTHT. Hagras
- J. JanecekJJJ. Janecek
- 10 June 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments2004
- DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems2002
- A fast and scalable scheduling algorithm for distributed memory systems2002
- S3MP: a task duplication based scalable scheduling algorithm for symmetric multiprocessors2002
- Fast and effective task scheduling in heterogeneous systems2002
- A heuristic algorithm for mapping communicating tasks on heterogeneous resources2002
- Heterogeneous Distributed Computing1999
- Benchmarking the task graph scheduling algorithms1998
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996
- A New Approach to Scheduling Parallel Programs Using Task Duplication1994