Improving static scheduling using inter-task concurrency measures

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2001-January, Issue , 2001, Pages 375-381

  Roig, C ^a   Ripoll, A ^b   Senar, M A ^b   Guirado, F ^a   Luque, E ^b  

^a UNIVERSITY OF LLEIDA   (Spain)

^b UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Concurrent computing; Distributed computing; Distributed processing; Image processing; Pattern matching; Personal communication networks; Processor scheduling; Programming profession; Topology; Tree graphs

Indexed keywords

APPLICATION PROGRAMS; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; PARALLEL PROCESSING SYSTEMS; PATTERN MATCHING; PERSONAL COMMUNICATION SYSTEMS; SCHEDULING; TELECOMMUNICATION NETWORKS; TOPOLOGY; TREES (MATHEMATICS);

CONCURRENT COMPUTING; DISTRIBUTED PROCESSING; PROCESSOR SCHEDULING; PROGRAMMING PROFESSION; TREE GRAPH;

IMAGE PROCESSING;

EID: 0347510399     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2001.951975     Document Type: Conference Paper

References (8)

1. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine. A Users' Guide and Tutorial for Networked Parallel Computing. The MIT Press, Cambridge, Massachusets, 1994.
2. C. Hui and S. Chanson. Allocating task interaction graphs to processors in heterogeneous networks. IEEE Trans. on Parallel and Distr. Systems, 8(9):908-925, 1997.
3. Y.-K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. J. of Par. and Distr. Comp., 59:381-422, 1999.
4. C. Roig, A. Ripoll, M. Senar, F. Guirado, and L. E. Modelling message-passing programs for static mapping. IEEE Proc. 8th. Euromicro Workshop on Par. and Distr. Processing, pages 229-236, Jan. 2000.
5. C. Roig, A. Ripoll, M. Senar, F. Guirado, and E. Luque. Exploiting knowledge of temporal behaviour in parallel programs for improving distributed mapping. 6th. Int. Euro-Par Conference. LNCS, 1900:262-271, 2000.
6. P. Sadayappan, R. Ercal, and J. Ramanujam. Cluster partitioning approaches to mapping parallel programs onto a hypercube. Parallel Computing, 13:1-16, 1990.
7. M. Senar, A. Ripoll, A. Cortés, and E. Luque. Clustering and reassignment-based mapping strategy for message-passing architectures. IEEE Int. Par. Proc Symp&Sym. On Par. Dist. Proc. (IPPS/SPDP), pages 415-421, 1998.
8. J. Subhlok and G. Vondran. Optimal use of mixed task and data parallelism for pipelined computations. J. of Par. and Distr. Compt, 60:297-319, 2000.