ЛОГИКО-АЛГЕБРАИЧЕСКИЕ МОДЕЛИ И МЕТОДЫ В ПРОЕКТИРОВАНИИ ФУНКЦИОНАЛЬНОЙ АРХИТЕКТУРЫ РАСПРЕДЕЛЕННЫХ СИСТЕМ ХРАНЕНИЯ И ОБРАБОТКИ ДАННЫХ

  • View
    215

  • Download
    3

Embed Size (px)

Transcript

  • 2 (22), 2012 . ,

    3

    ,

    681.324

    . . , . .

    -

    . - . . -- , - . : , , - , - , - , . Abstract. The authors suggest a method of software modeling and architectural de-sign for data storage and processing systems and networks. The method is based on a formal description of discrete processes on the structured-term memory. The re-searchers propose logic-algebraic behavioral models of distributed storage and data processing systems to be used as directly executable specifications. Key words: data storage, data processing, formal representations of distributed pro-cesses, logical-algebraic approach, networks of abstract machines, distributed be-havioral models.

    , , -- . -- .

    , - , -, . , , . - , , -- , , -

  • .

    4

    . () ().

    [1, 2], , - [3]. - .

    [47] () . , [813]. , , , , ; - , [11].

    -, ; . .

    , - , - - . - . software ( -), firmware ( ) hardware ( ) vmware ( , vm virtual machine).

    - , - , , - , [1416].

    . , , - . , , .

    -, I S - [17]; I - I(), .. -

  • 2 (22), 2012 . ,

    5

    I: S. - ( , , n- (i1, i2, , in, j), n- (i1, i2, , in), i1, i2, , in, j () , ), S .

    , - , - . - - -, - -.

    - . , , - , , . - , , .

    - [4, 5] - ( ), , , - I, - I(i) sj; i , sj S. - . , I(i) - I(j), i j , j > i.

    - .

    1 2 1

    1 2 1

    , , ..., ,( , , ..., )

    k k

    k k

    t t t ts t t t t

    +

    +,

    1 2, , ..., kt t t ; s - . , s , 1kt + , s , 1kt + .

    (FS-) , , -. - .

    t1, t2, , tn - 1, 2, , n x1, x2, , xn, , , n- P.

    R1 = P(x1, x2, , xn) false

  • .

    6

    < x1, x2, , xn > , - P P. , - < x1, x2, , xn > P, P .

    R2 = P(x1, x2, , xn) true

    < x1, x2, , xn > P. P, .

    . , , P xi xj -

    < x1, x2, , xi, , xj, , xn >

    xi xj. - P:

    R3 = P(x1, x2, , xi, , xj, , xn) false,

    R4 = P(x1, x2, , xi, , xj, , xn) true. , , .

    ,

    F(x1, x2, , xn) = xn+1,

    F n- ,

    < x1, x2, , xn, xn+1 >

    PF . xn+1 xn+1

    () (n + 1)- PF:

    R5 = PF(x1, x2, , xn, xn+1) false,

    R6 = PF(x1, x2, , xn, xn+1) true, :

    F(x1, x2, , xn) xn+1. , , , -

    () . . [12, 13] (). -, , .

    - , , [810].

  • 2 (22), 2012 . ,

    7

    (-) - . - . , , .

    ;, , :, ||, |c , , .

    ; , .

    , : - .

    : .

    || - ; ;, ,, :.

    |c -, , ; , ||.

    [18, 19]. , , ,, : , ; .

    , , - , - , :

    {m1 , m2 , m3}, {m1 ; m2} , {(m1 ; m2) , m3}, {(m1 : m2) ; m3}.

    , , -. - () - , , ; , . , - . - - - - . [810], . -- [](m1m2) = true m1, = false - m2. - []{m} m - , = false, = true - ( ).

  • .

    8

    m1, m2 m - , , :

    m6 = []({m1 , m2 , m3} {(m3 ; m4) , m5}),

    m7 = [1](([2]{[3](m1 m2)}) ([4](m3 m4))).

    . RE - E , . RN N. - (-) :

    m = [](L RE),

    L . -

    , , []{L}. ( -

    ) - , - - , (.. ), , . -, -. -- .

    , - , . ( - ) - . - , - , , , . - - (, , , , - ) [11]. , , -, , , - .

    , .

  • 2 (22), 2012 . ,

    9

    - , - .

    ! ,

    !! , !!, . , - . , - , - , .

    ! , - , . - !! , . , - . !! , . , , .

    - , , , - . . , , .

    - , - . 1.

    , , C, - D c U. - . K1 K2,

  • .

    10

    , , - . K2 - .

    [13]; - , -, , , , - . - , -, -, .

    . 1.

    Z ( ), C

    , D , - . zi Z, i = 1, 2; cj C, j = 1, 2, 3, 4; dk D, k = 1, 2, , 16. - - 2 3 = 6 ( ):

    m1(i) =[pClient(zi)]([( ! c)pServer(c)]([( ! d)pDisk(d)]({pClient(zi) false,

    pCom(zi, c, d) true, pServer(c) false, pDisk(d) false,

  • 2 (22), 2012 . ,

    11

    pDelay(zi) true} RE) RE) RE);

    m2(i) = [pDelay(zi)]({mWork(zi), pDelay(zi) false, pEnd(zi) true} RE);

    m3(i) = [pEnd(zi) & !( , , ) ( , , )i Comz c d p z c d ]({pCom(zi, c, d) false,

    pServer(c) true, pDisk(d) true, pEnd(zi) false, pClient(zi) true} RE),

    pClient, pServer, pDisk , -, ( ) ; pDelay , m1(i) m2(i); pCom , , - Work; mWork(zi) , , - Work zi; pEnd , m2(i) m3(i); d , C D. U , , . q3 , q ( ).

    . 2 , - . - L ( - , - ). z1, z2, c1, , c4, d1, , d16 () . - .

    m )1(1m )1(2 m

    )1(

    3 m )2(1 m )2(2m )2(3

    z1 z2

    c1c2 c3 c4 d1 d 2

    d16

    )(zpClient)(zpDelay)(zpServer )(dpDisk ),,( dczpCom

    )(zpEnd

    . 2. . 3 , -

    L.

  • .

    12

    )(zpClientzz1z2

    )(cp Servercc1c2c3c4

    ),,( dczpComz c dz1z2

    c2c3

    d 3d 16

    )(dpDiskdd1d 2d 3

    d 15d 16

    )(zpDelayzz1z2

    )(zpEndzz1z2

    . 3. ,

    ,

    , , , - , , . ( ) .

    , - ! pCom, 2 4 16 3 = 384 ( i = 1, 2; j = 1, 2, 3, 4; k = 1, 2, , 16):

    m1(i, j, k) = [pClient(zi) & pServer(cj) & pDisk(dk)]({pClient(zi) false,

    pServer(cj) false, pDisk(dk) false, pDelay(zi, cj, dk) true} RE);

    m2(i, j, k) = [pDelay(zi, cj, dk)]({mWork(zi, cj, dk), pDelay(zi, cj, dk) false,

    pEnd(zi, cj, dk) true} RE);

    m3(i, j, k) = [pEnd(zi, cj, dk)]({pServer(cj) true, pDisk(dk) true,

    pEnd(zi, cj, dk) false, pClient(zi) true} RE).

    - : ( , , )1

    i j km

    , ( , , )3i j km . ( , , )2

    i j km Work - mWork. - ( ) , .. - .

  • 2 (22), 2012 . ,

    13

    i = 1, 2, , q; j = 1, 2, , m; k = 1, 2, , n, - ! pCom q m n 3 . , q = 2, m = 8, n = 16 768 , q = 2, m = 8, n = 64 3072 . pCom - ! .

    - - !!. , . , , . :

    m1(i) = [pClient(zi)]([( !!c)pServer(c)]([( !!d)pDisk(d)]({pClient(zi) false,

    pCom(zi, c, d) true, pServer(c) false, pDisk(d) false,

    pDelay(zi) true} RE) RE) RE);

    m2(i) = [pDelay(zi)]({mWork(zi), pDelay(zi) false, pEnd(zi) true} RE);

    ( ) ( ) ( ) ( )( )3 [ & !! , , , , ]({ , , false, i End i i Com Com im p z z c d p z c d p z c d=

    ( ) ( ) ( ) ( )true, true, false, true} ).EServer Disk End i Client ip c p d p z p z R q 3

    .

    : , , , !! .

    , - !! pCom, :

    m1(i) =[pClient(zi)]([pServer(c1) & pServer(c2) & pServer(c3) & pServer(c4)]

    ([pDisk(d1) & pDisk(d2) & & pDisk(d16)]({pClient(zi) false,

    pServer(c1) false, pServer(c2) false, pServer(c3) false, pServer(c4) false,

    pDisk(d1) false, pDisk(d2) false, , pDisk(d16) false, pDelay(zi) true}

    RE) RE) RE);

    m2(i) = [pDelay(zi)]({mWork(zi), pDelay(zi) false, pEnd(zi) true} RE);

    m3(i) = [pEnd(zi)]({pServer(c1) true, pServer(c2) true, pServer(c3) true,

    pServer(c4) true, pDisk(d1) true, pDisk(d2) true, , pDisk(d16) true,

    pEnd(zi) false, pClient(zi) true} RE).

  • .

    14

    (q 3) , . . , - , - .

    !! !! , - . !! , , , . - -, , . , . - !! , -, . !! - . - !! - . , -.

    - , - . - - .

    , , - . , - - , .

    - ,

  • 2 (22), 2012 . ,

    15

    - - . - - . - , - , .

    1. , . / . . . : , 2003. 550 . 2. , . Windows / . . . : ,

    2005. 432 . 3. / . . : , 2010.

    544 . 4. , . .

    (

Recommended

View more >