Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cycle structure of a modified permutation given as a table that is partitioned over N hard disks has to be computed. While a minor point during algorithm design and analysis, we spent most time to implement and tune this particular piece of code. We present the decisions taken during implementation and give preliminary performance figures.