Abstract
A parallel algorithm for generating all combinations ofm (m fixed) items out of anyn given items in lexicographic order is presented. The computational model is a linear systolic array consisting ofm identical processing elements. This algorithm requires {ie23-1} time-steps for the {ie23-2} combinations, that is, one output at each time-step. Since all processing elements perform the same program, it is suitable for VLSI implementation. Based on mathematical induction, such an algorithm is proved to be correct.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice, Prentice-Hall INC. Englewood Cliffs, New Jersey, 1977.
B. Chan and S. G. Akl,Generating combinations in parallel, BIT 26 (1986), pp. 2–6.
S. G. Akl,Parallel Sorting Algorithms, Academic Press, Orlando, Florida, 1985.
G. H. Chen and M. S. Chern,Parallel generating of permutations and combinations, BIT 26 (1986), pp. 277–283.
C. Y. Tag, M. W. Du, and R. C. T. Lee,Parallel generation of combinations, in Proc. Int'l. Comput. Symp., Taipei, Taiwan, 1984, pp. 1006–1010.
H. T. Kung,The structure of parallel algorithms, inAdvances in Computers, M. C. Yovits, Ed. Academic Press, New York, 1980, pp. 65–112.
H. S. Stone,Parallel computers, inIntroduction to Computer Architectures, 1980.
I. Semba,An efficient algorithm for generating all k-subsets (1 ≤ k ≤ m ≤ n) of the set {1,2,...,n} in lexicographic order, Journal of Algorithms 5, 1984, pp. 281–283.
R. Sedgewick,Permutation generation methods, Computing Surveys, Vol. 9, No. 2. 1977, pp. 137–164.
V. Zakharov,Parallelism and array processing IEEE Trans. on Computers, Vol. C-33, No. 1, 1984, pp. 45–78.
D. I. Moldovan,On the design of algorithms for VLSI systolic arrays, Proc. IEEE, Vol. 71, No. 1, 1983, pp. 113–120.
D. I. Moldovan and J. A. B. Fortes,Partitioning and mapping algorithms into fixed size systolic arrays, IEEE Trans. on Computers, Vol. C-35, No. 12.
S. Sahni,Approximate algorithms for the 0/1 knapsack problem, J. ACM, Vol. 22, No. 1, 1975, pp. 115–124.
G. H. Chen, M. S. Chern, and R. C. T. Lee,A new systolic architecture for convex hull and half-plane intersection problems, BIT 27, 1987, pp. 141–147.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lin, CJ., Tsay, JC. A systolic generation of combinations. BIT 29, 23–36 (1989). https://doi.org/10.1007/BF01932702
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932702