• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Online Scheduling of Dynamic Task Graphs with Communication and Contention for Multiprocessors
【24h】

Online Scheduling of Dynamic Task Graphs with Communication and Contention for Multiprocessors

机译：具有通信和争用的多处理器动态任务图在线调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents an online scheduling methodology for task graphs with communication edges for multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature either due to the presence of conditional paths or due to presence of tasks whose execution times vary. We have assumed homogeneous processors with broadcast and point-to-point communication models and have presented online algorithms for them. We show that this technique adapts better to variation in task graphs at runtime and provides better schedule length compared to a static scheduling methodology. Experimental results indicate up to 21.5 percent average improvement over purely static schedulers. The effects of model parameters like number of processors, memory, and other task graph parameters on performance are investigated in this paper.
机译：本文为多处理器嵌入式系统的通信边界提供了任务图的在线调度方法。所提出的方法被设计用于本质上是动态的任务图，这归因于条件路径的存在或由于执行时间变化的任务的存在。我们假设具有广播和点对点通信模型的同类处理器，并为其提供了在线算法。我们显示，与静态调度方法相比，该技术更适合运行时任务图的变化，并提供更好的调度长度。实验结果表明，与纯静态调度程序相比，平均性能提高了21.5％。本文研究了诸如处理器数量，内存和其他任务图参数之类的模型参数对性能的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号