Abstract：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.
白露 晏立. 多处理器固定优先级算法的可调度性分析[J]. 计算机应用, 2012, 32(03): 603-605.
BAI Lu YAN Li. Analysis on schedulability of fixed-priority multiprocessor scheduling. Journal of Computer Applications, 2012, 32(03): 603-605.
LIU C, LAYLAND J W. Scheduling algorithms for multiprogramming in a hard-real-time environment [J]. Journal of the ACM, 1973,20(1): 46-61.
[2]
BAKER T P. Multiprocessor EDF and deadline monotonic schedulability analysis [C]// Proceedings of the 24th IEEE Real-Time Systems Symposium. Piscataway, NJ: IEEE Press, 2003:120-129.
[3]
BAKER T P. An analysis of fixed-priority schedulability on a multiprocessor [J]. Real-Time Systems, 2006,32(1/2):49-71.
[4]
BERTOGNA M. Real-time scheduling analysis for multiprocessor platforms [D]. Pisa: Scuola Superiore Sant'Anna, 2008.
[5]
BERTOGNA M, CIRINEI M, LIPARI G. Schedulability analysis of global scheduling algorithms on multiprocessor platforms [J]. IEEE Transactions on Parallel and Distributed Systems, 2009,20(4):553-566.
[6]
BARUAH S. Techniques for mutliprocessor global schedulability analysis [C]// Proceedings of the 28th IEEE International Real-Time Systems Symposium. Washington, DC: IEEE Computer Society, 2007:119-128.
[7]
BAKER T P, CIRINEI M. A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks [C]// Proceedings of the 27th IEEE International Real-Time Systems Symposium. Piscataway, NJ: IEEE Press, 2006:178-190.
[8]
CIRINEI M, BAKER T P. EDZL scheduling analysis[J]. Real-Time Systems, 2008,40(3): 264-289.
[9]
BARUAH S, GOOSSENS J. Deadline monotonic scheduling on uniform multiprocessors [C]// Principles of Distributed Systems. Berlin: Springer-Verlag, 2008: 89-104.
2012, Vol. 32 
