Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors

Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic real-time tasks on multi-core processors. Specifically, we focus on the partitioned (static binding) approach, which statically allocates each task to one processing core. We also assume fixed-priority preemptive scheduling on each core. The previously established 50% bound for partitioned multiprocessor scheduling is overcome by task-splitting (TS), which allows a task to be split across more than one core. We prove that a utilization bound of 60% per core can be achieved by the partitioned deadline-monotonic scheduling (PDMS) class of algorithms, when only the highest priority task on each processing core is allowed to be split (HPTS). A specific instance of PDMS HPTS, where tasks are allocated in the decreasing order of size PDMS HPTS DS, is shown to have a utilization bound of 65%. The PDMS HPTS DS algori...

• Type: Journal
• Year: 2009
• Where: ECRTS
• Authors: Karthik Lakshmanan, Ragunathan Rajkumar, John P. Lehoczky
• Keywords: ECRTS 2009, Embedded Systems, Multi-core Processors, PDMS HPTS, Processing Core