Fast implementation of the Baum-Welch algorithm for the course "Advanced Systems Lab"(Spring 2020) at ETH Zürich.
- code contains the main versions of the algorithm and scripts to benchmark them
- documents contains written documents like the counting of instructions or the final report.
- experiments shows some small scale tests that were run during the development of the algorithm and also the testing with a r-library
- old versions shows the small increments and bigger tests between main versions
- output_measures contains the output of the benchmark scripts with times and parsed cachegrind output.
- plots displays all plots that were generated, the most important of those are also in the final report. Next to the plots are also the scripts to generate them.
- valgrind has the raw cachegrind output in them.
- std For the most standard implementations
- stb For the stable version
- cop For all basic C optimizations
- reo For the reordering (code motion) step
- bla For the BLAS version
- url For the unrolled version
- vec For the vectorized version
This project was made by Team 35:
- Luca Blum (lblum)
- Jannik Gut (jgut)
- Jan Schilliger (schiljan)