Abstract
In this paper, we propose new lower bounds on minimum number of processors and minimum time to execute a given program on a multicomputer system, where the program is represented by a directed acyclic task graph having arbitrary execution time and arbitrary communication delays. Additionally, we propose an O(n 2+mlog n) time algorithm to compute these bounds for a task graph with n nodes and m arcs. The key ideas of our approach include: (i) identification of certain points called event points and proving that the intervals having event points as both ends are enough to compute the desired bounds; and (ii) the use of a sweeping technique. Our bounds are shown to be as sharp as the current best known bounds due to Jain and Rajaraman [7]. However, their approach requires O(n 2+m log n+nW 2 erl) time, where Werl is the earliest execution time of the task graph when arbitrary number of processors are available. Thus, in general, our algorithm performs as good as their algorithm, and exhibits better time complexity for task graphs having \( W_{erl} > O\left( {\sqrt n } \right) \).
Part of this work was done while the first author was visiting the Department of Computer Science and Engineering, the University of Texas at Arlington. This work was supported by NASA Ames Research Center under Cooperative Agreement Number NCC 2-5395.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms, 1974, Addison-Wesley Publishing Company.
Al-Mouhammed, M. A. “Lower bound on the number of processors and time for scheduling precedence graphs with communication costs”. IEEE Trans. Soft. Engg. 12 (1990) 1390–1401.
El-Rewini, H. and Lewis, T. “Scheduling parallel program tasks onto arbitrary target machines”. J. of Parallel and Dist. Comput. 9, 2 (1990) 138–153.
Fernandez, E. V. and Bussell, “B. Bounds on the number of processors and time for multiprocessors optimal schedules”. IEEE Trans Comput 22 (1973 ) 745–751.
Graham, R. “Bounds on certain multiprocessing timing anomalies”, SIAM J. Appl. Math. 17, 2 (1969) 416–429.
Hwang, J. J., Chow, Y.C., Anger, F., and Lee, C. Y. “Scheduling Precedence graphs in systems with inter-processor communication times”. SIAM J. of Comput. 18, 2 (1989), 244–257.
Jain, K. K. and Rajaraman, V. “Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems.” J. of Parallel and Dist Comput. 28 (1995), 101–108.
Jung, H., Kirousis, L. M., and Spirakis, P. “Lower bounds and efficient algorithms for multiprocessor schedulingof directed acyclic graphs with communication delays”. Inform. and Comput. 105 (1993), 94–104.
Kwok Yu-Kwong and Ahmad I. “Static scheduling algorithms for allocating directed task graphs to multiprocessors”, ACM Computing Surveys, 31, 4 (1999) 406–471.
Kwok Yu-Kwongand Ahmad I. “Benchmarkingand comparison of the task graphs schedulingalg orithms”, J. of Parallel and Dist Comput 59, 103 (1999) 381–422.
Lee C.Y., Hwang J.J., Chow Y.C. and Anger, F. “Multiprocessor schedulingwith interprocessor communication delays”. Operations Res. Letters 7 (1988), 141–145.
Manoharan, S. and Thanisch, P. “Assigning dependency graphs onto processor networks”. Parallel Computing 17 (1991), 63–73.
Ullman, J. D. “NP-complete schedulingproblems”. J. Comput System Sci. 10 (1975), 384–393.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panda, B.S., Das, S.K. (2001). An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-45307-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43009-4
Online ISBN: 978-3-540-45307-9
eBook Packages: Springer Book Archive