Abstract
Malleable tasks consist in considering the tasks of a parallel program as large computational units that may be themselves parallelized. In this paper we investigate the problem of scheduling a set of n independent malleable tasks on a m processors system, starting from the continuous version of the problem.
This work was realized when J. B.lażewicz was visiting ENSGI, Grenoble, in Spring 2000 and was partially supported by KBN Grant 8T11A01618
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. B.lażewicz, M. Drabowski, J. Weglarz: Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers 35, 1986, 389ā393.
J. Du, J. Y.-T. Leung: Complexity of scheduling parallel tasks systems. SIAM Journal on Discrete Mathematics 2, 1989, 473ā487.
R. L. Graham: Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, 1966, 1563ā1581.
K. Jansen, L. Porkolab: Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (soda99), ACM-SIAM, 1999, 490ā498.
W. T. Ludwig: Algorithms for scheduling malleable and non-malleable parallel tasks, PhD thesis, University of Wisconsin-Madison, Department of Computer Sciences, 1995.
G. MouniĆ©, C. Rapine, D. Trystram: Efficient approximation algorithms for scheduling malleable tasks, In Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAAā 99), ACM, 1999, 23ā32.
G. N. S. Prasanna, B. R. Musicus: The optimal control approach to generalized multiprocessor scheduling, Algorithmica, 1995.
A. Steinberg: A Strip-Packing Algorithm with Absolute Performance Bound 2, SI AM Journal on Computing 26(2), 1997, 401ā409.
J. Turek, J. Wolf, P. Yu: Approximate algorithms for scheduling parallelizable tasks, In 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, 323ā332.
J. Weglarz: Modelling and control of dynamic resource allocation project scheduling systems, In S. G. Tzafestas (ed.), Optimization and Control of Dynamic Operational Research Models, North-Holland, Amsterdam, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blazewicz, J., Machowiak, M., MouniƩ, G., Trystram, D. (2001). Approximation Algorithms for Scheduling Independent Malleable Tasks. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive