TY - GEN
T1 - Portioned EDF-based scheduling on multiprocessors
AU - Kato, Shinpei
AU - Yamasaki, Nobuyuki
PY - 2008
Y1 - 2008
N2 - This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. The design of EDDP is based on the portioned scheduling technique which classifies each task into a fixed task or a migratable task. A fixed task is scheduled on the dedicated processor without migrations. A migratable task is meanwhile permitted to migrate between the particular two processors. In order to curb the cost of task migrations, EDDP makes at most M - 1 migratable tasks on M processors. The scheduling analysis derives the condition for a given task set to be schedulable. It is also proven that no tasks ever miss deadlines, if the system utilization does not exceed 65%. Beyond the theoretical analysis, the effectiveness of EDDP is evaluated through simulation studies. Simulation results show that EDDP achieves high system utilization with a small number of preemptions, compared with the traditional EDF-based algorithms.
AB - This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. The design of EDDP is based on the portioned scheduling technique which classifies each task into a fixed task or a migratable task. A fixed task is scheduled on the dedicated processor without migrations. A migratable task is meanwhile permitted to migrate between the particular two processors. In order to curb the cost of task migrations, EDDP makes at most M - 1 migratable tasks on M processors. The scheduling analysis derives the condition for a given task set to be schedulable. It is also proven that no tasks ever miss deadlines, if the system utilization does not exceed 65%. Beyond the theoretical analysis, the effectiveness of EDDP is evaluated through simulation studies. Simulation results show that EDDP achieves high system utilization with a small number of preemptions, compared with the traditional EDF-based algorithms.
KW - Multiprocessor systems
KW - Real-time systems
KW - Scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=70349240602&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349240602&partnerID=8YFLogxK
U2 - 10.1145/1450058.1450078
DO - 10.1145/1450058.1450078
M3 - Conference contribution
AN - SCOPUS:70349240602
SN - 9781605584683
T3 - Proceedings of the 8th ACM International Conference on Embedded Software, EMSOFT'08
SP - 139
EP - 148
BT - Proceedings of the 8th ACM International Conference on Embedded Software, EMSOFT'08
PB - Association for Computing Machinery (ACM)
T2 - 8th ACM International Conference on Embedded Software, EMSOFT 2008
Y2 - 19 October 2008 through 24 October 2008
ER -