Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
On-Line Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Desynchronized Pfair Scheduling on Multiprocessors
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Discrete geometry applied in hard real-time systems validation
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Integrating PFairness within a model based scheduling tool
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Hi-index | 0.01 |
In this paper, we focus on the use of discrete geometry for the sake of real-time modelling and analysis. We consider multiprocessor context and task sets with offsets, constrained deadlines and critical resources. We want to take regularity criteria into account during the scheduling process. We, thus, determine the geometrical characterisation of PFair schedules and present the construction steps of a geometric PFair model. Several uses of this model are then presented: we can select (partially) PFair schedules. We have also defined a PFairness comparison criterion and we use it to choose among a set of feasible schedules the most PFair ones.