Pipelined parallel prefix computations, and sorting on a pipelined hypercube

DOI10.1006/jpdc.1993.1037zbMath0779.68041OpenAlexW1997876174MaRDI QIDQ2365584

Ernst W. Mayr, C. Greg Plaxton

Publication date: 29 June 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/827bd560dfa4b5c644d3ba088e23dcb1dc2ede9b

zbMATH Keywords

hypercubedata distributioncomplete binary treeshuffle-exchangeprefix operationmultiway merge sort

Mathematics Subject Classification ID

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

Related Items (3)

Divide-and-conquer algorithms on the hypercube ⋮ Mapping a functional notation for parallel programs onto hypercubes ⋮ Improved fault-tolerance sorting algorithm in hypercubes

This page was built for publication: Pipelined parallel prefix computations, and sorting on a pipelined hypercube