.png){kind=icon}
返回
On parallelization of static scheduling algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/32.624307.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Inter Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.
Keyword:
static scheduling
parallel scheduling algorithm
macro dataflow graph
modified critical-path algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.6
论文数:
2.9K
被引数:
1.1W
机构
暂无机构信息
引用论文
分享收藏Investigation of the optical properties of the Cr doped CuxO thin film deposited by thermionic vacuum arc plasma.png)
Optik
OptikIF0
PREAI
分享收藏
查看更多内容