Abstract
We consider the problem of scheduling trees on two identical processors in order to minimize the makespan. We assume that tasks have unit execution times, and arcs are associated with large identical communication delays. We prove that the problem is NP-hard in the strong sense even when restricted to the class of binary trees, and we provide a polynomial-time algorithm for complete binary trees.
Chapter PDF
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
H. Ali, H. El-Rewini, The time complexity of scheduling interval orders with communication is polynomial, Parallel Processing Letters 3(1) (1993) 53–58.
E. Bampis, A. Giannakos, J.-C. König, On the complexity of scheduling with Large communication delays, Europ. Journal of Operational Research 94 (1996) 252–260.
P. Chrétienne, C. Picouleau, Scheduling with communication delays: A survey, In Scheduling Theory and Its Applications, P. Chrétienne et al. (Eds.), J. Wiley, 1995.
E. G. Coffman Jr., R. L. Graham, Optimal scheduling for two-processor systems, Acta Informatica 1 (1972) 200–213.
L. Finta, Z. Liu, I. Milis, E. Bampis, Scheduling UET-UCT series parallel graphs on two processors, Theoretical Computer Science 162(2) (1996) 323–340.
M. Fujii, T. Kasami, K. Ninomiya, Optimal sequencing of two equivalent processors, SIAM J. App. Math. 17(4) (1969) 784–789.
L. Gao, A. L. Rosenberg and R. K. Sitaraman, Optimal architecture-independent scheduling of fine-grain tree-sweep computations, In Proc. 7th IEEE Symposium on Parallel and distributed Processing (1995) 620–629.
M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, Ed. Freeman, 1979.
R. L. Graham, E. L. Lawler, J. K. Lenstra, K. Rinnooy Kan, Optimization and approximation in deterministic scheduling: A survey, Ann. Disc. Math., 5 (1979) 287–326.
A. Jakoby and R. Reischuk, The complexity of scheduling problems with communication delays for trees, In Proc. Scandinavian Workshop on Algorithm Theory, (SWAT’92), Springer Verlag LNCS-621 (1992) 165–177.
H. Jung, L. Kirousis, P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, Information and Computation 105 (1993) 94–104.
J. K. Lenstra, M. Veldhorst and B. Veltman, The complexity of scheduling trees with communication delays, Journal of Algorithms, 20(1) (1996) 157–173.
C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. on Computing, 2 (1990) 322–328.
T. Varvarigou, V. P. Roychowdhury, T. Kailath, E. Lawler, Scheduling in and out forests in the presence of communication delays IEEE Trans. on Parallel and Distributed Systems, 7(10) (1996) 1065–1074.
B. Veltman, B. J. Lageweg, J. K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Computing, 16 (1990) 173–182.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Bampis, E., Finta, L., Milis, I. (2000). Scheduling Trees with Large Communication Delays on Two Identical Processors. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_38
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive