Indexing functions and time lower bounds for sorting on a mesh-connected computer

DOI10.1016/0166-218X(92)90228-3zbMath0746.68026OpenAlexW2028776311MaRDI QIDQ1192947

Miroslaw Truszczynski, Yijie Han, Yoshihide Igarashi

Publication date: 27 September 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90228-3

zbMATH Keywords

parallel computationlower and upper boundsindexing schememesh-connected processor arrayindexing functions

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (3)

Time lower bounds for parallel sorting on a mesh-connected processor array ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Simulating the Bitonic Sort Using P Systems

Cites Work

• Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
• Lower bounds for sorting on mesh-connected architectures
• Time lower bounds for parallel sorting on a mesh-connected processor array
• Systolic Sorting on a Mesh-Connected Network
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Unnamed Item
• Unnamed Item

This page was built for publication: Indexing functions and time lower bounds for sorting on a mesh-connected computer