Abstract
In optimization, search, and learning, it is very common to compare our new results with previous works but, sometimes, we can find some troubles: it is not easy to reproduce the results or to obtain an exact implementation of the original work, or we do not have access to the same processor where the original algorithm was tested for running our own algorithm. With the present work we try to provide the basis for a methodology to characterize the execution time of an algorithm in a processor, given its execution time in another one, so that we could fairly compare algorithms running in different processors. In this paper, we present a proposal for such a methodology, as well as an example of its use applied to two well-known algorithms (Genetic Algorithms and Simulated Annealing) and solving the MAXSAT problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the IJCAI 1991, pp. 331–337 (1991)
Curnow, H.J., Wichmann, B.A.: A synthetic benchmark. The Computer Journal 19(1), 43–49 (1976)
Dongarra, J.: Performance of Various Computers Using Standard Linear Algebra Software in a Fortran Environment, http://netlib.org/benchmark/performance.pdf
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. The MIT Press, Cambridge (1992)
Kirkpatrik, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science, 671–680 (1983)
Longbottom, R.: Dhrystone 2.1 Benchmark Results On PCs (2011), http://www.roylongbottom.org.uk/dhrystone%20results.htm
McMahon, F.H.: The Livermore Fortran Kernels: A Computer Test Of The Numerical Performance Range, Lawrence Livermore National Laboratory, Livermore, California, UCRL-53745 (December 1986)
Weicker, R.P.: Dhrystone: a synthetic systems programming benchmark. Commun. ACM 27, 10 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domínguez, J., Alba, E. (2012). A Methodology for Comparing the Execution Time of Metaheuristics Running on Different Hardware. In: Hao, JK., Middendorf, M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29124-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-29124-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29123-4
Online ISBN: 978-3-642-29124-1
eBook Packages: Computer ScienceComputer Science (R0)