Skip to main content
Fig. 3 | EURASIP Journal on Wireless Communications and Networking

Fig. 3

From: Private and rateless adaptive coded matrix-vector multiplication

Fig. 3

Comparison between PRAC and Staircase codes average completion time as a function of number of colluding workers z. We fix the number of rows to \(m=1000\). Both codes are affected by the increase of number of colluding helpers because their runtime is restricted to the slowest \(n-z\) workers. We observe that PRAC outperforms Staircase codes except when the \(n-z\) slowest workers are homogeneous

Back to article page
\