Proportionate (m,k)-firm Scheduling for Multiprocessor Systems

Abstract

This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.