A New Critical Compound Laxity Scheduling Algorithm on NCS

摘要：

The paper proposes a scheduling algorithm obeying the CL(Compound Laxity) rule for a kind of NCS (Networked Control System) with random delays. The CL scheduling is evolved from preemptive single processor real-time scheduling algorithms. Network-induced delay, dropout and jitter are inevitable when transmitting control information via shared closed-loop communication channel in NCS. Pointing to the above control problems caused by signal transmission, The paper algorithm takes all tasks into consideration to determine the moment optimal scheduling task priority due to the compound laxity, making sure all system tasks run with the critical deadline via the whole domain compound laxity,the algorithm realizes the task optimal scheduling globally. The example verified the validity of the algorithm.

关键词： Networked control system CL rule critical compound laxity critical deadline

作者: Lu Zhongda Xu Fengxia Zhang Jinfeng Jiang Hongxia

作者单位: College of Computer and Control Engineering of Qiqihar University, Qiqihar Heilongjiang China College of Computer and Control Engineering of Qiqihar University ,Qiqihar Heilongjiang China,School College of Computer and Control Engineering of Qiqihar University ,Qiqihar Heilongjiang China

会议类型: 国际会议

会议名称: 2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)

会议地点: 四川绵阳

会议语种:英文

页码: 2161-2164

在线出版日期: 2011-05-23（万方平台首次上网日期，不代表论文的发表时间）