Scheduling independent multiprocessor tasks

Algorithmica (New York)

Volumn 32, Issue 2, 2002, Pages 247-261

  Amoura, A K ^a   Bampis, E ^b   Kenyon, C ^a   Manoussakis, Y ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

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

Author keywords

Approximation; Multiprocessor tasks; Scheduling

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

MULTIPROCESSOR TASKS;

SCHEDULING;

EID: 0012585002     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0076-9     Document Type: Article

References (25)

1. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis. How to Schedule Independent Multiprocessor Tasks. Proceedings of the 5th Annual European Symposium on Algorithms, ESA '97, pp. 1-12. LNCS 1284. Springer-Verlag, Berlin, 1997.
2. L. Bianco, J. Blazewicz, P. Dell'Olmo, and M. Drozdowski. Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors. Performance Evaluation, 20:361-371 (1994).
3. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, and M. G. Speranza. Scheduling Multiprocessor Tasks on Three Dedicated Processors. Information Processing Letters, 41:275-280 (1992).
4. J. Blazewicz, M. Drabowski, and J. Wȩglarz. Scheduling Multiprocessor Tasks to Minimize Schedule Length. IEEE Transactions on Computing, 35(5):389-393 (1986).
5. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. Lapaugh. Scheduling File Transfers. SIAM Journal on Computing, 14(3):744-780 (1985).
6. P. Dell'Olmo, M. G. Speranza, and Z. Tuza. Efficiency and Effectiveness of Normal Schedules on Three Dedicated Processors. Discrete Mathematics, 164:67-79 (1997).
7. M. Drozdowski. On Complexity of Multiprocessor Tasks Scheduling. Bulletin of the Polish Academy of Sciences, Technical Sciences, 43(3):381-392 (1995).
8. M. Drozdowski. Scheduling Multiprocessor Tasks - An Overview. European Journal of Operational Research, 94:215-230 (1996).
9. J. Du, and J. Y-T. Leung. Complexity of Scheduling Parallel Task Systems. SIAM Journal on Discrete Mathematics, 2(4):473-487 (1989).
10. M. Garey and D. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freemann, San Francisco, CA, 1979.
11. M. X. Goemans. An Approximation Algorithm for Scheduling on Three Dedicated Processors. Discrete Applied Mathematics, 61:49-59 (1995).
12. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, 1990.
13. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan. Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5:287-326 (1979).
14. M. Grötschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1988.
15. L. A. Hall and D. B. Shmoys. Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better. Mathematics of Operations Research, 17:22-35 (1992).
16. J. Hoogeveen, S. L. van de Velde, and B. Veltman. Complexity of Scheduling Multiprocessor Tasks with Prespecified Processors Allocation. Discrete Applied Mathematics, 55:259-272 (1994).
17. K. Jansen. Personal communication, 1998.
18. C. Kenyon and E. Rémila. Approximate Strip-Packing. Proceedings of the 31th Symposium on Foundations of Computer Science (FOCS), pp. 31-36 (1996).
19. D. E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, 1968.
20. Y. Kopidakis. Approximabilité des Problèmes d'Ordonnancement dans les Systèmes Parallèles. Thèse de Doctorat, Université de Paris-Sud (1997).
21. Y. Kopidakis and V. Zissimopoulos. An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension. Theoretical Computer Science, 178:265-273 (1997).
22. A. Krämer. Scheduling Multiprocessor Tasks on Dedicated Processors. Ph.D. Thesis, Fachbereich Mathematik/Informatik, Universität Osnabrück (1995).
23. H. Krawczyk and M. Kubale. An Approximation Algorithm for Diagnostic Test Scheduling in Multi-computer Systems. IEEE Transactions on Computers, C-34(9):869-872 (1985).
24. M. Kubale. Preemptive Scheduling of Two-Processor Tasks on Dedicated Processors (in polish). Zeszyty Naukowe Politechniki Śla̧skiej, Seria: Automatyka z. 100, 1082:145-153 (1990).
25. B. Veltman, B. J. Lageweg, and J. K. Lenstra. Multiprocessor Scheduling with Communication Delays. Parallel Computing, 16:173-182 (1990).