Developing a New Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

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 study is 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 algorithm is superior to that of myopic algorithm.