Macroparallelism and the decomposition of algorithms

MaRDI QIDQ1921636zbMATH OpenFDO

Authors V. V. Voevodin

Publication date 27 October 1996

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

macroparallel computers

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

Recommendations

• Parallelizing of algorithms on the basis of splitting of macro-operations
• scientific article; zbMATH DE number 766286
• scientific article; zbMATH DE number 3947614
• Expression for massively parallel algorithms - description and illustrative example
• Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems

Cited in

(7)

• Some approaches to the analysis of computation optimization problems
• Sufficient conditions for the determination and use of data in the same granular parallel computation process
• Graphs and algorithms
• Parallelizing of algorithms on the basis of splitting of macro-operations
• scientific article; zbMATH DE number 3947614 (Why is no real title available?)
• scientific article; zbMATH DE number 3982421 (Why is no real title available?)
• Algorithm 803

This page was built for publication: Macroparallelism and the decomposition of algorithms

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