%0 Journal Article
%T Mapping between 2-d meshes of the same size<br>Mapping Between 2-D Meshes of the Same Size
%A Peng Guoqiang
%A <br>Peng
%A Guoqiang
%J 计算机科学技术学报
%D 1997
%I 
%X Given two 2-D meshesM 1 andM 2 of sizess i×ti wheres i≤ti (i=1,2) ands 1×t 1=s 2×t 2, embeddingM 1 toM 2 with minimum dilation is studied. First, several lower bounds on the dilations of embedding in different cases are presented. Then, an embedding algorithm with dilation s 1/s 2]+2 for the cases 1≤s 2 is proposed, which almost matches the lower bound s 1/s 2]. For the cases 1<s 2, another embedding algorithm is given with dilation min {ζ(s 1,h′)°, ζ(s 2,s 1)}, where ζ(s 1,h′)=min{ζ(s 1, s 2,s 1) , ζ(t 1, (2,s 1)))} Peng Guoqiang is a Lecturer in Huazhong University of Science and Technology. His research interests include distributed operating systems and parallel processing.
%K Dilation
%K embedding
%K mesh
%K parallel processing<br>并行算法
%K 并行处理
%K 网络拓扑
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=3E7179EDE74C89C68E86C6F679DDFBCA&yid=5370399DC954B911&vid=59906B3B2830C2C5&iid=94C357A881DFC066&sid=47F7649551A37CFC&eid=D93AD940782892D0&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=15