Task scheduling: Considering the processor involvement in communication

Proceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Hete

Volumn , Issue , 2004, Pages 328-335

  Sinnen, Oliver ^a   Sousa, Leonel ^a  

^a INESC ID   (Portugal)

Author keywords

Contention; Parallel programming; Processor involvement; System models; Task scheduling

Indexed keywords

CONTENTION; PARALLEL PROGRAMMING; PROCESSOR INVOLVEMENT; SYSTEM MODELS; TASK SCHEDULING;

COMPUTATIONAL METHODS; COMPUTER NETWORKS; GRAPH THEORY; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 19644371754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2004.48     Document Type: Conference Paper

References (19)

1. T. L. Adam, K. M. Chandy, and J. R. Dickson. A comparison of list schedules for parallel processing systems. Communications of the ACM, 17:685-689, 1974.
2. I. Ahmad, Y.-K. Kwok, and M.-Y. Wu. Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors. In G.-J. Li, D. F. Hsu, S. Horiguchi, and B. Maggs, editors, Second International Symposium on Parallel Architectures. Algorithms, and Networks, 1996, pages 207-213, June 1996.
3. O. Beaumont, V. Boudet, and Y. Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In HCW'2002. the 11th Heterogeneous Computing Workshop. IEEE Computer Society Press, 2002.
4. D. E. Culler and J. P. Singh. Parallel Computer Architecture. Morgan Kaufmann Publishers, 1999.
5. A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. Journal of Parallel and Distributed Computing. 16(4):276-291, December 1992.
6. J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal of Computing, 18(2):244-257, April 1989.
7. J. White III and S. Bova. Where's the overlap? An analysis of popular MPI implementations. In Proc. of MPIDC 1999, 1999.
8. T. Kalinowski, I. Kort, and D. Trystram. List scheduling of general task graphs under LogP. Parallel Computing, 26:1109-1128, 2000.
9. B. Kruatrachue. Static Task Scheduling and Grain Packing in Parallel Processing Systems. PhD thesis. Oregon State University, USA, 1987.
10. B. Kruatrachue and T. Lewis. Grain size determination for parallel processing. IEEE Software. 5(1):23-32, January 1988.
11. B. S. Macey and A. Y. Zomaya. A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In Parallel Processing Symposium. 1998. Proc. of IPPS/SPDP 1998, pages 538-541, 1998.
12. P. Rebreyend, F. E. Sandnes, and G. M. Megson. Static multiprocessor task graph scheduling in the genetic paradigm: A comparison of genotype representations. Research Report 98-25. Ecole Normale Superieure de Lyon, Laboratoire de Informatique du Parallelisme, Lyon, France, 1998.
13. G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems. 4(2):175-186, February 1993.
14. O. Sinnen. Experimental evaluation of task scheduling accuracy. Tese de Mestrado (Master's thesis). Institute Superior Tecnico, Technical University of Lisbon. Portugal. December 2001.
15. O. Sinnen. Accurate Task Scheduling for Parallel Systems. PhD thesis, Instituto Superior Técnico. Technical University of Lisbon, Portugal, April 2003.
16. O. Sinnen and L. Sousa. Experimental evaluation of task scheduling accuracy: Implications for the scheduling model. IEICE Transactions on Information and Systems, E86-D(9):1620-1627, September 2003.
17. O. Sinnen and L. Sousa. List scheduling: Extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing, 30(1):81-101, January 2004.
18. J. D. Ullman. NP-complete scheduling problems. Journal of Computing System Science. 10:384-393, 1975.
19. M. Y. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems. 1(3):330-343, July 1990.