Communication contention in APN list scheduling algorithm

Science in China, Series F: Information Sciences

Volumn 52, Issue 1, 2009, Pages 59-69

  Tang, Xiaoyong ^a,b   Li, Kenli ^a   Padua, Divid ^c  

^a HUNAN UNIVERSITY   (China)

^b HUNAN AGRICULTURAL UNIVERSITY   (China)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Arbitrary processor network; Communication contention; DAG; List scheduling; Parallel algorithm

Indexed keywords

EID: 58149510939     PISSN: 10092757     EISSN: 18622836     Source Type: Journal    
DOI: 10.1007/s11432-009-0010-3     Document Type: Article

References (29)

1. G. C. Sih E. A. Lee 1993 A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures IEEE Trans Parallel Distrib Syst 4 2 175 187
2. Gary M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Co., 1979
3. I. Ahmad Y.-K. Kwok 1998 On exploiting task duplication in parallel program scheduling IEEE Trans. Parallel Distrib. Systems 9 9 872 892
4. S. Darbha D. P. Agrawal 1998 Optimal scheduling algorithm for distributed-memory machines IEEE Trans Parallel Distrib Syst 9 1 87 95
5. C. H. Papadimitriou M. Yannakakis 1990 Towards an architecture- Independent analysis of parallel algorithms SIAM J Comput 19 2 322 328
6. M. Dhodhi I. Ahmad A. Yatama 2002 An integrated technique for task matching and scheduling onto distributed heterogeneous computing system J Parallel Distrib Comput 62 9 1338 1361
7. Topcuoglu H, Hariri S, Wu M Y. Task scheduling algorithms for heterogeneous machines. In: Proceedings of the Heterogeneous Computing Workshop, Mexico, 1999. 3-14
8. A. Radulescu A. J. C. van Gemund 2002 Low-cost task scheduling for distributed-memory machines IEEE Trans Parallel Distrib Syst 13 6 648 658
9. H. J. Park B. K. Kim 2001 An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors J Syst Software 56 3 213 229
10. D. Kim B. G. Yi 1994 A two-pass scheduling algorithm for parallel programs Parallel Comput 20 6 869 885
11. Y. -K. Kwok I. Ahmad 1996 Dynamic critical-path scheduling: an effective technique for allocating task graphs onto multiprocessors IEEE Trans Parallel Distrib Syst 7 5 506 521
12. O. Sinnen L. A. Sousa 2005 Communication contention in task scheduling TIEEE Trans Parallel Distrib Syst 6 6 503 515
13. O. Sinnen L. A. Sousa 2004 List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures Parallel Comput 30 1 81 101
14. H. El-Rewini T. G. Lewis 1990 Scheduling parallel program tasks onto arbitrary target machines J Parallel Distrib Comput 9 2 138 153
15. Iverson M, Ozuner F, Follen G. Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of Heterogeneous Computing Workshop, 1995. 93-100
16. G. Q. Liu K. L. Poh M. Xie 2005 Iterative list scheduling for heterogeneous computing J Parallel Distrib Comput 65 5 654 665
17. H. Topcuoglu S. Hariri M. -Y. Wu 2002 Performance-effective and low complexity task scheduling for heterogeneous computing IEEE Trans Parallel Distrib Syst 13 3 260 274
18. Macey B S, Zomaya A Y. A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In: Parallel Processing Symposium, 1998. 538-541
19. I. Ahmad Y. K. Kwok 1999 On parallelizing the multiprocessor scheduling problem IEEE Trans Parallel Distrib Syst 10 4 414 432
20. Y. -K. Kwok I. Ahmad 1997 Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm J Parallel Distrib Comput 47 1 58 77
21. I. De Falco R. Del Balio E. Tarantino 1997 An analysis of parallel heuristics for task allocation in multicomputers Computing: Archiv fuÈr Informatik und Numerik 59 3 259 275
22. I. Pramanick J. G. Kuhl 1995 An inherently parallel method for heuristic problem-solving: Part general framework IEEE Trans Parallel Distrib Syst 6 10 1006 1015
23. Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. Cambridge: MIT Press, 1990
24. Culler D E, Singh J P. Parallel Computer Architecture. San Fransisco: Morgan Kaufmann Publishers, 1999
25. Sinnen O, Sousa L. Exploiting unused time slots in list-scheduling considering communication contention. In: Euro-Par 2001 Parallel Processing, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2001, 2150: 166-170
26. B. Lee A. R. Hurson T. Y. Feng 1991 A vertically layered allocation scheme for data flow systems J Parallel Distrib Comput 11 175 187
27. C. V. Ramamoorthy K. M. Chandy M. J. Gonzalez 1972 Optimal scheduling strategies in a multiprocessor system IEEE Trans Comput 21 137 146
28. A. Gerasoulis T. Yang 1992 A comparison of clustering heuristics for scheduling DAGs on multiprocessors J Parallel Distrib Comput 16 4 276 291
29. C. M. Woodside G. G. Monforton 1993 Fast allocation of processes in distributed and parallel systems IEEE Trans Parallel Distrib Syst 4 2 164 174