计算机工程与应用2018，Vol.54Issue(9)：22-27,6.DOI:10.3778/j.issn.1002-8331.1801-0270
一类特殊的非抢占式周期任务的调度方法
Scheduling methods for special type of non-preemptive periodic tasks
摘要
Abstract
Many actual resource schedule problems for different tasks have timeliness,but few research has been focused on this kind of problem.This paper studies the problem,discusses the difference with some models that have been studied well,then proposes a new schedule model for non-preemptive periodic tasks,and proves the problem to be NP-Complete problem.After that,this paper gives two algorithms to solve the schedule problem,one for optimal solutions called pattern pruning algorithm,and the other for approximation solutions called fast solving algorithm.The experimental result shows that the algorithms can deal the schedule problem efficiently according to different situation.关键词
调度问题/周期任务/非抢占式调度/调度算法/剪枝算法Key words
schedule problem/periodic task/non-preemptive scheduling/schedule algorithm/pruning algorithm分类
信息技术与安全科学引用本文复制引用
李智翔,李赟,贺亮..一类特殊的非抢占式周期任务的调度方法[J].计算机工程与应用,2018,54(9):22-27,6.基金项目
国家自然科学基金(No.61221063,No.61403301). （No.61221063,No.61403301）
