Scheduling malleable tasks on parallel processors to minimize the makespan

Annals of Operations Research

Volumn 129, Issue 1-4, 2004, Pages 65-80

  Błażewicz, Jacek ^a   Machowiak, Maciej ^a   Węglarz, Jan ^a   Kovalyov, Mikhail Y ^b   Trystram, Denis ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

^c Équipe VAlidation Spécification et COnstruction de logiciels   (France)

Author keywords

Parallel computing; Resource allocation; Scheduling

Indexed keywords

EID: 3042797795     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000030682.25673.c0     Document Type: Article

References (17)

1. Bernard, P.E., T. Gautier, and D. Trystram. (1999). "Large Scale Simulation of Parallel Molecular Dynamics." In Proceedings of Second Merged Symposium IPPS/SPDP, 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, San Juan, Puerto Rico.
2. Blayo and L. Debreu. (1998). "Adaptive Mesh Refinement for Finite Difference Ocean Models: First Experiments." Journal of Physics Oceanogr. 29, 1239-1250.
3. Błażewicz, J., M. Drabowski, and J. Wȩglarz. (1986). "Scheduling Multiprocessor Tasks to Minimize Schedule Length." IEEE Transactions on Computing 35, 389-393.
4. Błażewicz, J., K. Ecker, E. Pesch, G. Schmidt, and J. Wȩglarz. (1996). Scheduling Computer and Manufacturing Processes. Berlin/New York: Springer.
5. Błażewicz, J., K. Ecker, B. Plateau, and D. Trystram (eds.). (2000). Handbook on Parallel and Distributed Processing. Berlin/New York: Springer.
6. Dongarra, J., L. Duff, D. Danny, C. Sorensen, and H. van der Vorst. (1999). Numerical Linear Algebra for High Performance Computers (Software, Environments, Tools). Philadelphia, PA: SIAM.
7. Drozdowski, M. (1996). "Scheduling Multiprocessor Tasks - An Overview." European Journal of Operational Research 94, 215-230.
8. Du, J. and J.Y.-T. Leung. (1989). "Complexity of Scheduling Parallel Tasks Systems." SIAM Journal on Discrete Mathematics 2, 473-487.
9. Ludwig, W.T. (1995). "Algorithms for Scheduling Malleable and Nonmalleable Parallel Tasks." Ph.D. thesis, University of Wisconsin-Madison, Department of Computer Science.
10. Mounie, G., C. Rapine and D. Trystram. (1999). "Efficient Approximation Algorithms for Scheduling Malleable Tasks." In Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA'99), ACM, pp. 23-32.
11. Prasanna, G.N.S. and B.R. Musicus. (1995). "The Optimal Control Approach to Generalized Multiprocessor Scheduling." Algorithmica.
12. Rapine, C., I. Scherson, and D. Trystram. (1998). "On-line Scheduling of Parallelizable Jobs." In Lecture Notes in Computer Science, Vol. 1470. New York: Springer.
13. Scherson, I., R. Subramanian, V. Reis and L. Campos. (1996). "Scheduling Computationally Intensive Data Parallel Programs." In Ecole Francaise de Parallélisme, Réseaux et Systèmes, Placement Dynamique et Répartition de Charge: Application aux Systèmes Parallèles et Répartis, pp. 107-129. Presquele de Giens: INRIA.
14. Stanat, D.F. and D.F. McAllister. (1977). Discrete Mathematics in Computer Science. Englewood Cliffs, NJ: Prentice-Hall.
15. Turek, J., J. Wolf, and P. Yu. (1992). "Approximate Algorithms for Scheduling Parallelizable Tasks." In 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 323-332.
16. Wȩglarz, J. (1981). "Project Scheduling with Continuously-Divisible, Doubly Constrained Resources." Management Science 27, 1040-1052.
17. Wȩglarz, J. (1982). "Modelling and Control of Dynamic Resource Allocation Project Scheduling Systems." In S.G. Tzafestas (ed.), Optimization and Control of Dynamic Operational Research Models. Amsterdam: North-Holland.