On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 2144-2151

  Bampis, E ^a   Kononov, A ^b  

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

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COSTS; DISTRIBUTED COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

APPROXIMABILITY; CLASSICAL MODEL; MAXIMUM PROCESSING TIME; MULTIPROCESSOR TASKS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROCESSING TIME; TIME REQUIREMENTS; TIME-DEPENDENT PROBLEM;

PARALLEL PROCESSING SYSTEMS;

EID: 84876571305     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925214     Document Type: Conference Paper

References (17)

1. B. Alidaee and N. K. Wormer. Scheduling with time-dependent processing times: Review and extensions. J. Op. Res. Soc., 50:711-720, 1999.
2. A. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis. How to schedule independent multiprocessor tasks. to appear in Algorithmica.
3. A. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis. How to schedule independent multiprocessor tasks. Proc. 5th European Symposium on Algorithms, LNCS 1284, pages 1-12, 1997.
4. S. Arora and C. Lund. Hardness of approximations. in: D. Hochbaum, ed., Approximation Algorithms for NP-hard Problems (PWS Pub. Co.), pages 399-446, 1997.
5. B. B. Chen, C. Potts, and G. Woeginger. A review of machine scheduling: complexity, algorithms and approximability. Tecnical Report Woe-29, TU Graz, 1998.
6. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, and M. Speranza. Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters, 41:275-280, 1992.
7. T. Cheng and Q. Ding. The complexity of scheduling starting time dependent tasks with release times. IPL, 65:75-79, 1998.
8. P. Dell'Olmo, M. Speranza, and Z. Tuza. Efficiency and effectiveness of normal schedules on three dedicated processors. submitted.
9. M. Drozdowski. Scheduling multiprocessor tasks - an overview. EJOR, 94:215-230, 1996.
10. M. Garey and D. Johnson. Computers and Intractability, A Guide to the theory of NP-completeness, W. H. Freemann and Company, San Francisco, CA, 1979.
11. S. Gawiejnowicz. Brief survey of continuous models of scheduling. Found. Comput. Dec. Sci., 21:81-100, 1996.
12. M. Goemans. An approximation algorithm for scheduling on three dedicated processors. Disc. App. Math., 61:49-59, 1995.
13. D. Hochbaum. Approximation Algorithms for NP-hard Problems, PWS Pub. Co., 1997.
14. J. Hoogeveen, S. van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processors allocation. Disc. App. Math., 55:259-272, 1994.
15. K. Jansen and L. Porkolab. Linear time approximation schemes for scheduling malleable parallel tasks. Proc. of SODA'99, pages 492-498, 1999.
16. G. Mounie, C. Rapine, and D. Trystram. Efficient approximation algorithms for scheduling malleable tasks. Proc. of SPAA'99, pages 23-32, 1999.
17. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20:257-301, 1995.