P_FENP: A Multiprocessor Real-Time Scheduling Algorithm

Abstract

This paper addresses the problem of real-time scheduling on multiprocessor systems for periodic tasks when scheduling jitter is not allowed. A partitioned real-time scheduling method based on a table-driven uniprocessor algorithm called fixed execution non-preemptive (FENP) is proposed as a solution for this problem. An analysis of the new proposed algorithm is provided in terms of scheduling jitter and schedulability ratio, by comparison against other popular partitioned real-time scheduling algorithms.