首页> 外国专利> Real-time schedulability determination method and real-time system

Real-time schedulability determination method and real-time system

机译:实时可调度性确定方法及实时系统

摘要

Schedulability determination method of determining whether real-time scheduling of tasks is possible using processors, includes calculating Lk and Σi=1 . . . NMi*Uk, i, (1≦k, i≦N; k, i: integer) where Lk corresponds to task-k, Mi represents number of the one or more processors simultaneously used by task-i, Uk, i corresponds to task-k and task-i, and N represents number of tasks, and determining that real-time scheduling of tasks is possible using processors, if tasks all satisfy conditions, Σi=1 . . . NMi*Uk, i≦Lk for all k (1≦k≦N), wherein Lk corresponds to task-k which is to be detected to satisfy corresponding one of conditions, Lk being expressed as followsif Mk≦(M+1)/2,Lk=(M−Mk+1)−(M−2Mk+1)Ck/Dk, and;Uk, i is expressed as followsif Mk≦(M+1)/2, Mi(M+1)/2, and Xk, i≦0,  (1)Uk, i=Ci/Ti{1+(Ti−Di)/Dk}+Ci/Dk, if Mk≦(M+1)/2, Mi(M+1)/2, and 0Xk, iCi/Ti,  (2)Uk, i=Ci/Ti{1+(Ti−Di)/Dk}+(Ci−Xk, i*Ti)/Dk, andif Mk≦(M+1)/2, Mi(M+1)/2 and Ci/Ti≦Xk, i,  (3)Uk, i=Ci/Ti{1+(Ti−Di)/Dk}, where M represents number of processors, Ti represents interval of task-i, Ci represents process time for processing task-i, Di represents relative deadline of task-i, and Xk, i={Mk−Mi+(M−2Mk+1)Ck/Dk}/(M−2Mi+1).
机译:使用处理器确定任务的实时调度是否可能的可调度性确定方法包括计算Lk和Σ i = 1。 。 。 N U * Uk,i,(1≤k,i≤N; k,i:整数),其中Lk对应于任务k,Mi表示任务i同时使用的一个或多个处理器的数量, Uk,i对应于任务k和任务i,N代表任务数,如果任务全部满足条件∑ i = 1,则确定可以使用处理器进行任务的实时调度。 。 。 N Uk,对于所有k(1≤k≤N),i≤Lk,其中,Lk对应于要被检测为满足相应条件之一的任务k,Lk表示如下<?in-line-formulae description =“在线表达式” end =“ lead”?>如果 Mk ≦( M +1)/ 2,<?in -line-formulae description =“在线公式” end =“ tail”?> <?in-line-formulae description =“在线公式” end =“ lead”?> Lk = ( M-Mk +1)-( M -2 Mk +1) Ck / Dk 和< ?in-line-formulae description =“ In-line Formulae” end =“ tail”?>;英国,我表示如下<?in-line-formulae description =“在线表达式” end =“ lead”?>如果 Mk ≦( M +1)/ 2, Mi <( M +1)/ 2,并且Xk,i≤0,(1)<?in-line-formulae description =“ In-line Formulae” end =“ tail “?> <?in-line-formulae description =” In-line Formulae“ end =” lead“?> Uk,i = Ci / Ti {1 +( Ti-Di < / I>)/ Dk} + Ci / Dk, <?in-line-formulae description =“在线表达式” end =“ tail”?> <?in-line-formulae description = “在线公式” end =“ lead”?>如果 Mk ≦( M +1)/ 2, Mi <(< > M +1)/ 2,并且0 I> Xk,i (2)<?in-line-formulae description =“ In-line Formulae” end = “ tail”?> <?in-line-formulae description =“ In-line Formulae” end =“ lead”?> Uk,i = Ci / Ti {1 +( Ti− Di )/ Dk } +( Ci-Xk,i * Ti )/ Dk 和<?公式description =“ In-line Formulae” end =“ tail”?> <?in-line-formulae description =“ In-line Formulae” end =“ lead”?>如果 Mk ≦(< I> M +1)/ 2, Mi <( M +1)/ 2和 Ci / Ti≦Xk,i,(3)<?in-line-formulae description =“在线表达式” end =“ tail”?> <?in- line-formulae description =“ In-line Formulae” end =“ lead”?> Uk,i = Ci / Ti {1 +( Ti-Di )/ Dk}, <?in-line-formulae description =“ In-line Formulae” end =“ tail”?>其中M代表处理器数量,Ti代表任务i的间隔,Ci代表处理任务i的处理时间,Di代表任务i的相对期限,Xk,i = {Mk-Mi +(M-2Mk + 1) Ck / Dk} /(M-2Mi + 1)。

著录项

  • 公开/公告号US7797703B2

    专利类型

  • 公开/公告日2010-09-14

    原文格式PDF

  • 申请/专利权人 OSAMU TORII;SEIJI MAEDA;

    申请/专利号US20050085532

  • 发明设计人 OSAMU TORII;SEIJI MAEDA;

    申请日2005-03-22

  • 分类号G06F9/46;G06G7/00;G06G7/32;

  • 国家 US

  • 入库时间 2022-08-21 18:51:14

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号