Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Queueing analysis in dynamic 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
$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

2 Author(s)
Ge-Ming Chiu ; Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA ; Raghavendra, C.S.

The effect of queueing on a dynamic distributed real-time system, in which jobs have hard deadline requirements, is studied. A job can be guaranteed to be completed before its deadline expires; it is rejected otherwise. An analytic model is presented to calculate the probability that an arbitrary arriving job will be guaranteed. An embedded Markov chain is first established, followed by a probability analysis. In the model, only one copy of the resource is considered. If more than one copy exists in the distributed real-time system, the scheduling discipline for incoming jobs among these copies will affect the probability that a job can be guaranteed. It is shown that a round-robin scheduling, in which arriving jobs are assigned to all the copies of the resource in a cyclic order, is the best strategy. In this strategy, a job that cannot be guaranteed by its assigned copy can never be guaranteed by other copies either. However, it requires a centralized controller to assign the load. The performance issue for cases with multiple copies of a resource is noted with respect to various strategies. The model is nevertheless useful for further research where multiple copies will be taken into account or for the design of a real-time system where jobs with a hard deadline requirement arrive to the system dynamically and nonperiodically

Published in:

Real Time, 1989. Proceedings., Euromicro Workshop on

Date of Conference:

14-16 Jun 1989