1 / 3

Real-Time Architectures 2003/2004

Real-Time Architectures 2003/2004. Construction of time lines for FPPS Reinder J. Bril. 29-04-2004. Worst-case response times. Simultaneous release of  i with all higher priority tasks at time a (critical instant).

pink
Download Presentation

Real-Time Architectures 2003/2004

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Reinder J. Bril, r.j.bril@tue.nl TU/e Informatica, System Architecture and Networking Real-Time Architectures2003/2004 Construction of time lines for FPPS Reinder J. Bril 29-04-2004

  2. Reinder J. Bril, r.j.bril@tue.nl TU/e Informatica, System Architecture and Networking Worst-case response times • Simultaneous release of i with all higher priority tasks at time a (critical instant). • Draw a time line with releases of the highest priority task 1 with a first release at time a. For every release, task 1 can start immediately upon every release and execute its worst-case computation time to completion. • Given the responses of tasks 1 till i–1, draw releases of task i with a first release at time a. For each release, the execution of task i fills the “gaps” left by the higher priority tasks till i has executed its worst-case computation time. The procedure is stopped when either the response time of task j with j < i exceeds its deadline Dj, in which case the set of tasks is not schedulable, or when icompletes. In the latter case, the worst-case response time WRi is found.

  3. Reinder J. Bril, r.j.bril@tue.nl TU/e Informatica, System Architecture and Networking Best-case response times • Simultaneous release of all higher priority tasks with a completion of i at time f (optimal instant). • Draw a time line with releases of the highest priority task 1 with a last release at time f – T1. For every release, task 1 can start immediately upon every release and execute its best-case computation time to completion. • Given the responses of tasks 1 till i–2, draw releases of task i–1with a last release at time f – Ti–1. For each release, the execution of task i–1 fills the “gaps” left by the higher priority tasks till i–1 has executed its best-case computation time. • The execution of task i fills the “gaps” left by the higher priority tasks from time fbackwards in time till i has executed its best-case computation time. The procedure is stopped when icompletes, in which case the best-case response time BRi is found.

More Related