Work-Preserving Emulations of Shuffle-Exchange Networks: An Analysis of the Complex Plane Diagram
|
Abstract:
In this paper we show that for each n, the order-n Shuffle-Exchange network can be emulated by an n-node linear processor array or an n 2-node mesh in a work-preserving manner. An emulation of a computation on a guest network G is work-preserving on a host network H, if the time-processor product is equal, to within a constant factor. To achieve this result we demonstrate a uniform many-to-one embedding of the nodes of a Shuffle-Exchange network into a linear array. We then give a simple, deterministic routing algorithm on the linear array which schedules the communication of messages necessary to achieve the emulation within the required time bounds. The analysis of the algorithm relies on certain statistical properties of the complex plane diagram of the Shuffle-Exchange network. 1.
Citations
| 1329 | Convergence of Probability Measures – Billingsley - 1968 |
| 1206 | Introduction to Parallel Algorithms and Architectures: Arrays – Leighton - 1992 |
| 979 | An introduction to probability theory and its application, volume I – Feller - 1967 |
| 132 | Parallel processing with the perfect shuffle – Stone - 1971 |
| 74 | Universal packet routing algorithms – Leighton, Maggs, et al. - 1988 |
| 46 | Work-preserving emulations of fixed-connection networks – Koch, Leighton, et al. - 1989 |
| 5 | A layout for the shuffle-exchange network – Hoey, Leiserson - 1980 |
| 5 | Layouts for the shuffle-exchange graph based on the complex plane diagram – Leighton, Lepley, et al. - 1984 |
| 3 | A layout for the shuffle-exchange network with \Theta(N = log 3=2 N) area – Steinberg, Rodeh - 1981 |
