1 / 2

Problem 18: Cyclic SDF with (Independent) Stochastic Execution Times

A. F. 2. 1. E. 2. 1. 1. 4. M. G. B. C. D. 1. 2. 1. 2. 3. 1. 3. 1. 2. 2. Problem 18: Cyclic SDF with (Independent) Stochastic Execution Times. Channel labelled M has 1 initial token To remove scheduling issues from problem All tasks are mapped on private processors

ferdinand-curtis
Télécharger la présentation

Problem 18: Cyclic SDF with (Independent) Stochastic Execution Times

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. A F 2 1 E 2 1 1 4 M G B C D 1 2 1 2 3 1 3 1 2 2 Problem 18: Cyclic SDF with (Independent) Stochastic Execution Times • Channel labelled M has 1 initial token • To remove scheduling issues from problem • All tasks are mapped on private processors • All channels are mapped on private memories • No auto-concurrency (tasks can only fire after completing previous firing) • Capacity of memories are given on next slide • Execution times of tasks (see next slide) are independent of each other • Performance metrics • Throughput of F and G (number of firings per second) • Maximum and time-average occupancy of all memories • Time –variance in occupancy of memories for which capacity is not given

  2. Execution Times and Memory Capacities Capacity of all other memories is part of the problem

More Related