A \(d\)-move local permutation routing for the \(d\)-cube (Q674437): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Access and Alignment of Data in an Array Processor / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counterexample to a conjecture of Szymanski on hypercube routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network / rank | |||
Normal rank | |||
Latest revision as of 11:35, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(d\)-move local permutation routing for the \(d\)-cube |
scientific article |
Statements
A \(d\)-move local permutation routing for the \(d\)-cube (English)
0 references
5 March 1997
0 references
interconnection networks
0 references
packet routing algorithms
0 references
\(d\)-cubes
0 references
0 references
