Affiliation:
1. Johns Hopkins Univ., Baltimore, MD
2. Purdue Univ., West Lafayette, IN
Abstract
Let
G
and
H
be two mesh-connected arrays of processors, where
G
=
g
1
, X
g
2
X … X
g
1
,
H
=
h
1
x
h
2
x … x
h
d
, and
g
1
…
g
1
≤
h
1
…
h
d
. The problem of simulating
G
by
H
is considered and the best possible simulation in terms of the
g
i
's and
h
i
's is characterized by giving such a simulation and proving its optimality in the worst-case sense. Also the same bound on the average cost of encoding the edges of
G
as distinct paths in
H
is established.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mutual Embeddings;Journal of Interconnection Networks;2015-03
2. The embedding of rings and meshes into RP(k) networks;Science in China Series F;2004
3. Efficient embeddings of ternary trees into hypercubes;Journal of Parallel and Distributed Computing;2003-06
4. Efficient embeddings of grids into grids;Discrete Applied Mathematics;2001-02
5. Optimal Embedding of Complete Binary Trees into Lines and Grid;Journal of Parallel and Distributed Computing;1998-02