首页> 外文会议>Logic programming >Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint Programming
【24h】

Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint Programming

机译:使用约束编程在MPSoC平台中处理多个用例的资源管理策略

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

摘要

Multi-processor system-on-chip (MPSoC) technology is finding widespread application in the embedded system domain, like in cell phones, automotive control units or avionics. Once deployed in field, these devices always run the same set of applications, in a well-characterized context. It is therefore possible to spend a large amount of time for off-line software optimization and then deploy the results on the field. Each possible set of applications that can be active simultaneously in an MPSoC platform leads to a different use-case that the system has to be verified and tested for. Above all, smooth switching between use-cases falls within the scope of the resource manager, since users should not experience artifacts or delays when a transition between any two consecutive use-cases takes place. In this paper, we propose a semi-static approach to the resource management problem, where the allocation and scheduling solutions for the tasks in each use-case are computed off-line via a Logic Based Benders Decomposition approach using Constraint Programming and stored for use in run-time mapping decisions. The solutions are logically organized in a lattice, so that the transition costs between any two consecutive use-cases can be bound. The resulting framework exhibits both a high level of flexibility and orders of magnitude speed ups w.r.t. monolithic approaches that do not exploit decomposition.
机译:多处理器片上系统(MPSoC)技术正在嵌入式系统领域中得到广泛应用,例如在手机,汽车控制单元或航空电子设备中。一旦在现场部署,这些设备将始终在良好描述的上下文中运行同一组应用程序。因此,可以花费大量时间进行离线软件优化,然后将结果部署到现场。在MPSoC平台中可以同时激活的每种可能的应用程序集,都导致必须对系统进行验证和测试的不同用例。最重要的是,用例之间的顺畅切换属于资源管理器的范围,因为当在任何两个连续用例之间进行转换时,用户不应遭受人工或延迟。在本文中,我们提出了一种半静态方法来解决资源管理问题,其中使用约束编程通过基于逻辑的Benders分解方法离线计算每个用例中任务的分配和调度解决方案,并存储以供使用在运行时映射决策中。这些解决方案在逻辑上组织成一个格子,因此可以限制任何两个连续用例之间的转换成本。由此产生的框架既显示出高度的灵活性,又显示出数量级的加速。不利用分解的整体方法。

著录项

  • 来源
    《Logic programming》|2008年|470-484|共15页
  • 会议地点 Udine(IT);Udine(IT)
  • 作者单位

    DEIS, University of Bologna V.le Risorgimento 2, 40136, Bologna, Italy;

    Dipartimento di Ingegneria, University of Ferrara V. Saragat 1, 41100, Ferrara, Italy;

    DEIS, University of Bologna V.le Risorgimento 2, 40136, Bologna, Italy;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 程序设计、软件工程;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号