Performance of linear algebra code: Intel xeon EM64T and itaniumII case examples

Abstract

The canonical form of many large-scale scientific and technical computing problems are often linear algebra problems. As such, routines such as matrix solvers find their use in a wide range of applications. The performance of matrix solvers are often critical in determining the performance of the application programs. This paper investigates the performance of common linear algebra routines on the current architectures of interest to supercomputing users, namely the Intel Xeon EM64T and ItaniumII, with examples from OptimaNumerics Libraries. Performance issues and myths are also shown and diffused in this paper. © Springer-Verlag Berlin Heidelberg 2005.