In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (N P \le n - 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.

null

Martha Torres, Junior Barrera, Alfredo Goldman, "A Parallel Algorithm for Enumerating Combinations", 2013 42nd International Conference on Parallel Processing, vol. 00, no. , pp. 581, 2003, doi:10.1109/ICPP.2003.1240626