Lower bounds for sorting on mesh-connected architectures

DOI10.1007/BF00264359zbMath0623.68060OpenAlexW2156861807MaRDI QIDQ1091826

Manfred Kunde

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264359

zbMATH Keywords

parallel algorithmssorting algorithmsLower boundssorting on mesh-connected arrays of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (8)

A mathematical model for mesh's dynamic behavior ⋮ Low-gate quantum golden collision finding ⋮ Time lower bounds for parallel sorting on a mesh-connected processor array ⋮ Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Indexing functions and time lower bounds for sorting on a mesh-connected computer ⋮ Integer sorting on a mesh-connected array of processors ⋮ Packet Routing on grids of processors

This page was built for publication: Lower bounds for sorting on mesh-connected architectures