From: Efficient verification of parallel matrix multiplication in public cloud: the MapReduce case
Notation | Description |
---|---|
H | The height of computation trees in reducers |
N | The total number of input records for all reduce jobs. |
\(N_p\) | The total number of nodes in level \(H-1\) of each joined tree (=N/2). |
S | The ratio of randomly selecting reduce input records |
C | The cheating probability during the map and reduce phase |
\(T_s\) | Total number of samples used for the verification process |