Rtos Concepts 4c3p6j

|

@ | — || | @ | O —



—



| — |

! "# ! $ — u % & ' " $

— ( u % )'

GPOS

RTOS

! | | |

Time

No time bound processing, task time bound processing, task has to has not got any time limit to complete work within given time finish work. frame. Deterministic behavior

Memory Full virtual memory Architecture /Monolithic architecture

Flat memory architecture

Size/latency

GPOS are non scalable and has RTOS are scalable and has smaller larger footprint and higher footprint and low context switch context switch latency. latency and interrupt latency.

Scheduling

round robin way of scheduling. priority preemptive scheduling preemption is a must feature

Memory

Tight memory constraints are not considered. it is not lightweight.

should not take up too much memory since embedded systems come with tight memory constraints

priority

Priority consideration for each Each task must have a priority task is not as strict as RTOS

| — " " — * + "

u | — — — — — — —

, ' ) | ,

u

u

@ |

@ |

| | — , u

— | # , ' - | & .( ".@

' | — / ' "



' | — | 0 " "

















' | — 1 1 @ /" |

' | — | /

- , "

& | — — — — — — — — —

& - " |,

" ," 1 ) / " $ |

| — 0 | ,



— | | /

— ( | (

u — $ $ * 23 455+ — 0 $ $ *

65

$+ * 755 $+

| — 8 — 9 % — " : $ — ` `` ` ` `` ` — `` ` ` `` `` `` `` ` ` —

—

0 | — ) * + — 99 — )

"

— ( — —

$ $|9 ;(<u'=@|>$$$$

|'

º º —







$

$

º `

| — "$ — . "

$

| — "$u "



$ r !

r — ," ')1' ) 1 ""$

"

m — " "#$ — " " $ — ```` ` ` º ` `` `

/ — "



|





|







|



|



|



m — — "





%! — u " $ " " $

— ‰ — " " @ " `

) ) — ) " " ')1 "$ — u : — 9 &' ( " $ — 9 & ( *+$

— A" — 4 A4 " " A4" — 6 A A — 4 " 6

) u — A " O $ — 4 A$ 4 "O$BO " A 4" $ — 6 $ 6 A

6 A A $ — "4 " A $0 " "6 $

— ‰ — " " @ " `

)

)

— ) $



— 1 " " "- -

- $ — @ " $ $-

$ — 1

-

"$

)

) % / "

— 6C4$ $6

‰ — "4 |4 "6 |6 — 4 |6 6 |4 " $ " $ " ": — — — $

/ " — " " | $ — / " @ $

, —

$ — "

$ — *"+ $

, — = $ — D $ — " - $ E "



, — — u — / 0 |

— / ,



— "

— |

, — —

—



r | — " 3')1 ` ` ` ` `` ` ` $ — º ` `` — ` ! `

º m — @ " " "

"@!)"#$ *

"@ % !" "@ — "@ $ !

º

`

º

ÿ — " "

" ')1@ "$ " $ — ` " " $ — " " ')1 — $







``

—

! — , " $u " $ " $ " ')1

" $@ " ')1 " $ — " : —

Ñ ÿ — ( " " ')1$ — ( — "#$



º ` " " , $ - "

`



| | |



| | — @ " " " " : —

" @ "

—

" $

` `

Ñ ÿ — — | — | " " |

"$ " ')1

" ')1$

" —

— $ — u " ')1 @ " $ — O +, ! ! !



" " — — " —



" ')1 $

ÿ — "

— "

')1$ — |" " |

" "

$ — @ " "

| —

- —



$ | — $ $')1 " $



`! `"```! " "

@ $

( |

— " `!` ` #` ` "

`! #!` ` ` | ` " |&6F6 " G'. " "&6FA$ " `` ` ` `

`` ` ` ` ` — &6FH " ! ` `` ` — &6F7$( ``` $@ ` ` ` ` ` — `



m — | r O )|rO*



" $ " $

|," — 4$" $ — 6$" - $ — A$ ')1 " $ $

| ,



—

— ! " —



) "

|, — # " # $ — % # & # %

— ' " & ( $

VVV VVV V



|, m | Bound) ny set o n periodic tasks is | -schedulable i the processor utilization, U, is no greater U 1n than n 2 1 . This means that henever U is at or belo the given utilization bound, a schedule can be constructed ith | . In the limit hen the number o tasks n ù , the maximum utilization limit is

U 1n limn 2 1 ù ln2 0.69 na

|,u — )#$ — &$ *& + ,- & + &-- .& + ,-/&-- + -, — ,$ *, + 0- , + &1- ., + 0-/&1- + -,23 — 4$ *4 + &-- 4 + 41- .4 + &--/41- + -,52 — . % $ +-314

/



— 6 " —



|" — " $ — " ++ ++

u ) " — * #



! 7 — 8 ! ,- 1 7 — ! &- 7 ,1

u ) "

u ) "

u "

u "

r!

— : — /

— — / — 1

"

— " - | "

— " . $ — @ . | " " $ —



— @ " " "$ — " " " " - $

`

! # — u " -

$ — " -

$ . / ) |* — - -

$ . / ) -01*

˜ º

— — — — — —

, ) & ,



`º

˜ —

')1

$@



- ')1 $ $ D +

O | +O|



— | u

—

| |

,

— | | |

| "









/ —









| — |







—



) —







— "



' —



| ' — u







—

@ ) )< @$

˜ - — "

$ —



— $





— ` ` — ! — ` `` |

˜ |

—





$



$ — @ ')1

" $

˜ |

— — ! — ` º "`

` ` — & " | @ $ —

" — — ! — ` º "`

` ` — & " " $ " | " " "

$

` ` — — — — —

! ` º "` ! |

˜ | —





$

— ` º "` — ! — `

— `` — ! — ` º "` ` ` — ! — `

˜ - |

|

` ` !

Ñ r ˜ Ñr˜ — ˜ Ñr˜ `` ! ` |

— ˜

Ñr˜ ! ` º "`

— ˜ Ñr˜ ` º "` ! `

$ $

| "$

— — — — — —

|, "

"

‰ ` ! %` ! | ! !```!&! | `

— — — — — — — —

" "



%` `` ` ! %` ! | ! !``` ! &! | `

|, "@"

— — — — — —





| $ $

"



— | |, "@ "$

— " |, |, — |, - " — |, " $

‰ |mÿ — |" — — @ | " $ —

35I| $ ) 34F A6 $ — / :

|m

@

`|

@ |

@ |

º `



| º

º

m º

` ' `

| ( `

| ( @ ` `