Abstract
In this paper, we consider an extension of the well known PRAM model for parallel distributed-memory computers using local communications. We present scheduling algorithms for the execution of complete binary trees on hypercube, de Bruijn, linear and grid interconnection networks on this model. We also show that a two dimensional grid precedence graph can be executed in optimal time on all these networks.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.J. Anderson, P. Beame, W. Ruzzo, Low Overhead Parallel Schedules for Task Graphs, Proc. SPAA (1990).
E. Bampis, J-C. König, D. Trystram, A Low overhead schedule for a 3D-Grid Graph, Parallel Processing Letters Vol. 2, Nℴ 4, (1992) pp 363–372.
N.G. De Bruijn, A Combinatorial Problem, Koninlijke Nederlandsa Academie van Wettenschappen Proc., Ser. A49, 758–764, (1946).
S.H. Bokhari, On the Mapping Problem, IEEE Trans. Comput. C-30, (1981), pp 207–214.
E.G. Coffman, P.J. Denning, Operating Systems Theory, Prentice Hall (1972).
M. Cosnard, A. Ferreira, Designing parallel non numerical algorithms, in Parallel Computing '91, Eds. D.J. Evans et coll., North Holland (1991) pp 3–18.
A. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, (1988).
R.M. Karp, V. Ramachandran, A survey of parallel algorithms for shared memory machines, Handbook of Theor. Comp. Sc., Ed. Van Leeuwen, North Holland (1992) pp 869–942.
S. Rao Kosaraju, A.L. Delcher, Optimal Parallel Evaluation of Tree-structured Computations by Raking, LNCS nℴ 319, VLSI Algorithms and Architectures, pp 103–110.
G.L. Millet, V. Ramachandran, E. Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits, Proc. Aegean Workshop on Computing, LNCS nℴ 227, (1986), pp 236–251.
A. Gibbons, M. Patterson, Dense-Edgs Embedding of binary trees in the mesh, Proc. SPAA, (1992) pp 257–263.
M.S. Patterson, W.L. Ruzzo, L. Snyder, Bounds on Minimax Edge Length for Complete Binary Trees, Proc. of the 13th ACM Symp. on the Theory of Comp., (1981), pp 293–299.
C. Papadimitriou, J. Ullman, A Communication Time Tradeoff, SIAM J. on Computing, Vol. 16, No 4, (1987), pp 639–646.
W.L. Ruzzo, L. Snyder, Minimum Edge Length Planar Embeddings of Trees, in Kung, Sprull, Steele: VLSI Systems and Computations, Comp. Sc. Press, 119–123(1981).
Y. Saad, Some Topological Properties of the Hypercube Multiprocessor, Research Report 389, Dept. Comp. Sc., Yale University (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., König, J.C., Trystram, D. (1994). Optimal parallel execution of complete binary trees and grids into most popular interconnection networks. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_95
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive