Encoding Data Structures in Trees
Journal of the ACM (JACM)
Preserving average proximity in arrays
Communications of the ACM
On the parallel decomposability of geometric problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Embedding Complete Binary Trees Into Butterfly Networks
IEEE Transactions on Computers
On Embedding Between 2D Meshes of the Same Size
IEEE Transactions on Computers
Improved Compressions of Cube-Connected Cycles Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient embeddings of ternary trees into hypercubes
Journal of Parallel and Distributed Computing
Proceedings of the 1st international conference on Embedded networked sensor systems
| Hi-index | 0.01 |
Let G and H be two mesh-connected arrays of processors, where G = g1, X g2 X … X g1, H = h1 x h2 x … x hd, and g1 … g1 ≤ h1 … hd. The problem of simulating G by H is considered and the best possible simulation in terms of the gi's and hi'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.