| 摘要: |
| 子网分配问题是指识别并分配一个空闲的、满足指定大小要求的节点机.首先,提出了网格结构中一种新的具有O(N2a·1og2Na)时间复杂度的空闲子网搜索算法,它优于现有的O(N3a)时间复杂度的搜索算法.然后,用该算法对基于保留因子的最佳匹配类子网分配算法——RF(reservation factor)算法进行了改进,得到了 |
| 关键词: 子网分配 网格 空闲子网 |
| DOI： |
| 分类号: |
| 基金项目:国家“九五”国防预研基金资助项目(16.1.4.1) |
|
| An Improved Submesh Allocation Scheme for Mesh Multicomputers |
|
ZHANG Yan,SUN Shi xin,PENG Wen qin
|
| Abstract: |
| The submesh allocation problem is to recognize and allocate a free submesh that can accommodate a request for a submesh of a specified size. Firstly, a new algorithm of searching free submesh for mesh multicomputers is proposed, which time complexity is O(N2a·log2Na), better than those existed algorithms whose time complexity are O(N3a) . Then this new algorithm is used to improve the best fit allocation scheme which is based on reservation factor--RF scheme, and the result is better than it. |
| Key words: words submesh allocation mesh free submesh |
