Generating combinations in parallel (Q1082084): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Generation of Permutations / rank | |||
Normal rank | |||
Latest revision as of 15:22, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating combinations in parallel |
scientific article |
Statements
Generating combinations in parallel (English)
0 references
1986
0 references
A parallel algorithm for generating all combinations of m out of n items in lexicographic order is presented. The algorithm uses m processors and runs in O(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 \(\Omega\) (nCm*m) lower bound on the number of operations required to solve this problem using a sequential computer.
0 references
adaptive algorithm
0 references
cost-optimal algorithm
0 references
parallel algorithm
0 references
