Systolic Generation of combinations from Arbitrary Elements

A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of m objects chosen from an arbitrary set of n elements. The algorithm is designed to be executed on a linear array of m processors, each having constant size memory (except processor m, which has O(n) memory), and each being responsible for producing one element of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) time solution, where C(m, n) is the total number of combinations. The algorithm is cost-optimal (assuming the time to output the combinations is counted), and does not deal with very large integers.

[1]  Ivan Stojmenovic,et al.  Systolic generation of derangements , 1991, Algorithms and Parallel VLSI Architectures.

[2]  Frank Ruskey,et al.  Adjacent Interchange Generation of Combinations , 1988, J. Algorithms.

[3]  Jong-Chuang Tsay,et al.  A systolic generation of combinations , 1989, BIT Comput. Sci. Sect..

[4]  Gary D. Knott.  A numbering system for combinations , 1974, CACM.

[5]  Jong-Chuang Tsay,et al.  A systolic design for generating combinations in lexicographic order , 1990, Parallel Comput..

[6]  Ivan Stojmenovic,et al.  Constant Delay Parallel Counters , 1991, Parallel Process. Lett..

[7]  Selim G. Akl.  A Comparison of Combination Generation Methods , 1981, TOMS.

[8]  Dilip Sarkar.  Cost and Time-Cost Effectiveness of Multiprocessing , 1993, IEEE Trans. Parallel Distributed Syst..

[9]  S.G. Akl,et al.  An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order , 1994, J. Parallel Distributed Comput..

[10]  Selim G. Akl,et al.  Generating combinations in parallel , 1986, BIT Comput. Sci. Sect..

[11]  Selim G. Akl,et al.  Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations , 1987, Comput. J..

[12]  Ivan Stojmenovic.  An optimal algorithm for generating equivalence relations on a linear array of processors , 1990, BIT Comput. Sci. Sect..

[13]  Ivan Stojmenovic,et al.  An Optimal Parallel Algorithm for Generating Combinations , 1989, Inf. Process. Lett..

[14]  I..  A Simple Systolic Algorithm for Generating Combinations in Lexicographic Order , 1992 .

[15]  W. H. Payne,et al.  Combination Generators , 1979, TOMS.

[16]  Ch'i-Hsin Lin.  A PARALLEL ALGORITHM FOR GENERATING COMBINATIONS , 1989 .

[17]  Ivan Stojmenovic.  On random and adaptive parallel generation of combinatorial objects , 1992, Int. J. Comput. Math..

[18]  I. Stomenovic.  An optimal algorithm for generating equivalence relations on a linear array of processors , 1990 .

[19]  I. Semba.  A Note on Enumerating Combinations in Lexicographical Order , 1981 .

[20]  Maw-Sheng Chern,et al.  Parallel generation of permutations and combinations , 1986, BIT Comput. Sci. Sect..