首页> 外文会议>International Symposium on Computer and Information Sciences(ISCIS 2004); 20041027-29; Kemer-Antalya(TR) >Static Mapping Heuristics for Tasks with Hard Deadlines in Real-Time Heterogeneous Systems
【24h】

Static Mapping Heuristics for Tasks with Hard Deadlines in Real-Time Heterogeneous Systems

机译:实时异构系统中具有硬期限的任务的静态映射启发式

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

摘要

Hard real-time tasks are associated with strict deadlines. Classical scheduling heuristics ensure fairness among tasks and prevent deadlock, but are not concerned with deadline compliance. Hence, there is a need for scheduling heuristics which prioritize tasks in a real-time system in a manner which guarantees timely completion of maximum number of tasks. In this paper, several static heuristics for mapping hard real-time tasks to machines in a heterogeneous distributed system have been described. These heuristics differ in their method of prioritizing tasks for scheduling, which results in varied performance. The heuristics have been outlined and simulated using a common set of assumptions. The performance parameter considered in this study is the number of user satisfied tasks.
机译:严格的实时任务与严格的期限相关联。经典的调度启发法可确保任务之间的公平性并防止死锁,但与截止日期合规性无关。因此,需要调度一种试探法,其以保证及时完成最大数量的任务的方式在实时系统中对任务进行优先级排序。在本文中,已经描述了几种用于将硬实时任务映射到异构分布式系统中的机器的静态启发式方法。这些启发式方法在优先级调度任务的方法上有所不同,从而导致性能有所不同。启发式方法已使用一组通用的假设进行了概述和模拟。本研究中考虑的性能参数是用户满意任务的数量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号