Abstract
We prove exact results on dilations in cycles for important graphs corresponding to fundamental interconnection networks of parallel computers as complete trees, hypercubes and 2- and 3-dimensional meshes. Moreover we show that trees, X-trees, n-dimensional meshes, pyramides and trees of meshes have the same dilations both in the path and the cycle.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.J.Atallah, S.R.Kosaraju: Optimal simulations between mesh-connected arrays of processors, J. Association for Computing Machinery, 35, 3, 1988, 635–650.
S.N.Bhatt, F.T.Leighton: A framework for solving VLSI graph layout problems, J. Computer and System Science, 28, 1984, 300–343.
P.Z.Chinn, J.Chvátalová, A.K.Dewdney, N.E.Gibbs: The bandwidth problem for graphs and matrices — a survey, J. Graph Theory, 6, 1982, 223–254.
F.R.K.Chung: Labelings of graphs. In: Selected Topics in Graph Theory 3, (eds. L.Beineke and R.Wilson), Academic Press, 1988, 151–168.
J.Chvátalová: Optimal labeling of a product of two paths, Discrete Mathematics, 11, 1975, 249–253.
J.Chvátalová, A.K.Dewdney, N.E.Gibbs, R.R.Korfhage: The bandwidth problem for graphs: a collection of recent results. Research Report No. 24, Department of Computer Science, UWO, London, Ontario, 1975.
C.H.FitzGerald: Optimal indexing of the vertices of graphs, Mathematics of Computation, 28, 127, 1974, 825–831.
F.Harary: Graph Theory, Addison Wesley Publishing Company, Reading, 1969.
L.H.Harper: Optimal numberings and isoperimetric problems on graphs, J. Combinatorial Theory, 1, 1966, 385–393.
T.H.Lai, W.White: Embeddings pyramids in hypercubes, Research Report No. 41, CISRC, OSU, Columbus, Ohio, 1987.
J.Y.T.Leung, O.Vornberger, D.Witthoff: On some variants of the bandwidth minimization problem, SIAM J. Computing, 13, 3, 1984, 650–667.
Y.W.Ma, B.Narahari: Optimal mappings among interconnection networks foiperformance evaluation. In: Proceedings of the 6-th International Conference on Distributed Computing Systems, 1986, 16–25.
B.Monien, H.Sudborough: Embedding one interconnection network in another, Computing Supplement, 7, 1990, 257–282.
M.S.Paterson, H.Schröder, O.Sýkora, I.Vrto: Optimal embedding of a toroidal mesh in a path. Submitted for publication.
I.A.Rosenberg, L.Snyder: Bounds on the cost of data encodings, Mathematical System Theory, 12, 1978, 9–39.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hromkovič, J., Müller, V., Sýkora, O., Vrťo, I. (1992). On embedding interconnection networks into rings of processors. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_80
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive