Stojmenovic, 1992 - Google Patents
A simple systolic algorithm for generating combinations in lexicographic orderStojmenovic, 1992
View PDF- Document ID
- 12989984034833884972
- Author
- Stojmenovic I
- Publication year
- Publication venue
- Computers & Mathematics with Applications
External Links
Snippet
A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of m objects chosen from {1,…, n}. The algorithm is designed to be executed on a linear array of m processors, each having constant size memory, and each being …
- 230000001174 ascending 0 abstract description 3
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/76—Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5621908A (en) | Parallel sorting system to reduce the amount of communication between processing devices | |
| Lee | A new Benes network control algorithm | |
| EP0996881B1 (en) | A method of storing elements in a database | |
| Al-Dhelaan et al. | A new strategy for processors allocation in an n-cube multiprocessor | |
| Brown et al. | Extremal problems for directed graphs | |
| Ruskey | Simple combinatorial Gray codes constructed by reversing sublists | |
| Kaplan et al. | Persistent lists with catenation via recursive slow-down | |
| Pruesse et al. | Generating the linear extensions of certain posets by transpositions | |
| US4162534A (en) | Parallel alignment network for d-ordered vector elements | |
| Stojmenovic | A simple systolic algorithm for generating combinations in lexicographic order | |
| US4164022A (en) | Electronic digital arctangent computational apparatus | |
| KR920003176B1 (en) | Control data regenerating device for sort processor | |
| US4642793A (en) | Many-to-one mapping hash address generator | |
| Hauge et al. | On the classification of deBruijn sequences | |
| KR910014800A (en) | Barrel shifter | |
| JP3032340B2 (en) | Address generator for processor data memory | |
| Stojmenović | An optimal algorithm for generating equivalence relations on a linear array of processors | |
| Akl et al. | An optimal systolic algorithm for generating permutations in lexicographic order | |
| Bollobás et al. | A proof of a conjecture of Bondy concerning paths in weighted digraphs | |
| Elhage et al. | Systolic generation of combinations from arbitrary elements | |
| US4223391A (en) | Parallel access alignment network with barrel switch implementation for d-ordered vector elements | |
| JPH0315221B2 (en) | ||
| Knuth | Lexicographic permutations with restrictions | |
| KR910012920A (en) | Apparatus and method for calling cyclic margin error checking codes generated in parallel | |
| RU2087939C1 (en) | Variable-priority device |