Lower bound algorithms for multiprocessor task scheduling with ready times

International Transactions in Operational Research

Volumn 12, Issue 5, 2005, Pages 481-508

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b   Iovanella, Antonio ^c  

^a CNR   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Algorithm; Lower bound; Multiprocessor task scheduling

Indexed keywords

EID: 85007138591     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2005.00521.x     Document Type: Article

References (29)

1. Ammar, M., Polyzos, G., Tripathi, S., 1997. Special issue on network support for multipoint communication. IEEE Journal Selected Areas in Communications, 15, 273–276.
2. Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y., 1997. Scheduling independent multiprocessor tasks. Proceedings of 5th European Symposium on Algorithms. Lecture Notes in Computer Science, Vol. 1284, pp. 1–12.
3. Bampis, E., Caramia, M., Fiala, J., Fishkin, A.V., Iovanella, A., 2002. Scheduling of independent dedicated multiprocessor tasks. Proceeding of 13th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, Vol. 2518, pp. 391–402.
4. Bampis, E., Kononov, A., 2001. On the approximability of scheduling multiprocessor tasks with time dependent processing and processor requirements. Proceedings of 15th International Parallel and Distribute Processing Symposium, San Francisco.
5. Bianco, L., Blazewicz, J.K., Dell'Olmo, P., Drozdowski, M., 1995. Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Annals of Operations Research, 58, 493–517.
6. Blazewicz, J.K., Dell'Olmo, P., Drozdowski, M., Speranza, M.G., 1992. Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters, 41, 275–280.
7. Brucker, P., 2001. Scheduling Algorithms. Springer-Verlag, Berlin.
8. Cai, X., Lee, C.Y., Li, C.L., 1998. Scheduling multiprocessor tasks without prespecified processor allocations. Naval Research Logistics, 45, 231–242.
9. Caramia, M., Dell'Olmo, P., Iovanella, A., 2001. On-line algorithms for multiprocessor task scheduling with ready times. Foundations of Computing and Decision Sciences, 26, 3, 197–214.
10. Carraghan, R., Pardalos, P.M., 1990. An exact algorithm for the maximum clique problem. Operations Research Letters, 9, 375–382.
11. Chen, J., Huang, J., 2001, Semi-normal scheduling: improvement on Goemans' algorithm. Proceedings 12th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, Vol. 2223, pp. 48–60.
12. Coffman, E.J., Garey, M.R., Johnson, D.S., 1996. Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed) Approximation Algorithms for NP-hard Problems. PWS Publishing, Boston, MA, pp. 46–93.
13. Dell'Olmo, P., Speranza, M.G., Tuza, Zs., 1997. Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Mathematics, 164, 67–79.
14. Dobson, G., Karmakar, U., 1989. Simultaneous resource scheduling with batching to minimize weighted flow times. Operations Research, 37, 592–600.
15. Dobson, G., Khosla, I., 1995. Simultaneous resource scheduling with batching to minimize weighted flow times. IIE Transactions, 27, 587–598.
16. Fiat, A., Woeginger, G.J. (eds) 1998. Online Algorithms. The State of the Art. Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin.
17. Fishkin, A., Jansen, K., Porkolab, L., 2001. On minimizing average weighted completion time of multiprocessor tasks with release dates. Proceeding of 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science 2076, pp. 875–886.
18. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of completeness. W.H. Freeman & Company, San Francisco, CA.
19. Gerstel, O., Li, B., McGuire, A., Rouskas, G.N., Sivalingam, K., Zhang, Z. (eds) 2000. Special issue on protocols and architectures for next generations optical WDM networks. IEEE Journal Selected Areas in Communications, 18, 10.
20. Goemans, M.X., 1995. An approximation algorithm for scheduling on three dedicated processor. Discrete Applied Mathematics, 61, 49–59.
21. Hoogeveen, J.A., Van De Velde, S.L., Veltman, B., 1994. Complexity of scheduling multiprocessor tasks with prespecified allocations. Discrete Applied Mathematics, 55, 259–272.
22. Kramer, A., 1995. Scheduling multiprocessors tasks on dedicated processors. Ph.D. Thesis, FB Mathematik/Informatik, Universität Osnabrück.
23. Krawczyk, H., Kubale, M., 1985. An approximation algorithm for diagnostic test scheduling in multicomputer system. IEEE Transactions on Computers, 34, 869–872.
24. Kubale, M., 1987. The complexity of scheduling independent two processor tasks on dedicated processor. Information Processing Letters, 24, 141–147.
25. Mukherjee, B., 1992. WDM-based local lightwave networks Part I: single-hop systems. IEEE Network Magazine, 6, 3, 12–27.
26. Sivalingam, K.M., Subramaniam, S. (eds) 2000. Optical WDM Networks: Principles and Practice. Kluwer Academic Publishers, Dordrecht.
27. Thaker, D., Rouskas, G.N., 2000. Multi-destination communication in broadcast WDM networks: A survey. Technical Report 2000-08, North Caroline State University.
28. The NGI Helious project: Regional Testbed Optical Access Network For IP Multicast and Differentiated Services. http://projects.anr.mcnc.org/Helios/, 2000.
29. Wagner, R.E., Alferness, R.C., Saleh, A.A.M., Goodman, M.S., 1996. MONET: multiwavelength optical networking. Journal of Lightwave Technology, 14, 1349–1355.