检索结果-内蒙古大学图书馆

THE partitioning OF QSDF COMPUTATION GRAPHS

PARALLEL COMPUTING 1989年第3期9卷 347-358页

作者： GOTTLIEB, I Department of Computer Science Bar Ilan University Tel Aviv Israel

In a previous paper the Quasi Synchronous Data Flow (QSDF) model of computation was presented. A data flow graph is partitioned into disjoint directed paths, called computation paths, with the object of permitting a processor to execute along such a path in a sequential manner as far as possible. Such sequential execution will be facilitated to the extent that each operator along the path, when encountered by the executing processor, will have been supplied with any operand(s) it may require from nodes on other computation paths. If such is found not to be the case, execution of the path must be suspended and will be resumed at such time as the operand arrives. In this paper, the question of how best to effect such a partition is addressed. A definition of optimality under the QSDF execution discipline is obtained and a closed form for the value of the cardinality of the partition is derived. An algorithm for obtaining an optimal partition is presented and some properties of the resulting partition are examined. Only static program behavior is considered in the analysis.

关键词： Parallel processing data flow graph Quasi Synchronous Data Flow (QSDF) model optimal partitioning of static program structure

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：