Automatic Benchmarking and Optimization of Codes: An Experience with Numerical Kernels

Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number of code variants or possible input parameters is very high, the process of benchmarking and analysis of results can become cumbersome and error prone. We present a tool for automatic benchmarking which manages a database of possible parameters and the results obtained for them. This tool can automatically choose the optimum code and create a target library. Using it we have generated a library specialized in the operation on very small matrices which is useful in multimedia codes.

• Type: Conference
• Year: 2003
• Where: SERP
• Authors: José R. Herrero, Juan J. Navarro
• Keywords: Code, Many Variants, Possible Input Parameters, SERP 2003, SERP 2007