【24h】

An Evolutionary Scheme for Cosynthesis of Real-Time Systems

机译:实时系统的综合进化方案

获取原文
获取原文并翻译 | 示例

摘要

We consider the problem of hardware-software cosynthesis of application-specific embedded real-time systems. We assume that these systems are based on a heterogeneous multiprocessor architecture. One of the key problems in the synthesis of such systems is that of scheduling the real-time tasks. Conventional approach to the problem has been to use a task graph to describe the dependencies among tasks and to assign constant weights to the nodes and edges of the graph. The node weights represent task execution times and the edge weights represent communication times. However, in many real-time applications, the execution time and communication times cannot be determined a-priori. One can use the conventional task graph model in such situations by taking the worst-case times, but such an approach will necessarily be pessimistic and wateful in terms of resource utilization. We propose a model which treats the task execution times and communication times as stochastic variables w! ith Beta distributions. A stochastic task scheduling algorithm is presented which maximizes the probability of meeting all real-time constraints. A genetic algorithm, which employs the stochastic scheduling algorithm, is used for the synthesis of a high performance embedded system at a minimum cost. We present experimental results for three task graphs.
机译:我们考虑了专用嵌入式实时系统的软硬件综合问题。我们假设这些系统基于异构多处理器体系结构。这种系统的综合中的关键问题之一是调度实时任务。解决该问题的常规方法是使用任务图来描述任务之间的依赖性,并为图的节点和边缘分配恒定的权重。节点权重代表任务执行时间,边缘权重代表通信时间。但是,在许多实时应用中,无法事先确定执行时间和通信时间。在最坏的情况下,可以在这种情况下使用传统的任务图模型,但是就资源利用而言,这种方法必定是悲观的且令人生厌的。我们提出了一个将任务执行时间和通讯时间视为随机变量w!的模型。 Beta分布。提出了一种随机任务调度算法,该算法最大化了满足所有实时约束的可能性。采用随机调度算法的遗传算法被用于以最小的成本来合成高性能嵌入式系统。我们介绍了三个任务图的实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号