Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
