Multiprocessor Scheduling for Distance-Constrained Task Systems

In this paper, we pay attention to the real-time multiprocessor scheduling for Distance-Constrained Tasks. By using Early-release-fair (ERfair) model, we propose two efficient algorithms to probe whether the distance constraints of every task can be guaranteed. Moreover, they gather the unfeasible tasks and inflate them with a reweighting function. The proposed algorithms are linear-time and increase significantly the ratio of schedulable task sets.