数值计算与计算机应用 1990, 11(2 ) 138-154 DOI:     ISSN: 1000-3266 CN: 11-2124/TP

本期目录 | 下期目录 | 过刊浏览 | 高级检索                                                            [打印本页]   [关闭]
论文
扩展功能
本文信息
Supporting info
PDF(0KB)
[HTML全文](0KB)
参考文献[PDF]
参考文献
服务与反馈
把本文推荐给朋友
加入我的书架
加入引用管理器
引用本文
Email Alert
文章反馈
浏览反馈信息
本文关键词相关文章
本文作者相关文章
PubMed

流水处理中处理机分配的近似解决方法

鲍有立,陈清云

深圳大学电子系 ;美国匹兹堡大学计算机科学系

摘要

一、简介在流水处理中经常需要解决处理机资源的分配问题。图1中有向图结构表示的是一个具有m个模块的流水线。这里每一个结点代表一个

关键词

AN APPROXIMATE SOLUTION TO PROCESSOR ASSIQNMENT IN A PIPELINE PROCESSING SYSTEM

Bao You-li;Chen Qing-yun Department of Electronics, Shenzhen University Department fo Computer Science, Pittsburgh University

Abstract:

In a pipeline processing system, each execution module may represent a program module,or an image in an image analysis system, or a processing step in a signal processing system. Generally, the number of modules to be executed is larger than the number of processorsto be assigned. An optimal assignment of processors in the pipeline means a minimum bot-tleneck of the pipeline system; thus a maximum throughput is obtained. One way to find out the optimal assignment is to enumerate all possible schemes of as-signment, and then to determine which one of them has the minimum bottleneck. Accordingto a recent study made by Bokhari an algorithm based on this method needs O(m~3n) of time,so it is not a good way to solve the problem of optimal assignment due to its too much com-putation time. A practical and efficient approach is presented in this paper to solve the problem. De-fects of Bokhari's algorithm are also specified.

Keywords:
收稿日期  修回日期  网络版发布日期  
DOI:
基金项目:

通讯作者:
作者简介:

本刊中的类似文章

Copyright 2008 by 数值计算与计算机应用