Scheduling with communication delays and on-line disturbances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1685 LNCS, Issue , 1999, Pages 350-357

  Moukrim, Aziz ^a   Sanlaville, Eric ^a   Guinand, Frédéric ^b  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNIVERSITÉ DU HAVRE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS; SCHEDULING;

COMMUNICATION DELAYS; CRITICAL PATHS; NETWORK CONTENTION; ONLINE SCHEDULING; PRECEDENCE CONSTRAINTS; PROCESSOR ASSIGNMENTS; PROCESSOR NETWORKS; SCHEDULING TASKS;

SCHEDULING ALGORITHMS;

EID: 22844455142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_45     Document Type: Conference Paper

References (12)

1. Bampis E., Guinand F., Trystram D., Some Models for Scheduling Parallel Programs with Communication Delays, Discrete Applied Mathematics, 51, pp. 5-24, 1997. (Pubitemid 127411984)
2. Chrétienne Ph., Picouleau C., Scheduling with communication delays: a survey, in Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds), John Wiley Ltd 1995.
3. Gerasoulis A., Yang T., A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors, J. of Parallel and Distributed Computing, 16, pp. 276-291, 1992.
4. Hanen C, Munier A, Performance of Coffman Graham schedule in the presence of unitcom municati on del ays, Discrete Applied Mathematics, 81, pp. 93-108, 1998.
5. Hwang J.J., Chow Y.C., Anger F.D., Lee C.Y., Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput., 18(2), pp. 244-257, 1989.
6. Lenstra J.K., Veldhorst, M., Veltman B., The complexity of scheduling trees with comm uni cation delays, J. of Algorithms 20, pp. 157-173, 1996. (Pubitemid 126411837)
7. Moukrim A., Quilliot A., Scheduling with communication delays and data routing in Message Passing Architectures, LNCS, vol. 1388, pp. 438-451, 1998. (Pubitemid 128055425)
8. Papadimitriou C.H., Yannakakis M., Towards an Architecture-Independent Analysis of Parallel Algorithms, SIAM J. Comput., 19(2), pp. 322-328, 1990. (Pubitemid 20670116)
9. Rayward-Smith V.J., UET scheduling with interprocessor communication delays, Discrete Applied Mathematics, 18, pp. 55-71, 1986.
10. Sarkar V., Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, 1989.
11. Sih G.C., Lee E.A., A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures, IEEE Trans. on Parallel and Distributed Systems, 4, pp. 279-301, 1993.
12. Yang T., Gerasoulis A., List scheduling with and without communication delay, Parallel Computing, 19, pp 1321-1344, 1993.