Computational force: a unifying concept for scalability analysis

MaRDI QIDQ3601045zbMATH OpenFDO

Authors Robert W. Numrich

Publication date 9 February 2009

zbMATH Keywords

parallel numerical algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Computational forces in the linpack benchmark
• On high level characterization of parallelism
• Analyzing scalability of Neville elimination
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Scalability versus execution time in scalable systems

Cited in

(2)

• Self-similarity of parallel machines
• Computational forces in the linpack benchmark

This page was built for publication: Computational force: a unifying concept for scalability analysis

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