摘要
本文介绍了对作者提出的一种基于线程的、动态的、非抢占的多处理器实时任务调度算法的计算机模拟和结果分析，表明该算法在单处理器情况下比许多单处理器实时任务调度算法的调度效率高，在多处理器情况下的调度效率也较高。
This paper describes computer simulation and analysis of a thread-based,dynamic, non-preemptive multiprocessor real-time task scheduling algorithm proposed by the author.Simulation results indicate that the algorithm is more effecient than many uniprocessor real-time task scheduling algorithms in uniprocessor case and it is also effective in multiprocessor case.
出处
《计算机工程与设计》
CSCD
北大核心
1995年第6期55-60,共6页
Computer Engineering and Design
