A Parallel Algorithm for Enumerating Combinations

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 (NP ≤ 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.1

• Type: Conference
• Year: 2003
• Where: ICPP
• Authors: Martha Torres, Alfredo Goldman, Junior Barrera
• Keywords: Algorithm, Distributed And Parallel Computing, Dynamic Algorithm, Efficient Parallel Algorithm, ICPP 2003