A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors

Parallel Computing

Volumn 25, Issue 1, 1999, Pages 49-61

  Amoura, A K ^a,d   Bampis, E ^b   Manoussakis, Y ^a   Tuza, Zs ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^d Simtran Technologies Inc   (Canada)

Author keywords

Dedicated processors; Multiprocessor tasks; Scheduling

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; HEURISTIC METHODS;

DEDICATED PROCESSORS; DIVIDE UNIPROCESSOR TASKS (DUT);

MULTIPROCESSING SYSTEMS;

EID: 0032667644     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00102-1     Document Type: Article

References (15)

1. M. Drozdowski, Scheduling Multiprocessor Tasks - An Overview, Submitted.
2. R.L. Graham, E.L. Lawler, J.K. Lenstra, H.G.R. Rinnooy Kan, Optimization and approximation in deterministic scheduling: A survey, Ann. Disc. Math. 5 (1979) 287-326.
3. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275-280; Corrigendum to Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275-280; Information Processing Letters 49 (1994) 269-270.
4. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275-280; Corrigendum to Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275-280; Information Processing Letters 49 (1994) 269-270.
5. P. Dell'Olmo, M.G. Speranza, Z. Tuza, Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics, to appear.
6. M.X. Goemans, An approximation algorithm for scheduling on three dedicated processors, Discrete Applied Mathematics 61 (1995) 49-59.
7. L. Bianco, P. Dell'Olmo, M.G. Speranza, Nonpreemptive scheduling of independent tasks with prespecified processor allocation, Naval Research Logistics 41 (1994) 959-971.
8. G. Bozoki, J.P. Richard, A branch-and-bound algorithm for the continuous-process task shop scheduling problem, AIIE Trans. 2 (1970) 246-252.
9. A.K. Amoura, Problèmes d'Ordonnancement avec communications dans les systèmes multiprocesseurs, Ph.D. thesis, Université Paris-XI, Orsay, France, 1998.
10. A.K. Amoura, E. Bampis, Y. Manoussakis, Z. Tuza, Scheduling Multiprocessor Dedicated Tasks on Three Processors, Technical report 1089, LRI, Université Paris-Sud, Orsay, 1996.
11. D.S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9 (1974) 256-278.
12. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
13. H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, An efficient fully polynomial approximation scheme for the subset-sum problem, Technical Report, University of Brescia, 1997.
14. J. Hoogeveen, S. van de Velde, B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processors allocation, Discrete Applied Mathematics 55 (1994) 259-272.
15. A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, Scheduling independent multiprocessor tasks, in: Proceedings of the Fifth Annual European Symposium on Algorithms, ESA'97, LNCS vol. 1284, 1997, pp. 1-12.