| 一种最佳的Mesh中的空闲子网搜索算法 |
| |
| 引用本文： | 张艳,孙世新,彭文钦.一种最佳的Mesh中的空闲子网搜索算法[J].系统工程与电子技术,2001,23(4):83-86. |
| |
| 作者姓名： | 张艳 孙世新 彭文钦 |
| |
| 作者单位： | 电子科技大学计算机学院, |
| |
| 基金项目： | “九五”国防科技预研项目基金资助课题(16.1.4.1) |
| |
| 摘 要： | 在并行机系统中为了获得系统的高性能，对任务进行处理的有效分配是至关重要的，这需要用最小的时间开销识别所有的空闲处理机。针对网格多处理机的子网分配，提出了一种新的子网搜索算法，该算法实现简单，时间复杂度为O(N
|
| 关 键 词： | 并行处理机 搜索 算法 |
| 文章编号： | 1001-506X(2001)04-0083-04 |
| 修稿时间： | 2000年3月27日 |
A Best Algorithm for
Searching Free Submesh on Mesh |
| |
| Zhang Yan\ \ Sun Shixin\ \ Peng WenqinSchool of Computer Science,UEST,Chengdu.A Best Algorithm for
Searching Free Submesh on Mesh[J].System Engineering and Electronics,2001,23(4):83-86. |
| |
| Authors: | Zhang Yan\ \ Sun Shixin\ \ Peng WenqinSchool of Computer Science UEST Chengdu |
| |
| Institution: | Zhang Yan\ \ Sun Shixin\ \ Peng WenqinSchool of Computer Science,UEST,Chengdu 610054 |
| |
| Abstract: | Efficient allocation of processors for incoming tasks is very important for achieving high performance in parallel computer system. It requires to recognize free available processors with minimum overhead. In this paper, a new algorithm of searching free submesh for submesh allocation on mesh is proposed, it can be realized easily, its time complexity is O(N2a.log2Na, Na is defined as the number of allocated submesh), which is better than that of previously proposed algorithms, whose time complexity is O(N3a). |
| |
| Keywords: | Parallel processor Searching Algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
