Analysis on schedulability of fixed-priority multiprocessor scheduling
Yan Li · Journal of Computer Applications · 2012
Concerning the Fixed-Priority(FP) algorithm of multiprocessor real-time scheduling,an improved schedulability test was proposed.This paper applied Baruah's window analytical framework of Earliest Deadline First(EDF) to FP,bounded the max number of higher priority tasks doing carry-in by m-1(with m being the number of processors),and thus got a new upper bound of interference a task suffered.Then,a tighter sufficient condition to determine schedulability was derived.The simulation results show the schedulability test is more efficient by increasing the number of detected schedulable task sets.