.png){kind=icon}
返回
Expressing Coarse-Grain Dependencies Among Tasks in Shared Memory Programs
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2011.2166769.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Designers of embedded systems face tight constraints on resources, response time and cost. The ability to analyze embedded systems is essential to timely delivery of new designs. Many analysis techniques model parallel programs as task graphs. Task graphs capture the worst-case execution times of individual program tasks and the data dependencies among these. This paper introduces two compiler directives which let programmers annotate source code with data dependencies among tasks. Compiler analysis overapproximates the actual dependencies among tasks. The directives help eliminate potential data dependencies that do not occur at runtime. This lets tools compute more accurate task graphs from the annotated code. The correct use of the directives cannot be verified at compile time. Therefore, the check for correct use is done at runtime-not unlike dynamic array bounds checking in many languages. The overhead of verifying the correct use of the directives was measured on a set of benchmarks on two platforms. The overhead of runtime checks was found to be negligible in all instances.
Keyword:
Assertions
data dependencies
real-time and embedded systems
scheduling and task partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.9
论文数:
8.6K
被引数:
6.0W
机构
引用论文
分享收藏<title>Design and performance of a fiber Bragg grating distributed strain sensor system</title>
PREAI
分享收藏Re-Cloning the N27 Dopamine Cell Line to Improve a Cell Culture Model of Parkinson's Disease.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容