Divide-and-Conquer for Parallel Processing

DOI10.1109/TC.1983.1676280zbMath0513.68029OpenAlexW1990808267MaRDI QIDQ3659129

Ellis Horowitz, Alessandro Zorat

Publication date: 1983

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1983.1676280

zbMATH Keywords

parallel sortingparallel architecturesparallel matrix multiplicationtime and data movement complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (2)

Unnamed Item ⋮ Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy

This page was built for publication: Divide-and-Conquer for Parallel Processing