Scheduling of independent dedicated multiprocessor tasks

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

Volumn 2518 LNCS, Issue , 2002, Pages 391-402

  Bampis, Evripidis ^a   Caramia, Massimiliano ^b   Fiala, Jiří ^c   Fishkin, Aleksei V ^d   Iovanella, Antonio ^e  

^a CNRS   (France)

^b CNR   (Italy)

^c CHARLES UNIVERSITY   (Czech Republic)

^d UNIVERSITY OF KIEL   (Germany)

^e UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE RATIO; IDENTICAL PROCESSORS; MULTIPROCESSOR TASKS; ONLINE SCHEDULING; ONLINE VERSIONS; PROCESSING TIME; PROCESSOR ALLOCATION; SIMPLE ALGORITHM;

APPROXIMATION ALGORITHMS; MULTIPROCESSING SYSTEMS; SCHEDULING ALGORITHMS; ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING;

SCHEDULING; APPROXIMATION ALGORITHMS;

EID: 84876570989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_35     Document Type: Conference Paper

References (23)

1. M. Ammar, G. Polyzos, and S. Tripathi (Eds.). Special issue on network support for multipoint communication. IEEE Journal Selected Areas in Communications, 15, 1997.
2. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis. Scheduling independent multiprocessor tasks. In Proceedings 5th European Symposium on Algorithms, LNCS 1284, pages 1-12. Springer Verlag, 1997. (Pubitemid 127119215)
3. E. Bampis and A. Kononov. On the approximability of scheduling multiprocessor tasks with time dependent processing and processor requirements. In Proceedings 15th International Parallel and Distributed Processing Symposium, San Francisco, 2001.
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability - towards tight results. SIAM Journal on Computing, 27:804-915, 1998. (Pubitemid 128490839)
5. S. Bischof and E.W. Mayr. On-line scheduling of parallel jobs with runtime restrictions. In Proceedings 9th Annual International Symposium on Algorithms and Computation, LNCS 1533, pages 119-129. Springer Verlag, 1998.
6. M. Caramia, P. Dell'Olmo, and A. Iovanella. Lower bound algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications.
7. M. Caramia, P. Dell'Olmo, and A. Iovanella. On-line algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications.
8. M. Drozdowski. Scheduling multiprocessor tasks - an overview. European Journal on Operations Research, pages 215-230, 1996. (Pubitemid 126385629)
9. A. Feldmann, M.-Y. Kao, J. Sgall, and S.H. Teng. Optimal online scheduling of parallel tasks with dependencies. In Proceedings 25th ACM Symposium on the Theory of Computing, pages 642-651, 1993. (Pubitemid 23668731)
10. A. Feldmann, J. Sgall, and S-H. Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49-72, 1994.
11. A. Fiat and G. J. Woeginger, editors. Online algorithms. The state of the art. LNCS 1442. Springer Verlag, 1998.
12. A. V. Fishkin, K. Jansen, and L. Porkolab. On minimizing average weighted completion time of multiprocessor tasks with release dates. In Proceedings 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, pages 875-886, Crete, 2001. Springer Verlag. (Pubitemid 33300854)
13. O. Gerstel, B. Li, A. McGuire, G. N. Rouskas, K. Sivalingam, and Z. Zhang (Eds.). Special issue on protocols and architectures for next generations optical wdm networks. IEEE Journal Selected Areas in Communications, 18, October 2000.
14. M. X. Goemans. An approximation algorithm for scheduling on three dedicated processors. Discrete Applied Mathematics, 61:49-59, 1995.
15. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic scheduling: A survey. Annals of Discrete Mathematics, pages 287-326, 1979.
16. The NGI Helious project: Regional Testbed Optical Access Network For IP Multicast and Differentiated Services. http://projects.anr.mcnc.org/Helios/, 2000.
17. J. A. Hoogeveen, S. L. Van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics, 55:259-272, 1994.
18. M. Kuznetsov, N. Froberg, S. Henion, H. Rao, J. Korn, K. Rauschenbach, E. Modiano, and V. Chan. A next-generation optical regional access networks. IEEE Communications Magazine, 38:66-72, January 2000. (Pubitemid 30549121)
19. B. Mukherjee. Wdm-based local lightwave networks Part I: Single-hop systems. IEEE Network Magazine, pages 12-27, 1992.
20. D.B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313-1331, 1995.
21. K. M. Sivalingam and S. Subramaniam, editors. Optical WDM networks: Principles and practice. Kluwer Academic Publishers, 2000.
22. D. Thaker and G. N. Rouskas. Multi-destination communication in broadcast WDM networks: A survey. Technical Report 2000-08, North Caroline State University, 2000.
23. R. E. Wagner, R. C. Alferness, A. A. M. Saleh, and M. S. Goodman. MONET: Multiwavelength Optical Networking. Journal of Lightwave Technology, 14:1349, June 1996.