The problem of sorting a sequence of n elements on a parallel computer with k processors is considered. The algorithms we present can all be run on a single instruction stream multiple data stream computer. For large n, each achieves an asymptotic speed-up ratio of k with respect to the best sequential algorithm, which is optimal in the number of processors used.
No takes yet. Share an insight, caveat, or question.
Baudet et al. (1978) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: