Abstract
A parallel algorithm for generating all combinations ofm out ofn items in lexicographic order is presented. The algorithm usesm processors and runs inO(nCm) time. The cost of the algorithm, which is the parallel running time multiplied by the number of processors used, is optimal to within a constant multiplicative factor in view of the Ω(ncm*m) lower bound on the number of operations required to solve this problem using a sequential computer.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. G. Akl,Parallel Sorting Algorithms, Academic Press, Orlando, Florida, 1985.
P. J. Chase,Algorithm 382: Combinations of M out of N Objects, Communications of the ACM, 13 (6), p. 368, 1970.
G. Ehrlich,Algorithm 466: Four Combinatorial Algorithms, Communications of the ACM, 16 (11), pp. 690–691, 1973.
G. Ehrlich,Loopless algorithms for generating permmutations, combinations and other combinatorial configurations, Journal of the ACM, 20 (3), pp. 500–513, 1973.
P. Gupta and G. P. Bhattacharjee,Parallel generation of permutations, The Computer Journal, 26 (2), pp. 97–105, 1983.
H. T. Kung,The structure of parallel algorithms, in:Advances in Computers, M. C. Yovits, Ed., Academic Press, New York, pp. 65–112, 1980.
H. S. Stone,Parallel computers, in:Introduction to Computer Architectures, H. S. Stone, Ed., Science Research Associates, Chicago, pp. 363–458, 1980.
V. Zakharov,Parallelism and array processing, IEEE Transactions on Computers, C-33 (1), pp. 45–78, 1984.
Author information
Authors and Affiliations
Additional information
This work was supported by the Natural Sciences and Engineering Research Council of Canada under Grant NSERC-A3336.
Rights and permissions
About this article
Cite this article
Chan, B., Akl, S.G. Generating combinations in parallel. BIT 26, 1–6 (1986). https://doi.org/10.1007/BF01939357
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01939357