A New Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
Real-time systems require both functionally correct executions and results that are produced in time. Thus, the scheduling algorithm is an important component of these systems. Several dynamic scheduling algorithms for real-time multiprocessor systems using heuristic approaches such as famous myopic algorithm and its variations have been proposed. However, the task assignment policies used by all these scheduling algorithms hinder the improvement of the scheduling success ratio. In this paper, we propose a new dynamic scheduling algorithm, called “thrift algorithm”, for real-time multiprocessor systems. By using a new task assignment policy in this algorithm, thrift algorithm improves the scheduling success ratio successfully. To study the effectiveness of thrift algorithm, we have conducted extensive simulation studies and compared its scheduling success ratio with that of myopic algorithm when several task parameters are changed. Simulation results demonstrate that the scheduling success ratio of thrift algorithm is superior to that of myopic algorithm.
Key WordsMultiprocessor real-time systems dynamic scheduling scheduling success ratio backtracks
- Manimaran, G., and Murthy, C. S. R. (1998). “An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-time Systems”. IEEE Transaction on Parallel and Distributed Systems 19(3), 312–319.Google Scholar
- Mittal, A., Manimaran, G., and Murthy, C. S. R. (1998). “Integrated Dynamic Scheduling of Hard and QoS Degradable Real-time Tasks in Multiprocessor Systems”. 5` International Conference on Real-time Computing Systems and Applications, Hiroshima, Japan.Google Scholar