| 群机系统上单并发任务簇的近优分配算法 |
| |
| 引用本文： | 张宏莉,胡铭曾,方滨兴,王义和.群机系统上单并发任务簇的近优分配算法[J].计算机研究与发展,1999,36(9):1076-1079. |
| |
| 作者姓名： | 张宏莉 胡铭曾 方滨兴 王义和 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系,哈尔滨,150001 |
| |
| 基金项目： | 国防科工委“九五”预研项目基金 |
| |
| 摘 要： | 缩短程序的序的时间是并行处理的首要目标，有效的任务分配算法是实现这一目标的关键，对群机４系统来说更是如此。文中针对并行语言中常用的并行范式－单并发任务簇提出了近优分配算法ＯＰＴＡ，并在群机系统上做了与ＭＨ算法的比照实验，结果表明较ＭＨ算法缩短程序执行时间１０％左右．
|
| 关 键 词： | 并行计算 任务分配 群机系统 |
A SUB-OPTIMAL ALGORITHM ON ALLOCATING A SINGLE TASK CLUSTER ON NOWs |
| |
| ZHANG Hong-Li,HU Ming-Zeng,FANG Bin-Xing,WANG Yi-He.A SUB-OPTIMAL ALGORITHM ON ALLOCATING A SINGLE TASK CLUSTER ON NOWs[J].Journal of Computer Research and Development,1999,36(9):1076-1079. |
| |
| Authors: | ZHANG Hong-Li HU Ming-Zeng FANG Bin-Xing WANG Yi-He |
| |
| Abstract: | Reducing the execution time of program is a main goal of parallel processing ,while an efficient task allocation algorithm is a crucial step,especially on NOWs. A sub\|optimal algorithm OPTA on allocating a single task cluster to physical processors is presented in the paper here, and this task cluster is a common parallel paradigm in most parallel programming languages.An experiment of comparing with algorithm MH is made, and the results show that algorithm OPTA cuts 10% cost. |
| |
| Keywords: | parallel processing task allocation NOWs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
