A task duplication based bottom-up scheduling algorithm for heterogeneous environments

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages 12-

  Bozdaǧ, Doruk ^a   Catalyurek, Umit ^a,b   Özgüner, Füsun ^a  

^a Ohio State University   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; SCHEDULING;

BOTTOM UP SCHEDULING ALGORITHM; MAKESPANS; TASK DUPLICATION; TASK INSERTION;

PARALLEL ALGORITHMS;

EID: 33847137784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639389     Document Type: Conference Paper

References (14)

1. I. Ahmad and Y.-K. Kwok. On exploiting task duplication in parallel program scheduling. IEEE Transactions on Parallel and. Distributed Systems, 9(9): 872-892, September 1998.
2. R. Bajaj and D. Agrawal. Improving scheduling of tasks in a heterogeneous environment. IEEE Transactions on Parallel and Distributed Systems, 15(2): 107-118, February 2004.
3. S. Bakiyar and P. SaiRanga. Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length. Proceedings of the International Conference on Parallel Processing Workshops, pages 97-103, October 2003.
4. C. Boeres, J. Filho, and V. Rebello. A cluster-based strategy for scheduling task on heterogeneous processors. Symposium on Computer Architecture and High Performance Computing, pages 214-221, October 2004.
5. D. Bozdag, F. Özgüner, E. Ekici, and U. Catalyurek. A task duplication based scheduling algorithm using partial schedules. Proceedings of International Conference on Parallel Processing, pages 630-637, June 2005.
6. T.-Y. Choe and C.-I. Park. A task duplication based scheduling algorithm with optimality condition in heterogeneous systems. Proceedings of the International Conference on Parallel Processing Workshops, pages 531-536, August 2002.
7. B. Cirou and E. Jeannot. Triplet: A clustering scheduling algorithm for heterogeneous systems. Proceedings of the International Conference on Parallel Processing Workshops, pages 231-236, September 2001.
8. A. Dogan and F. Özgüner. LDBS: A duplication based scheduling algorithm for heterogeneous computing systems. Proceedings of the International Conference on Parallel Processing, pages 352-359, August 2002.
9. M. Garey and D. Johnson. Computers and Intractability, A Guide to the Theory of NP Completeness. W.H. Freeman and Co., 1979.
10. T. Hagras and J. Janecek. A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Proceedings of the International Parallel and Distributed Processing Symposium, pages 107-115, April 2004.
11. M. Iverson, F. Özgüner, and L. Potter. Statistical prediction of task execution times through analytical benchmarking for scheduling in a heterogeneous environment. IEEE Transactions on Computers, 48(12): 1374-1379, December 1999.
12. A. Radulescu and A. van Gemund. Fast and effective task scheduling in heterogeneous systems. Proceedings of the Heterogeneous Computing Workshop, pages 229-238, May 2000.
13. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, March 2002.
14. J. Yang, A. Khokhar, S. Sheikh, and A. Ghafoor. Estimating execution time for parallel tasks in heterogeneous processing (hp) environment. International Parallel Processing Symposium Workshop on Heterogeneous Computing, pages 23-28, April 1994.