A novel parallel algorithm for enumerating combinations
Baojian Zhou, Richard P. Brent, Xun Qu, Weifa Liang · 2002
We propose a new algorithm for parallel enumeration of combinations. This algorithm uses N processing elements (or PEs). We prove that, if N and M are relatively prime, each PE will do the same operations and generate the same number of distinct combinations so that the computational load is well balanced. The algorithm has an important application in solving the problem of fault tolerance in replicated file systems.