Real-time scheduling using regularity criteria and a geometrical approach
by Annie Choquet-Geniet, Gaelle Largeteau-Skapin
International Journal of Critical Computer-Based Systems (IJCCBS), Vol. 2, No. 3/4, 2011

Abstract: 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.

Online publication date: Wed, 11-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Critical Computer-Based Systems (IJCCBS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com