TESI DOCTORAL - La Salle
TESI DOCTORAL - La Salle
TESI DOCTORAL - La Salle
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
CSPA<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
CSPA<br />
RHCA DHCA flat<br />
10<br />
RHCA DHCA flat<br />
−1<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
CSPA<br />
CSPA<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
10 4<br />
10 2<br />
10 0<br />
10 −2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
EAC<br />
RHCA DHCA flat<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
EAC<br />
10<br />
RHCA DHCA flat<br />
−1<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
EAC<br />
EAC<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
10 1<br />
10 0<br />
10 −1<br />
HGPA<br />
10<br />
RHCA DHCA flat<br />
−2<br />
CPU time (sec.)<br />
Chapter 3. Hierarchical consensus architectures<br />
10 1<br />
10 0<br />
10 −1<br />
MCLA<br />
10<br />
RHCA DHCA flat<br />
−2<br />
CPU time (sec.)<br />
10 4<br />
10 2<br />
10 0<br />
10 −2<br />
ALSAD<br />
RHCA DHCA flat<br />
(a) Serial implementation running time, |dfA| =1<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
HGPA<br />
RHCA DHCA flat<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
MCLA<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
ALSAD<br />
10<br />
RHCA DHCA flat<br />
−2<br />
(b) Serial implementation running time, |dfA| =10<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
HGPA<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
MCLA<br />
RHCA DHCA flat<br />
CPU time (sec.)<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
ALSAD<br />
RHCA DHCA flat<br />
(c) Serial implementation running time, |dfA| =19<br />
CPU time (sec.)<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
HGPA<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
10 2<br />
10 1<br />
10 0<br />
MCLA<br />
RHCA DHCA flat<br />
CPU time (sec.)<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
ALSAD<br />
10<br />
RHCA DHCA flat<br />
−1<br />
(d) Serial implementation running time, |dfA| =28<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
10 −2<br />
KMSAD<br />
10<br />
RHCA DHCA flat<br />
−3<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
KMSAD<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
KMSAD<br />
RHCA DHCA flat<br />
KMSAD<br />
10<br />
RHCA DHCA flat<br />
−1<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
CPU time (sec.)<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
SLSAD<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
SLSAD<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
10 −1<br />
SLSAD<br />
10<br />
RHCA DHCA flat<br />
−2<br />
10 4<br />
10 3<br />
10 2<br />
10 1<br />
10 0<br />
SLSAD<br />
10<br />
RHCA DHCA flat<br />
−1<br />
Figure 3.19: Running times of the computationally optimal serial RHCA, DHCA and flat<br />
consensus architectures across all data collections for the diversity scenarios corresponding<br />
to the use of |dfA| = {1, 10, 19 and 28} clustering algorithms.<br />
95
Change language