Cart (Loading....) | Create Account
Close category search window
 

On-line scheduling of real-time distributed computers with complex communication constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Richard, P. ; Lab. of Appl. Comput. Sci., Nat. Sch. of Eng. in Mech. & Aeronaut., Futuroscope, France ; Cottet, F. ; Richard, M.

We consider the scheduling of periodic tasks running on distributed computers. Every execution of a task must meet its deadline. Response time analysis of the tasks is used to prove the schedulability of hard real-time distributed systems according to the on-line priority rules that schedule the processors and the network. Its main advantage is to take into account the precedence dependencies of the schedules of the tasks on the processors and the messages sent on the network(s). Past works have addressed the issue of tasks related by asynchronous communication constraints with the senders and the receivers working at the same rate. We study more general relations among tasks when the rates of dependent tasks are not equal. We call such relations generalized communication constraints. Usually distributed systems are scheduled using a synchronization protocol and an on-line scheduling algorithm by processor. We present a graph theoretical approach to this schedulability analysis. Our algorithm transforms complex communication relations into classical ones, so that the classical scheduling analysis can be fully applied. That transformation is independent of the architecture of the distributed systems and no assumption is made on the synchronization protocol considered

Published in:

Engineering of Complex Computer Systems, 2001. Proceedings. Seventh IEEE International Conference on

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.