An Algorithm for Routing Permutations on the Augmented Data Manipulator Network
Download:
|
|
by Chin-hung Lam
http://www.wi.euv-frankfurt-o.de/icci94/papers/b6.ps
Add To MetaCart
Abstract:
We present a search-based, deterministic algorithm for routing permutations on the Augmented Data Manipulator (ADM) network at compile time. By exploring some topological properties of the ADM, the average time complexity of the algorithm approaches linearity when N is large, where N is the number of inputs. If a permutation is realizable in one pass, the algorithm gives the required switch setting, otherwise, it is rejected. We implemented a sequential version to verify the correctness and study the performance of the algorithm.
Citations
| 160 | Access and alignment of data in an array processor – Lawrie - 1975 |
| 77 | Interconnection Networks for Large-scale Parallel Processing – Siegel - 1990 |
| 44 | A unified theory of interconnection network structure – Kruskal, Snir - 1986 |
| 14 | Data Manipulating functions in parallel processors and their implementations – Feng - 1974 |
| 3 | On the number of permutations performable by the augmented data manipulator network – Adams, Siegel - 1982 |
| 2 | On the number of permutations performable by extra-stage multistage interconnection networks – Gazit, Malek - 1989 |
| 1 | Properties and Comparison of Multi-stage Interconnection Networks for SIMD Machines – Leland - 1983 |
| 1 | On the power of the augmented data manipulator network – Leland - 1985 |
| 1 | Disjoint path properties of the data manipulator network family – Nation, Siegel - 1990 |
| 1 | The Gamma network: a multiprocessor network with redundant path – Parker, Raghavendra - 1982 |
| 1 | On permutations passable by the Gamma network – Varma, Raghavendra - 1986 |
