Parallel approximation scheme for the multiprocessor scheduling problem

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 47-72

  Corrêa, Ricardo C ^a  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GENETIC ALGORITHMS; PROBLEM SOLVING; SCHEDULING;

SCHEDULING PROBLEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033874647     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00095-2     Document Type: Article

References (22)

1. Barbosa V. An Introduction to Distributed Algorithms. 1996;MIT Press, Cambridge, MA.
2. T. Casavant, J. Kuhl, A taxonomy of scheduling in general-purpose distributed computing systems, IEEE Transactions on Software Engineering 14 (2) (1988).
3. Chandy K., Misra J. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems. 6(4):1984;632-646.
4. Chang P.C., Jiang Y.S. A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations. European Journal of Operational Research. 77:1994;208-223.
5. R. Corrêa, A. Ferreira, S. Porto, Selected algorithmic techniques for parallel optimization, in: P. Pardalos, L. Zhu (Eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, 1998, pp. 407-456.
6. R. Corrêa, A. Ferreira, A polynomial-time branching procedure for the multiprocessor scheduling problem, in: Proceedings of EuroPar'99, 1999, pp. 272-279.
7. R. Corrêa, A. Ferreira, P. Rebreyend, Integrating list heuristics into genetic algorithms for multiprocessor scheduling, in: Proceedings of the IEEE Symposium on Parallel and Distributed Processing, New Orleans, USA, 1996.
8. P. Crescenzi, V. Kann, Minimum precedence constrained scheduling, in: A Compendium of NP Optimization Problems, 1999, Available electronically at http://www.nada.kth.se/ ̃viggo/wwwcompendium/node181.html.
9. Fernandez E., Bussel B. Bounds on the number of processors and for multiprocessor optimal schedules. IEEE Transactions on Computers C. 22(8):1973;745-751.
10. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
11. L. Hall, Approximation algorithms for scheduling, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, MA, 1997.
12. Hoogeveen J., Lenstra J., Veltman B. Three, four, five, six or the complexity of scheduling with communication delays. IEEE Transactions on Computers. 16:1994;129-137.
13. Kasahara H., Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers C. 33(11):1984;1023-1029.
14. Kitajima J., Plateau B. Modelling parallel program behaviour in ALPES. Information and Software Technology. 36(7):1994;457-464.
15. Y.-K. Kwok, I. Ahmad, Otimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques, in: Proceedings of the 1998 International Conference on Parallel Processing, August 1998.
16. E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys, Sequencing and scheduling: algorithms and complexity, in: Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, 1993, pp. 455-522.
17. Lenstra J., Rinnooy Kan A. The complexity of scheduling under precedence constraints. Operations Research. 26:1978;22-35.
18. Li G., Wah B. Coping with anomalies in parallel branch-and-bound algorithms. IEEE Transactions on Computers C. 35(6):1986;568-573.
19. Malloy B., Lloyd E., Soffa M. Scheduling DAG's for asynchronous multiprocessor execution. IEEE Transactions on Parallel and Distributed Systems. 5(5):1994.
20. Norman M., Thanisch P. Models of machines and computations for mapping in multicomputers. ACM Computer Surveys. 25(9):1993;263-302.
21. Papadimitriou C. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
22. Ullman J. NP-complete scheduling problems. Journal of Computer and System Sciences. 10:1975;384-393.