Generating subsets on a systolic array

@article{Lin1991GeneratingSO,
  title={Generating subsets on a systolic array},
  author={Chau-Jy Lin},
  journal={Computers & Mathematics With Applications},
  year={1991},
  volume={21},
  pages={103-109}
}
  • Chau-Jy Lin
  • Published 1991
  • Mathematics
  • Computers & Mathematics With Applications
Abstract Given n elements and an arbitrary integer m for m ⩽ n, a systolic algorithm for generating all r -subsets (subsets containing r elements) with 1 ⩽ r ⩽ m in lexicographic order is presented. The computational model used is a linear systolic array consisting of m identical processing elements with a simple structure. One subset is produced at a time step. The elapsed time within a time step is independent of integers r , n and m . The design process of systolic array and the verification… Expand
2 Citations
A systolic algorithm for solving dense linear systems
  • 1
  • PDF
On Parallel Generation of Combinations in Associative Processor Architectures
  • 11
  • PDF

References

SHOWING 1-6 OF 6 REFERENCES
Parallel generation of permutations and combinations
  • 39
Generating combinations in parallel
  • 20
Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations
  • S. Akl
  • Computer Science, Mathematics
  • Comput. J.
  • 1987
  • 40
  • PDF
Why systolic architectures?
  • 2,214
  • PDF