Routing, merging, and sorting on parallel models of computation (Q1082818)

A variety of models have been proposed for the study of synchronous parallel computation. These models are reviewed and some prototype problems are studied further. Two classes of models are recognized, fixed connection networks and models based on a shared memory. Routing and sorting are prototype problems for the networks; in particular, they provide the basis for simulating the more powerful shared memory models. It is shown that a simple but important class of deterministic strategies (oblivious routing) is necessarily inefficient with respect to worst case analysis. Routing can be viewed as a special case of sorting, and the existence of an O(log n) sorting algorithm for some n processor fixed connection network has only recently been established by \textit{M. Ajtai}, \textit{J. Komlos}, and \textit{E. Szemeredi} [15th ACM Symp. on Theory of Comput., Boston, Mass., 1-9 (1983)]. If the more powerful class of shared memory models is considered then it is possible to simply achieve an O(log n loglog n) sort via Valiant's parallel merging algorithm, which it is shown can be implemented on certain models. Within a spectrum of shared memory models, it is shown that loglog n is asymptotically optimal for n processors to merge two sorted lists containing n elements.