By Topic

Guaranteeing application-to-application deadlines in distributed real-time systems

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
$33 $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)
Fang Feng ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA ; S. Kamat ; Wei Zhao

We address the issue of guaranteeing application-to-application deadlines of messages in distributed real-time systems. Most of the previous studies have focused on either host subsystem or network subsystem. Our study considers the entire integrated system. We develop two methods to test whether the message deadlines are met. The first method called the independent method, obtains conservative estimates of message delays by independently analyzing each subsystem. This method is easy to use and efficient, but may sometimes give pessimistic results. The second method called the integrated method, computes the delays more accurately by modeling interactions among the subsystems in greater detail. Performance of the two methods is evaluated an terms of the probability of guaranteeing message sets for given host utilization

Published in:

Local Computer Networks, 1995., Proceedings. 20th Conference on

Date of Conference:

16-19 Oct 1995