Divide-and-Conquer for Parallel Processing

DOI10.1109/TC.1983.1676280MaRDI QIDQ3659129zbMATH OpenOpenAlexFDO

Authors 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 architecturesparallel matrix multiplicationparallel sortingtime and data movement complexity

Mathematics Subject Classification ID

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

Cited in

(3)

• scientific article; zbMATH DE number 3909766 (Why is no real title available?)
• Parallel best-first branch-and-bound in discrete optimization: a framework
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659129)