scientific article; zbMATH DE number 3970105

MaRDI QIDQ3736902zbMATH OpenFDO

Authors F. Hossfeld

Publication date 1986

zbMATH Keywords

communication complexitydata-flow structuredesign and analysis of parallel algorithmsFast Fourier Transforminterconnection networkmultiplication of matricesparallel architecturessurveysystolic arrays

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Recommendations

• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• scientific article; zbMATH DE number 107950
• scientific article; zbMATH DE number 4033059
• scientific article; zbMATH DE number 53193
• scientific article; zbMATH DE number 4016186

Cited in

(5)

• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• Your favorite parallel algorithms might not be as fast as you think
• scientific article; zbMATH DE number 4126681 (Why is no real title available?)
• scientific article; zbMATH DE number 1011685 (Why is no real title available?)
• scientific article; zbMATH DE number 2090609 (Why is no real title available?)

This page was built for publication:

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