| 摘要: |
| 实时多处理器系统的动态调度算法一直是实时系统研究中的重要课题,而评价实时调度算法性能的一个最重要的指标是调度成功率.在近视算法的基础上提出了一种新的实时多处理器系统的动态调度算法--节约算法.在该算法中,提出了一个新的处理器选择策略,从而提高了算法的调度成功率.同时,为了研究节约算法的有效性,对其进行了大量的模拟,分析了一些任务参数的变化对算法调度成功率的影响,并与近视算法的调度成功率进行了比较.模拟结果显示,节约算法的调度成功率要优于近视算法. |
| 关键词: 多处理器 实时系统 动态调度 调度成功率 回溯 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69896250;79931000) |
|
| Developing a New Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems |
|
QIAO Ying,WANG Hong-an,DAI Guo-zhong
|
| Abstract: |
| Dynamic scheduling algorithms for real-time multiprocessor systems are important components of real-time systems. The most important metric for real-time scheduling algorithms is scheduling success ratio. In this paper, based on the traditional myopic algorithm, a new dynamic scheduling algorithm, called‘hrift algorithm', is proposed for real-time multiprocessor systems. In this algorithm, a new processor selection policy is developed to improve scheduling success ratio. To study the effectiveness of thrift algorithm,an intensive simulation studyis made to analyze the impact of several task parameters on its scheduling success ratio and compare its performance to myopic algorithm.The simulation results show that the scheduling success ratio of our new scheduling algorthm is superior to thet of mypoic algorthm. |
| Key words: multiprocessor real-time systems dynamic scheduling scheduling success ratio backtracks |
