Ответы к экзамену 1
.0.pdf
Коммутативный параллелизм – означает, что независимые элементы (операторы, функции, предикаты и т.п.) могут выполняться в произвольном порядке, не меняя общего результата выполнения программы.
if P(x) then f1(x) else f2(x)
F(g1,g2,g3)
(g1 * g2).eq -> g1 +
(g2 * g3).eq -> g2 +
(g1 * g3).eq -> g3
( ) |
|
( |
|
) |
( |
|
|
|
) |
|
|
|
|
|
|
|
|
||||||
( |
) |
|
|
|
( |
|
|
) ( |
|
) |
|
|
|
|
|
|
|
||||||
( )
⁄( )
( ) |
( ) |
( ) 
( ) 
( |
) |
|
( |
св) |
св |
( )
( )
( |
) |
( |
) |
|
( |
) |
|
|
|
( |
) |
|
||
|
|
|
||
( |
) |
( ) |
( |
| |
|
|) |
( |
| |
|
| |
) |
|
|
( )
–
( )
р
|
( |
) |
|
|
|
|
|
|
|
|
оп |
( |
|
) |
( ) |
|
|
|
оп |
||||
( |
̅ ) |
о мен |
|
о мен
̅
: |
{ |
} |
: |
{ |
} |
a |
c |
b
d
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
( |
) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
3 |
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3 |
|
|
|
|
|
→ → →
→ → →
( ) |
{ |
} |
begin
real r1, r2, z,
real array a, b, c, d [1...100] S: r1 := r2 := z := 0;
par begin
A:for i := 1 step 1 until n do r1 := r1 + a[i] * b[i];
B:for j := 1 step 1 until n do r2 := r2 + c[i] * d[i];
end
E: z := r1 + r2; output (z);
end
( )