Approximation Algorithms for Scheduling Independent Malleable Tasks
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.
KeywordsApproximation Algorithm Performance Guarantee Parallel Task Schedule Length Multiprocessor Task
Unable to display preview. Download preview PDF.
- 3.R. L. Graham: Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, 1966, 1563–1581.Google Scholar
- 4.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.Google Scholar
- 5.W. T. Ludwig: Algorithms for scheduling malleable and non-malleable parallel tasks, PhD thesis, University of Wisconsin-Madison, Department of Computer Sciences, 1995.Google Scholar
- 6.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.Google Scholar
- 7.G. N. S. Prasanna, B. R. Musicus: The optimal control approach to generalized multiprocessor scheduling, Algorithmica, 1995.Google Scholar
- 9.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.Google Scholar
- 10.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.Google Scholar