Dedekind numbers (D(n) | n = 0, 1, 2, . . . ) are a rapidly growing sequence of integers: 2, 3, 6, 20, 168, 7,581, 7,828,354, 2,414,682,040,998, 56,130,437,228,687,557,907,788. D(N) counts the number of monotonic Boolean functions of n variables. D(8) is the biggest known Dedekind number so far. It was first computed in 1991 by Doug Wiedemann. This took 200 hours on a Cray-2. In the thesis of Arjen Teijo Zijlstra, Wiedemann's strategy is explained, implemented in C/C++ and parallelized using the Message Passing Interface MPI. The goal was to gather knowledge about the theory and to check the calculation. Another intention of the thesis was to speedup the calculation as much as possible. The goal of this SPIN project is to study and benchmark Ziljstra's implementation, and try and improve on the techniques presented there. This also provides an interesting challenge to experiment with different parallelization strategies and study applications: e.g., the NSF-funded Euler projects uses model-based diagnosis techniques to debug taxonomy alignments. Thus, the project is interesting both from a "pure HPC" technology point of view, as well as from an applications point of view.