• Keine Ergebnisse gefunden

Building Blocks

N/A
N/A
Protected

Academic year: 2022

Aktie "Building Blocks"

Copied!
10
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

! "

!" #

! " #

! #

#

! #

$

" % #

& ! !#

'

#

! "#$

£

!"# $ %& '

"%&%#$

'

(

(

)

* + (

,

)

-

. /

0

* +

(2)

"% 2 3 4 5 %6 %3$ 0

"3 4 %6 %3$

! "% 2 5$

'

0

7 2

898

7 #% #3

-

7 #4

.:;/

0 7

&

%

898

Building Blocks

Consistency of Specification Across Building Blocks Building Blocks Specification and Verification

LEVEL Synergistic Formulation of Dependable Distributed Operations

Protocol Verification Protocol Validation

Primitives gence Functions Voting/Conver- Communication

Theories of Time

& Failure Models System Models

%, ! <

0 !

'

,

=

0

7 22 0

!

0

"&>%%$

0 ?

"&%%$

Æ ( )*#( (("

('("(('("#(

(+,(&

Æ (# -# *

#( (( ".(/ '( ) ("

0 +( .' #'(# (''% "'((+

(.,,(#( ('% +&

Æ (# -# +' (+

/"+ (# -#

(# -# +( ,+ " '

( ) " ,+ " ' ( )

" ' ( #+ ,& 1% +(

(#'' +)"0 +" ('+

"&

<

.7 2/

R A

B P g

f

P’

k h

k’

h’

u

2, @

,

,

, ,

!" . / Æ A

Æ Æ

(3)

¼

Æ A

¼

Æ

,

¼

Æ A

¼

Æ A

¼

(

(

7

=

=

!

-

#

)(

½

)

¾

. /

, Æ

½ A

¾

Æ

.

½

¾

½

½¾

/

½¾

½

¾

½

R A

B P

R A

B P t s

P 1,2 Module 2

Module 1

1

1 1

1

2 2

2 2

g f

h

k

h f

g

k

1

1 1 1

2

2 2

2

#, B

C

C &

)

½

(

)

C

D

0

:; 7 #4

R R

R A

B P R A

B P

B a B b

a b

P 1,2

Module 2

Module 1

1

1 1

1

2 2

2 2

s r

r

b b

1

2

1 2

t

&, B

0

0

%

#

0

0

0

*+

#'((+

½

½

2#' #,0((#'( +3

(#'(4( 3(#'(+,((.,,&

(4)

,(#(5' (#( (("'

+ 6("( )( )# % )

+(()%, 6&

Æ % #(( '( ,#, #,#6

. ' 6.

" "7. '(#,3 +&

' (",,,,

¼

8  ½

¼

¼

8

.'(9(,#,#,#6 +,3 +&

Æ '#,#6("###(((+ #(3

) "# ( " ,3 + ' (, " 3

#((( #,#6( ( - )' ( ' ( #,#6

)( , :%,( &&

½

¾

½

¾&

$

!

#

!

. /

# !

*

% &

<

'(& $

;

.1;/

(

. 2#/ "7 7 #%$

) % #! *

!

E

F

+ % ' *

!

C !

./

)

, % '

F

0

.

"%& %#$ /

=

)

'

=

,

7

. / ./

=

B

1

./,

(5)

? "G%2$

) '(&

$

!!+!

; )<%)##

,, ("+ #, (3

) #, (&+(,( 8 8

"1 => 3( , ((+( (# %,

.' ('+0 +++"", (&

,, ( '% +("+ ' (+##,&

'"' (4#+((( &

;#(( ) ++( ,(('' #+ )

+(()&

) #"

;

C D

( F

#' >

' 3", #,#6( ,, (#' >

(+#(4 &

'3",#,#6(', "."+ ,3

+)'&

' ..3(#' > ( ),(

'). ' .' #''(( ),(##+(( ("

-(&

' (%,.(#' > (&

3",#((#' :#.

(.#,#6'"'3",#((

. '+((+,,&

)) )

! (

E

+ #=#(

'.6+ ( ##%" ,(

#+(#(((, 6(&

'#,#6("###(((0 +,(3

#' >. ' +0 ++,,.,% &

(+ (( #(( ) ,( " +(()(

#(&

:

0#=> )+

,(8 # (+( '& ('

+"",#(((&

#' # (+(###''3

# (')',(8 (? #++ #3

'(&

,(8(" #++ # +) 3

# (+(6,#&

,, # (+((#' >. ' 6.

(6."#''&

), , " !

B

=

'#6 )

' ((+ #( (( " +, , #((( '(

#(((#++ #0#') )+(()(&

++ # " ,( '.6&

("#'#6 (" :#((("+#3

( (((+(&

'(# (0#,#'#6 "#'3

#((&

!

)/ $01 % !

!

"G %2$

0

(6)

$ 0 $01 "

C D

D

(

!

./

0

:;

@

,, #((( 0# ' (+ .6, 3

+ '%,( )% )"# &

' ""+#'%('

"+,,'( #, ) (.

)(&

') )"%"+#'#(

+(() ) ) #' '

((+&

$# ""#'%(

#,,# %,)(',#"#'

'(&

2# ' ( 0# )+ ( #' ' ,

#"##( (#+'(# 3

-0#,( '(',&

@"' , #0#(' '(',#'

'%('0#,( "##("+'

) ( #,,# %, => )+

)(' (# ( &

@" 0#, ( 0' ## '% (

,.#( ,,'

"# ,()'(%,(&

@" ' . # " 0#, ",,( ,.

-3+ (( '(',' ( #,(

' # ) ( ( #,,# %, =>

)+),,'"# ,(&

0

:;

" "

=

0

,

!+,!

./

./

. /

./ ( ./

- ./

./

, . .

/

/! .

.B!//

./ =

./

= =

,0!

" 1

) 3

:;

Building Blocks

Building Blocks Specification and Verification

Consistency of Specification Across Building Blocks Protocol Composition from Building Blocks

Protocol Verification & Validation Voting/

Detection Checkpointing

LEVEL

Agreement Broadcast Synchronization

3, B :;@

!

F (

(7)

:; .7 4/

A B : A influences B.

Agreement Synchronization

Voting/

Convergence Broadcast

Atomic

FDIR

Checkpointing

Error Detection Routines

4, E E

7 F 4

0

.E /

% H F

4

!

% F

:;

8 =

F

I

!

)

.

/

. /

1 1

0 C

:; '

"G$

=,#6(@# ( (< (

; )<%@ *8 (

; )<%# (

; )<%)+ % )##,

% ) + %,

#&=#( ,,(#' >#,#6(

#@ "

#'6) #,#63 )

#)+ 8#(((

)+@ 8 # (

8 (? '(

8("#++ #

(#'(((++,

&=#(@ (#'(((++,

&=#('6) ,(

(#' >#,#6(

'6)@ 3 .6

#3 #'#6 (

%, E;

¾

!

!

C

H

7

C

B

.7

G/

m X

Y

time T

T

β

G, B , @

¾

' ( %"( )+(() #((

(## ) (#'#6 .'(#( )# %%

'#(( ##("'#'#6 "'

(# '(ABC&

(8)

)

7

. J/

J

-

0

. /

0 ! 2 &

!

7 2%

:;

H

5

-Initially sync. clocks -Bounded drift rate -Bounded clock reading

System configuration

-Bounded max. skew -Bounded correction

Clock Synchronization

-Synchronous model -Bounded comm.

-Synchronized clocks

-Atomicity

CLK_SYN

AT_BCAST k

Atomic Broadcast

Time theory

System model Failure theory

-Order -Termination

m

5, B

1

0

¿

¿

#, ((.'%(3

#,(0"(# -# ,))&

:;

0

!

"#

$% & '()*

++ , $%-

++ $%)

++ " $%'

++ $%.

++ / $%0

++ # $%1

2 3%

++ " 4 , 533-

++ " 533)

"

!

"#

$% & '('*

++ $%-

++ , $%)

++ " $%'

2 3%

++ 533-

++ 533)

++ 533'

1

!

1

1

B

!

, % 2

7@DB%

7@DB2 *

+

.;

/

(9)

.77 #2

##/ 7

E

"

7 22 #2

"""

"""

.; &/ !

#

"""

"0 7

.; 7 ###&/ !

:;

62

"

# " #

"#

/ "# "

$% & '(-+'(0*

++ $%-

++ " $%)

++ " $%'

++ " $%.

++ # 7 # +/, $%0

++ # # $%1

++ / $%8

"

++ /#

++

++ ,

++

++

! 62 ++ " /

++ # 533-

++ # 7 4 533)

++ # 7 533'

++ # # 533.

0

:;

$ 62 +9 $#

++ "

++

++

26& -

)* +9 :$& / / *

34& * +9 :$&

//*

& * +9 :$&

/// *

; 62 +9 <#

++ "

/# +9 / #

/ +9

/ +9

++

++

23& / * +9

=<&// *

: 62 +9

++ "

/# +9

2 $# +9 <#

++ "

++

++

:$& //* +9

=<&// *

- 3 ! 3!" &

!

H

=

F

:;

7

7

F

F #

(10)

1

.B!/

. :; /

=E #

"""

! "

L L

0

C

0

7

. /

'

C

#

AC &,,&D12E/1, 1,'#63

)&F &GHGG )3;,)&

AC & & I,6 D+ =( ( ) "

1, ,#F

%,&J&&HB&

AC &1& ,6 K&1& L ) ,& D+, 1'(/

" ' # (&F

!"%,&&J&HJ#&&

AJC E&' )=&1'# $%

& % %,&

)3%,)7&

AGC =&! & ! D,0 , #,+3

( =F(&)&H&

AC 1&& E , && #', #' ) D #'

(# ) 1, ,3, #,(&F

*(&&7GHJ2#&&

ABC &K,# ($ "& 3

#E,,J&

AC M& N ,& D= , ) , , E )'3 "+#

++ # (+("++(&F+

"*!JG&7H#&&

AC &1 #',;&L ,(D+.6"1,+,

# -# ; -# &F,#-.B&

A7C &1 (,&D(,/ ++ # (

",3, ( )+(&F($

"&BH7&

AC &&' &1& =(,,

"'" #E,,&

AC 1& )',&!&' % !+

"&1#!.3E ,,J&

AC & '& D@ -# "((($( )

+,#'&F#.&JH&

AJC & & 'D2 '$( " +,#' 4(

";, &F#)&7H&

AGC &%((I&= +&1: (DE(/ ,03

, ! ++ # (+&F

'J&BH ,&

AC &L, &N #,& D+,,; -23

N )( (&F

&JHB%&B&

Referenzen

ÄHNLICHE DOKUMENTE

Ze- lazko in the 1960’s and provide non-trivial examples of TAs whose underlying space is not necessarily locally convex (so they are neither necessarily lc alge- bras nor lmc

NL NL : NL NL -complete dirGraph, 2unSAT, nonBipartite. NL

We consider the constraint satisfaction problem (CSP) parameterized by the tree- width of primal, dual, and incidence graphs, combined with several other basic parameters such as

— a slight majority — exhibit consistent loss-averse behavior, though this varies across consumers and consumption categories. Second, mental accounting behavior is substan-

Complete the implementation of a vector clock specified in the file Server.java and extend the server so that the predefined method log() also outputs the current vector time for

(1993) (hereafter KMR) show that, if the bilateral game is a 2 × 2 coordination game, and the dynamics is such that strategies leading to the highest payoffs spread, then

Its main advantages over the traditional approach based on perfect rationality are that: (1) under given state the strategy space is a chain- complete partially ordered set; (2)

When the interest rate rule is a function of future in fl ation rates, equilibrium remains indeterminate if the policy is pas- sive; on the other hand, if the policy is