Upper bound on the number of processors for scheduling with interprocessor communication delays

Mathematical Methods of Operations Research

Volumn 52, Issue 1, 2000, Pages 99-113

  Moukrim, Aziz ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Communication delays; Makespan; Minimum number of processors; Scheduling

Indexed keywords

EID: 0346057349     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000062     Document Type: Article

References (13)

1. Barskiy AB (1968) Minimizing the number of computing devices needed to realize a computational process within a specified time, Eng Cybern (USSR), No 6:59-63
2. Chrétienne Ph, Picouleau C (1995) Scheduling with communication delays: a survey. Scheduling Theory and its Applications, Chrétienne P. Coffman EG, Lenstra JK, Liu Z (Eds), John Wiley Ltd
3. Dilworth RP (1950) A decomposition theorem for partially ordered sets, Ann Math 51:161-166
4. Fernandez EB, Bussell B (1973) Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules, IEEE Transactions on Computers, vol. C-22, No 8:745-751
5. Fulkerson DR (1966) Scheduling in project networks, in Proc. IBM Scientific Computing Symp. Combinatorial Problems, pp. 73-92
6. Hwang JJ, Chow YC, Anger FD, Lee CY (1989) Scheduling precedence graphs in systems with interprocessor communication times, SIAM J Comput 18(2):244-257
7. Jakoby A, Reischuk R (1992) Scheduling trees with communication delays, in 3.SWAT, pp. 165-177
8. Kasahara H, Narita S (1984) Practical multiprocessor scheduling algorithms for efficient parallel processing, IEEE Trans Comput C-33:1023-1029
9. Ma P-YR, Lee EYS, Tsuchiya M (1982) A task allocation model for distributed computing systems, IEEE Trans Comput C-31:41-47
10. Al-Mouhamed MA (1990) Lower bound on the number of processors and time for scheduling precedence graphs with communication costs, IEEE Trans soft eng 16:1390-1401
11. Moukrim A (1999) On the minimum number of processors for scheduling problems with communication delays, Annals of Operations Research 86:455-472
12. Moukrim A, Quilliot A (1998) Scheduling with communication delays and data routing in Message Passing Architectures, SCOOP'98, Springer Lecture Notes in Computer Science 1388:438-451
13. Shen C, Tsai W (1985) A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion, IEEE Trans Comput C-34:197-203