Abstract
We study the off and on-line versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [12], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1– ∈, neither for some ∈ > 0, unless P= NP; nor for any ∈ > 0, unless NP=ZPP. For this special case we give a simple algorithm based on the classical first-fit technique. We analyze the algorithm for both tasks arrive over time and tasks arrive over list on-line scheduling versions, and show that its competitive ratio is bounded by 2√m and 2√m + 1, respectively. Here we also use some preliminary results on (vertex) coloring of k-tuple graphs. For the case of arbitrary processing times, we show that any algorithm which uses the first-fit technique cannot be better than m competitive. Then, by using our split-round technique, we give a 3√m-approximation algorithm for the off-line version of the problem. Finally, by using some ideas from [20], we adapt the algorithm to the on-line case, in the paradigm of tasks arriving over time in which the existence of a task is unknown until its release date, and show that its competitive ratio is bounded by 6√m. Due to the conducted experimental results, we conclude that our algorithms can perform well in practice.
Supported by the bilateral French-German project PROCOPE,
Research supported by EU APPOL II project IST-2001-32007.
Research supported by CNR project CNRG007FC1.
Research supported by EU ARACNE project HPRN-CT-1999-00112, GAČR project 201/99/0242, and by MECR project LN00A056.
Supported by Graduiertenkolleg 357 “Effiziente Algorithmen und Mehrskalenmethoden”.
Research supported by CNR project CNRG007FC1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ammar, G. Polyzos, and S. Tripathi (Eds.). Special issue on network support for multipoint communication. IEEE Journal Selected Areas in Communications, 15, 1997.
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.
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.
M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability — towards tight results. SIAM Journal on Computing, 27:804–915, 1998.
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.
M. Caramia, P. Dell’Olmo, and A. Iovanella. Lower bound algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications.
M. Caramia, P. Dell’Olmo, and A. Iovanella. On-line algorithms for multiprocessor task scheduling with ready times, 2001. Personal communications.
M. Drozdowski. Scheduling multiprocessor tasks — an overview. European Journal on Operations Research, pages 215–230, 1996.
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.
A. Feldmann, J. Sgall, and S-H. Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49–72, 1994.
A. Fiat and G. J. Woeginger, editors. Online algorithms. The state of the art. LNCS 1442. Springer Verlag, 1998.
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.
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.
M. X. Goemans. An approximation algorithm for scheduling on three dedicated processors. Discrete Applied Mathematics, 61:49–59, 1995.
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.
The NGI Helious project: Regional Testbed Optical Access Network For IP Multicast and Differentiated Services. http://projects.anr.mcnc.org/Helios/, 2000.
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.
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.
B. Mukherjee. Wdm-based local lightwave networks Part I: Single-hop systems. IEEE Network Magazine, pages 12–27, 1992.
D.B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313–1331, 1995.
K. M. Sivalingam and S. Subramaniam, editors. Optical WDM networks: Principles and practice. Kluwer Academic Publishers, 2000.
D. Thaker and G. N. Rouskas. Multi-destination communication in broadcast WDM networks: A survey. Technical Report 2000-08, North Caroline State University, 2000.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Caramia, M., Fiala, J., Fishkin, A.V., Iovanella, A. (2002). Scheduling of Independent Dedicated Multiprocessor Tasks. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_35
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive