Bounds for l-selection and related problems on grids of processors

Publisher Website

1 January 1989

book chapter
Published by Springer Nature

p. 298-307
https://doi.org/10.1007/3-540-50647-0_121

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

Lower bounds for sorting on mesh-connected architectures
Acta Informatica, 1987
The distance bound for sorting on mesh-connected processor arrays is tight
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
An optimal sorting algorithm for mesh connected computers
Published by Association for Computing Machinery (ACM) ,1986
Systolic Sorting on a Mesh-Connected Network
IEEE Transactions on Computers, 1985
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
IEEE Transactions on Computers, 1983
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers, 1979
Sorting on a mesh-connected parallel computer
Communications of the ACM, 1977