scientific article; zbMATH DE number 1574486

MaRDI QIDQ2702017zbMATHFDO

Authors Hermann Mierendorff, Helmut Schwamborn

Publication date 12 March 2001

zbMATH Keywords

LAPACKMAPLEAUGURtime complexity of sequential programs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Automatic model generation for performance estimation of parallel programs
• A priori estimation of problem solution time of FORTRAN programs
• Automating program analysis
• PERFORMANCE PREDICTION FOR PARALLEL NUMERICAL ALGORITHMS
• Transient and steady-state performance modeling of parallel processors

Cited in

(5)

• A simplified model to predict the performance of FORTRAN vector loops on the IBM 3090/VF
• A priori estimation of problem solution time of FORTRAN programs
• Automatic model generation for performance estimation of parallel programs
• On the estimation of the execution frequency of sequential program code snippets
• Statistically significant comparative performance testing of Julia and Fortran languages in case of Runge-Kutta methods

Describes a project that uses

Uses Software

• LAPACK
• Maple

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