Size analysis in multiprocessor real-time scheduling
by Annie Choquet-Geniet; Gaëlle Largeteau-Skapin
International Journal of Critical Computer-Based Systems (IJCCBS), Vol. 5, No. 3/4, 2014

Abstract: If timeliness is a strong requirement for real-time applications, the reduction of weight and of the energy consumption are also important concerns. Besides, the actual trend is towards multiprocessor platforms. Thus we are interested in the determination of the lowest number of processors for a real-time system. For that aim, we use a model-driven approach, based on a geometrical modelling, and the matrix calculus in the dioid (N; max; min). Then, we discuss the size of the schedule that must be computed for a full temporal validation of the system.

Online publication date: Tue, 21-Oct-2014

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