| 一种新颖的并行程序配置优化算法 |
| |
| 引用本文： | 毛友发,杨明福. 一种新颖的并行程序配置优化算法[J]. 计算机应用与软件, 2005, 22(11): 92-95 |
| |
| 作者姓名： | 毛友发 杨明福 |
| |
| 作者单位： | 华东理工大学信息学院,上海,200237;华东理工大学信息学院,上海,200237 |
| |
| 摘 要： | 本文提出了一种新颖的并行程序配置优化算法。这种算法利用黑板系统将配置优化问题分解组织为不同层次的知识领域，并利用A^＊算法对决策树进行搜索。研究了并行程序的任务调度、存储服务器的数据分配、自适应分片、协同I／O和数据筛选五个知识领域。
|
| 关 键 词： | 黑板系统 A*算法 分片 并行 |
| 收稿时间： | 2004-03-24 |
| 修稿时间： | 2004-03-24 |
A NOVEL OPTIMAL CONFIGURATION ALGORITHM OF PARALLEL COMPUTING |
| |
| Mao Youfa,Yang Mingfu. A NOVEL OPTIMAL CONFIGURATION ALGORITHM OF PARALLEL COMPUTING[J]. Computer Applications and Software, 2005, 22(11): 92-95 |
| |
| Authors: | Mao Youfa Yang Mingfu |
| |
| Affiliation: | Information Science and Engineering Institute ,East China University of Science and Technology, Shanghai 200237, China |
| |
| Abstract: | A novel optimal configuration algorithm of combined parallel computing and parallel storage is proposed. The algorithm utilizes blackboard system to solve the running time optimization problem of parallel program. The problem is divided into different knowledge areas and organized them as tree. Task scheduling, data distribution of storage server, adaptive disk striping,collective I/O and data sieving are considered. The experimental results show that the processor distribution and task scheduling using CPR has much advantage over static task scheduling. The advantage of dynamic I/O configuration is not very great over static I/O configuration because the I/O access time is only a small percentage of total application running time. |
| |
| Keywords: | Blackboard system A~* algorithm Disk striping Parallel |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
