• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFIP(International Federation for Information Processing) WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems(SEUS 2007); 20070507-08; Santorini Island(GR) >On Distributed Real-Time Scheduling in Networked Embedded Systems in the Presence of Crash Failures
【24h】

On Distributed Real-Time Scheduling in Networked Embedded Systems in the Presence of Crash Failures

机译：存在崩溃故障时网络嵌入式系统中的分布式实时调度

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

摘要

We consider the problem of scheduling distributable realtime threads in networked embedded systems that operate under runtime uncertainties including those on thread execution times, thread arrivals, and node failure occurrences. We present a distributed scheduling algorithm called CUA. We show that CUA satisfies thread time constraints in the presence of crash failures, is early-deciding, has an efficient message complexity of O(fn) (where f is the number of crashes that actually occur and n is the number of nodes), and is time-optimal with a time lower bound of O(D + fd + nk) (where D is the message delay upper bound, d is the failure detection bound, and k is the maximum number of threads). In crash-free runs, the algorithm constructs schedules within O(D + nk), and yields optimal total utility if nodes are also not overloaded. The algorithm is also "best-effort" in that a high importance thread that may arrive at any time has a very high likelihood for feasible completion (in contrast to classical admission control algorithms which favor feasible completion of admitted threads over admitting new ones, irrespective of thread importance).
机译：我们考虑在运行时不确定性（包括线程执行时间，线程到达和节点故障发生的不确定性）下运行的网络嵌入式系统中调度可分发实时线程的问题。我们提出了一种称为CUA的分布式调度算法。我们证明，在出现崩溃故障的情况下，CUA可以满足线程时间约束，是早期决定的，其消息复杂度为O（fn）（其中f是实际发生的崩溃数，n是节点数），并且是时间最优的，其时间下限为O（D + fd + nk）（其中D是消息延迟上限，d是故障检测界限，k是最大线程数）。在无崩溃运行中，该算法在O（D + nk）内构造时间表，并且如果节点也未过载，则产生最佳的总效用。该算法也是“尽力而为”的方法，因为可能随时到达的高重要性线程具有非常高的可能性完成可行的操作（与传统的准入控制算法相比，传统的准入控制算法倾向于允许已完成线程的可行完成而不是接纳新线程）线程的重要性）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号