scientific article; zbMATH DE number 278840

MaRDI QIDQ5289063zbMATH OpenFDO

Authors

Publication date 13 November 1994

zbMATH Keywords

parallel algorithmgranularitymatrix-vector multiplicationsystolic algorithmConnection Machinemodel of parallel computation

Mathematics Subject Classification ID

Distributed algorithms (68W15) Numerical algorithms for specific classes of architectures (65Y10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Modeling optimal granularity when adapting systolic algorithms to transputer based supercomputers
• scientific article; zbMATH DE number 176042
• GRID COMMUNICATION ON THE CONNECTION MACHINE: ANALYSIS, PERFORMANCE, AND IMPROVEMENTS

Cited in

(3)

• GRID COMMUNICATION ON THE CONNECTION MACHINE: ANALYSIS, PERFORMANCE, AND IMPROVEMENTS
• Sufficient conditions for the determination and use of data in the same granular parallel computation process
• Statistical analysis of simulation generated time series: Systolic vs. semi-systolic correlation on the Connection Machine

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 Q5289063)