Paper Info
Title
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.
Year
Venue
Keywords
2003
SERP'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING RESEARCH AND PRACTICE, VOLS 1 AND 2
automatic benchmarking,tuning,performance,small matrices
Field
DocType
Citations 
Data mining,Matrix (mathematics),Computer science,Artificial intelligence,Machine learning,Benchmarking
Conference
7
PageRank 
References 
Authors
0.60
7
2
Name
Order
Citations
PageRank
José R. Herrero19416.90
Juan J. Navarro232342.90