29.04.2013 Views

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3.2. Random hierarchical consensus architectures<br />

s : number of stages<br />

10 1<br />

Number of RHCA stages as a function of b<br />

10 0<br />

10 0<br />

10 1<br />

10 2<br />

b<br />

10 3<br />

100<br />

200<br />

500<br />

1000<br />

2000<br />

5000<br />

10000<br />

10 4<br />

(a) Evolution of the number of<br />

RHCA stages s as a function<br />

of b<br />

10 4<br />

10 3<br />

10 2<br />

10 1<br />

10 0<br />

10 0<br />

10 1<br />

10 2<br />

b<br />

10 3<br />

100<br />

200<br />

500<br />

1000<br />

2000<br />

5000<br />

10000<br />

10 4<br />

sum(K i ) : total number of consensus Number of consensus in a RHCA as a function of b<br />

(b) Evolution of the total<br />

number of RHCA consensus<br />

s<br />

Ki as a function of b<br />

i=1<br />

10 4<br />

10 3<br />

10 2<br />

10 1<br />

b ij : mean mini−ensemble size Mini−ensembles size of a RHCA as a function of b<br />

10 0<br />

10 0<br />

10 1<br />

10 2<br />

b<br />

10 3<br />

100<br />

200<br />

500<br />

1000<br />

2000<br />

5000<br />

10000<br />

10 4<br />

(c) Evolution of the mean<br />

mini-ensembles size as a function<br />

of b<br />

Figure 3.3: Evolution of RHCA parameters as a function of the mini-ensembles size b for<br />

cluster ensembles sizes ranging from 100 to 10000.<br />

3.2.3 Running time minimization<br />

PTCRHCA O (log b (l)(2b) w )=O (b w log b (l)) (3.11)<br />

In light of the expressions of the upper bounds of the serial and parallel time complexities<br />

of RHCA, a naturally arising question is which particular RHCA configuration yields, for<br />

a given cluster ensemble, the minimal running time —notice that the user’s election of the<br />

mini-ensembles size b determines both the number of stages and of consensus computed per<br />

stage, see equations (3.1) and (3.2), which ultimately determines the running time of the<br />

RHCA.<br />

In fact, there exists a trade-off between the value of b and the execution time of the<br />

whole RHCA, as selecting a small value for b simultaneously reduces the time complexity of<br />

each consensus while increasing the total number of stages (s) and of consensus processes<br />

of the RHCA ( s<br />

Ki), and vice versa.<br />

i=1<br />

With the purpose of visualizing the dependence between b and these factors, figure 3.3<br />

depicts their value for different cluster ensembles sizes l ∈ [100, 10000] as a function of the<br />

mini-ensembles size b ∈ 2, ⌊ l<br />

2 ⌋ .<br />

Firstly, figure 3.3(a) shows the exponential decay of the number of RHCA stages s as a<br />

function of b, caused by the fact that s is computed as the b-base logarithm of the cluster<br />

ensemble size l. Secondly, the evolution of the total number of consensus processes follows<br />

a fast exponential decay (hard to appreciate in this doubly logarithmic chart), as depicted<br />

in figure 3.3(b). And finally, figure 3.3(c) presents the mean value of the effective miniensembles<br />

size bij across the whole RHCA (which obviously scales linearly with b)asarough<br />

indicator of the complexity of each halfway consensus process, which will approximately be<br />

(linearly or quadratically) proportional to this value.<br />

Allowing for the evident dependence between the user defined mini-ensembles size b and<br />

54

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!