Dec 6, 2002 - event handling in combination with appropriate real-time scheduling techniques. We .... This avoids calling a software scheduler after an IsT.
½ ¾ ¿ ¿ ¿ ½
!
¾ " # $%
!
¿ & #% '( #% ! )*
+ , % +- .+.
/ - +.% .
! " # $
%&'( ) * +, +- " ,. ,/ " 0 ((1 ( (# 1 122 1# 2 2 0 )'1 ) ' 10 32 3 2 0 4
0 0 0 0 0 *
! " ! #$ % &'( # ) $ $ ! * # +,-.- &/( 01 $#2-3/44 &5( 6 6- !7$1 0 0 &*( 01 806#9 &3( ! : $ &;( # ( 2 ! 0 &!0 (
! 0 &!0( &?( ! = !0 & /
( !0 ! ! $ &@A '4A ''( "
7 ,9,B 0 &'/( $0 &'5( ! ,9,B 0 6 = &'*( !0 &?( = &>( &'3( = &';( = ! !0 =
0 5 ! 0 &!0 ( !0 ! 0 &!0( # 0 ( 0 * = !0 0 3
!0 0 ; 5
% = ½ ( & ?( & @( # 66 # EE !- ! 0 ,+ 66 ! /4
3,00
2,50
Baseline Multithreading, without latency hiding Multithreading, with latency hiding
gain
2,00
1,50
1,00
0,50
0,00 FPP
EDF
GP
1 ; 7
LLF
*
EE H6 EE Æ 5 &
( ,+ 66 7 # H6 EE Æ '44 & EE ( 8 H6 EE & ? @( , 66 ,+ = ( & . #/ #
7 !0 !0
. !- EE ) . Gain due to latency utilization
3,5
3
2,5
2
1,5
1 0
10
20
30
40
50
60
70
80
90
100
Load/Store latencies
1 ++ 3 " 9 = * '4 & ' ( & 5 = ( 8 # .
. ''
& ( "
. J . //
-
,
# *3N3* K'5L # $ ; K//L 8 7 - = 2 2 = $ 6
8 # $ # " 0 $ D #0 /444 ; !,,, # 0 < 6 3N''?3 K54L E 0 + + 8 H $ 0 , ! - $ 8 &'@@/( K5'L 2 # 0 $ 0 = H 7 + 0 0D ,+ # = # 6 + B '@@? K5/L # 6 H # H 6 0 # - ! 0 B D 0 B - !,,,.#-$ B ' &5( &'@@5( 5**N53> K55L # 6 H # H 6 0 # - ! 0 B D $ B - !,,,.#-$ B / &/( &'@@*( '5>N'34 K5*L $ 0 H 7 0 # + 6 0 0 '4 &/( &'@@;( '>@N/'4 K53L - # !,,, 0 0