XI Workshop de Testes e Tolerância a Falhas (WTF) - SBRC 2010

172 Anais
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
Algorithm MP − AJRP (verInter, routeT able, demList)
INPUT:
p > 0, SET j ∈ MSG i (p), origem i (SET j ) = (n i , n j );
ACTION:
forall message ∈ SET j do
if (message.destId ≠ myRank i ) then
if (bufferUsage i < bufferSize i ) then
enqueue(message, pol);
bufferUsage i ← bufferUsage i + 1;
end
end
end
forall message ∈ demandList i [j][y], j ∈ N, p = y, y ∈ Y do
if (bufferUsage i < bufferSize i ) then
enqueue(message, pol);
bufferUsage i ← bufferUsage i + 1;
end
end
forall active (i, j) in p, j ∈ Neig i do
SET i [k] ← nulo, ∀ k < setSize;
setSize ← 0;
while ((message = dequeue(j, pol)) ≠ nulo) AND
(setSize ≤ vecInter i (j).capacidade) do
bufferUsage i ← bufferUsage i − 1;
setSize ← setSize + 1;
SET i [setSize] ← message;
end
SEND SET i to n j ;
percent ← (bufferUsage i /bufferSize i ) ∗ 100;
SEND Control(percent) to n j ;
end
INPUT:
p > 0, Control i (percent), origem i = n j ;
ACTION:
vecUsage i [j] ← percent;
choice ← vecUsage i [0];
forall k ∈ N do
forall r ∈ R, y ∈ Y , y > p do
if vecUsage i [j] < choice then
choice ← vecUsage i [j];
end
end
routeT able i [k].choice ← choice;
end
Algorithm 1: Algoritmo MP-AJRP
armazenamento desta estrutura de dados é de O(NRY ).