On embedding between 2D meshes of the same size
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
|Journal / Publication||IEEE Transactions on Computers|
|Publication status||Published - 1997|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-0031365724&origin=recordpage|
Mesh is one of the most commonly used interconnection networks and, therefore, embedding between different meshes becomes a basic embedding problem. Not only does an efficient embedding between meshes allow one mesh-connected computing system to efficiently simulate another, but it also provides a useful tool for solving other embedding problems. In this paper, we study how to embed an s 1 ••t 1 mesh into an s 2 ••t 2 mesh, where s i••t i(i = 1, 2), s 1t 1 = s 2t 2, such that the minimum dilation and congestion can be achieved. First, we present a lower bound on the dilations and congestions of such embeddings for different cases. Then, we propose an embedding with dilation •s 1/s 2••+ 2 and congestion •s 1/s 2••+ 4 for the case s 1 ••s 2, both of which almost match the lower bound •s 1/s 2•. Finally, for the case s 1 ••s 2, we present an embedding which has a dilation less than or equal to 2√s 1. ©1997 IEEE.
- Dilation, Embedding, Mesh, Parallel processing, Vertex partition
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to email@example.com.