Abstract: The fair scheduling theory is an important scheduling theory for period tasks on multiprocessor systems. PFair scheduling, proposed by Baruah, is presently the only known optimal scheduling method for period real-time tasks on multiprocessor systems. PD² has been developed recently and is the most efficient. But in practice, the real-time tasks are made up of period and apordic taks. In this paper, based on the fair scheduling theory and algorithms, a fair scheduling algorithm based on the server is proposed for apordic and period tasks on real-time multiprocessor systems. Three scheduling ways for apordic tasks are presented. The worst-case response time for the soft apordic real-time task is also computed, with the computed expressions proved.

Key words: multiprocessor systems, PFair, apordic and period task, worse-case response time