摘要：In a periodic real-time system scheduled with the Earliest Deadline First(EDF)algorithm,it is necessary to compress some current tasks to avoid overloading if new task requests to run.Compressing a task means that its period is prolonged while its computation time keeps unchanged.An interesting problem is to find the earliest time to release new tasks without any deadline missing,that is,the earliest smooth insertion time.In this paper,a general frame to calculate the earliest time with multiple rounds of deadline checking is given,which shows that the checking can be done from the request time of the new tasks.A smart way is provided and proved,which takes the value of theΔchecking of the current round as the time step to the next.These techniques potentially reduce the amount of the calculation and the number of the rounds of the checking to get the earliest time.Simulation results are also given to support the conclusion.
分类：期刊> 自然科学与工程技术> 信息科技> 电子信息科学综合
收录：北大期刊(中国人文社会科学期刊) > CSCD 中国科学引文数据库来源期刊(含扩展版) > 统计源期刊(中国科技论文优秀期刊) > 知网收录(中) > 维普收录(中) > 万方收录(中) > CA 化学文摘(美) > JST 日本科学技术振兴机构数据库(日) > Pж(AJ) 文摘杂志(俄) > 哥白尼索引(波兰) > 国家图书馆馆藏 > 上海图书馆馆藏 > 文摘杂志
关键词：total utilization new tasks insertion simple way smart
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
