By Topic

Estimating task response time with contentions for real-time distributed 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

2 Author(s)
Chu, W.W. ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; Chi-Man Sit

Response time is affected by interprocessor communications, precedence relationships among the modules, module assignments, and processor scheduling policies. Furthermore, due to sharing of resources and data among the processors, contention delays are incurred. A task response time model that considers all these factors is proposed. A Petri net is used to represent resource contention, and the task control flow graph represents module precedence and logical relationships. A queuing network with resource contention is used to estimate the response time of each module. Module response time consists of delays at the processors and resource queues and is estimated by approximating the extended queuing network as independent finite capacity queuing systems. The module response time is mapped onto a control flow graph, and task response time is obtained by aggregating the module response times in accordance with their precedence relationship in the control flow graph. The task response time derived from the analytical model compares well with that from the simulation

Published in:

Real-Time Systems Symposium, 1988., Proceedings.

Date of Conference:

6-8 Dec 1988