Using Discrete Geometry to model PFair scheduling algorithm for Real-Time systems applications

Abstract

In this paper, we focus on the use of discrete geometry for the sake of real-time modeling and analysis. We consider multiprocessor context, and we determine the geometrical characterization of PFair scheduling algorithms, which are known to be very performant strategies. A feasability test can then be deduced from the geometrical properties