Data Technologies Contest (Contest was run on Exercise 3) (1) | ||||||||||||
|
||||||||||||
(1)
Fastest Parity Check Implementation
(2) Algorithm for obtaining the contest mark
1.
Students existing binaries were first downloaded to the same desktop
machine
2.
Four
stripe files were created and parity for a 886 MB archive file
3.
A single byte was modified in the middle of the parity stripe and
student’s code was verified
4.
Student’s code was benchmarked in 20 concurrent iterations and the
average was measured |