Scheduling dags to minimize time and communication
We study the complexity of a generalization of the unit-execution-time multiprocessor scheduling problem under precedence constraints, in which the number of communication arcs is also minimized. Most versions of the problem are shown NP-complete, and two polynomial algorithms are presented for specialized cases.
Unable to display preview. Download preview PDF.
- [Co]E. G. Coffman, ed. Computer and Jobshop Scheduling Theory, Wiley, 1978.Google Scholar
- [GJ]M. R. Garey, D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.Google Scholar
- [PS]C. H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983.Google Scholar
- [PU]C. H. Papadimitriou, J. D. Ullman. “A Communication-Time Trade-off”, Proc. 1985 STOC Conference; also, SIAM J. Comp., 1987.Google Scholar
- [PY]C. H. Papadimitriou, M. Yannakakis “Towards an Architecture-Independent Analysis of Parallel Algorithms”, Proceedings 1988 STOC, to appear.Google Scholar
- [Pe]E. Petrohilos, Diploma Thesis, National Technical University of Athens, 1986 (in Greek).Google Scholar
- [Pr]M. Prastein, manuscript, University of Illinios at Urbana-Champaign, 1987.Google Scholar