Optimal Approximate Scheduling for the parallel Tasks Flow Graph with the Requirement of Synchronization

您当前的位置：

首页 >

文章列表页 >

更新时间：2025-12-08

- Optimal Approximate Scheduling for the parallel Tasks Flow Graph with the Requirement of Synchronization
- Acta Electronica Sinica Issue 5, Pages: 22-27(1989)
- 作者机构：
  
  华中理工大学
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1989
- 稿件说明：
移动端阅览
[1]鄢勇,刘键.同步并行任务流图的最佳近似调度[J].电子学报,1989(05):22-27.

Yan Yong, Liu Jian. Optimal Approximate Scheduling for the parallel Tasks Flow Graph with the Requirement of Synchronization[J]. Acta Electronica Sinica, 1989, (5): 22-27.
[1]鄢勇,刘键.同步并行任务流图的最佳近似调度[J].电子学报,1989(05):22-27. DOI：

Yan Yong, Liu Jian. Optimal Approximate Scheduling for the parallel Tasks Flow Graph with the Requirement of Synchronization[J]. Acta Electronica Sinica, 1989, (5): 22-27. DOI：

本文针对顺序程序并行转换过程所产生的任务流图

在一定近似假定条件下

利用A

算法给出了一有效最佳分配算法

使系统获得最大加速比。

Refering to the tasks flow graph （TFG） produced by the procedure translatinga sequential program into a parallel form

based on an approximate assumption

an optimalscheduling algorithm for the TFG is presented by using the A algorithm. It gives an assurance that the system gain the maximal speedup.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰