Abstract
We consider a task graph model taking into account the communication among tasks of a parallel system. First, we assume that the available number of processors is adequate for dealing with the whole width of the task graph (i.e. the number of processors is unbounded), and we propose a schedule, called Line-Schedule, which executes the tasks of a d-dimensional grid graph (d-D grid in short) in the optimal time. We continue by proving that Line-Schedule is the only strategy able to execute a d-D grid in the optimal time. Furthermore, we compute the minimum number of processors required to execute a d-D grid optimally.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, A. K. Chandra, M. Snir, Communication complexity of PRAMs, Theoretical Computer Science 71 3–28 (1990).
A. V. Aho, J. E. Hopcroft, J. D. UllmanThe Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
R.J. Anderson, P. Beame, W. Ruzzo, Low overhead parallel schedules for task graphs, Proc. ACM Symp. Parallel Algorithms and Architectures 66–75 (1990).
E. Bampis, C. Delorme, J-C. König, Optimal Schedules for d-D Grid Graphs with Communication Delays, Technical Report N∘ 4, LaMI, University of Evry.
E. Bampis, J-C. König, D. Trystram, A Low overhead schedule for a 3D-Grid Graph, Parallel Processing Letters 2 4 363–372 (1992).
C. G. Bell, Gordon Bell on the future of computers, interview in SIAM NEWS, February 1987.
G. Birkhoff, S. MacLane, Algebra, 2nd Edition, Macmillan, (1979).
E.G. Coffman, P.J. Denning, Operating Systems Theory, Prentice Hall (1972).
Y. Colin, P. Chretienne, CPM scheduling with small interprocessor communication delays, Operation Research 39 3 680–684 (1991).
R.L. Graham, D.E. Knuth, O. Patashnik Concrete Mathematics, Addison-Wesley, (1989).
J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).
H. Jung, L, Kirousis, P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, Proc. ACM Symp. Parallel Algorithms and Architectures (1989) 254–264, and Information and Computation 105 94–104 (1993).
C. Papadimitriou, J. Ullman, A Communication Time Tradeoff, SIAM J. on Computing 16 4 639–646 (1987).
C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. on Computing 19 2 322–328 (1990).
C. Picouleau, Etude des Problèmes d'Optimisation dans les Systèmes Distribués, Ph D Thesis, University Paris VI, France (1993).
V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics 18 55–71 (1987).
H. Wilf, Generatingfunctionology, Academic Press (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Delorme, C., König, J.C. (1996). Optimal schedules for d-D grid graphs with communication delays. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_53
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive