Abstract:
This paper analyzes the advantages and disadvantages of current schedule algorithms based on execution strategies for Programming Temporally Integrated Distributed Embedded Systems(PTIDES), considers both event deadline and event execution time, improves the traditional minimum slack time priority algorithm, configures the slack time as event scheduling priority, and presents a new zero slack time priority PTIDES scheduling algorithm——ZSFPTIDES. The example shows that ZSFPTIDES scheduling algorithm avoids mortality of events due to the lack of real-time processing, reduces the rate of event scheduling switch, and optimizes the performance of distributed real-time embedded system.
Key words:
Programming Temporally Integrated Distributed Embedded Systems(PTIDES) model,
execution time,
deadline,
thrashing,
Zero Slack First(ZSF) algorithm
摘要: 分析现有PTIDES执行策略调度算法,综合考虑事件的截止期和执行时间,改进传统最小空闲时间优先算法,将空闲时间作为事件调度优先权,提出零空闲时间优先PTIDES调度算法——ZSFPTIDES。实例分析表明,ZSFPTIDES调度算法能避免事件在处理过程中因得不到及时处理而夭折的现象,减小事件的抢占切换率,优化分布实时嵌入式系统的调度性能。
关键词:
PTIDES模型,
执行时间,
截止期,
颠簸,
零空闲时间优先算法
CLC Number:
LU Jing, ZHANG Jing. Schedule Algorithm Based on PTIDES Execution Strategy[J]. Computer Engineering, 2011, 37(18): 258-259.
鲁静, 张晶. 基于PTIDES执行策略的调度算法[J]. 计算机工程, 2011, 37(18): 258-259.