A parallel algorithm for enumerating combinations

We propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NPlesn-m+1) in order to generate the set of all combinations of C(n,m). The main characteristic of this algorithm is to require no integer larger than n during the whole computation. The performance results show that even without a perfect load balance, this algorithm has very good performance, mainly when n is large. Besides, the dynamic algorithm presents a good performance on heterogeneous parallel platforms