aboutsummaryrefslogtreecommitdiff
path: root/sem4/embedded/eksamnen/M7opg.adoc
blob: 7bb41c53db025eaf1fb4767f3ce7452f6c8cf4ec (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
== Opgaver til modul 7

=== Opgave 4

Given a taskset:T1=50,c1=20,d1=60,T2=80,c2=20,d2=50(mS)

. Does utilization guarantee feasibility of an RMA schedule ?
. Validate an RMA schedule with the exact schedulability criterion.
. What is the optimal fixed priority schedule ?
. Validate the optimal fixed priority schedule with the exact
schedulability criterion.

==== Løsning

____
_Does utilization guarantee feasibility of an RMA schedule?_
____

Ved at køre RMA fra 0 til 400, kan man se at der er schedulable.



Først regner jeg utilization ud.

----
U = 20/50 + 20/80 = 0.65
----

Derefter kan man regne utilization critereon ud.

----
\overline{U} = 2 * (2^(1/2) - 1) = 0.82
----

Her kan man garantere at RMA er schedulable.