Hyper-heuristics for performance optimization of simultaneous multithreaded processors

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Simultaneous Multi-Threaded (SMT) processor datapaths, there are many datapath resources that are shared by multiple threads. Currently, there are a few heuristics that distribute these resources among threads for better performance. A selection hyper-heuristic is a search method which mixes a fixed set of heuristics to exploit their strengths while solving a given problem. In this study, we propose learning selection hyper-heuristics for predicting, choosing and running the best performing heuristic. Our initial test results show that hyper-heuristics may improve the performance of the studied workloads by around 2%, on the average. The peak performance improvement is observed to be 41% over the best performing heuristic, and more than 15% over all heuristics that are studied. Our best hyper-heuristic performs better than the state-of-the art heuristics on almost 60% of the simulated workloads. © 2013 Springer International Publishing.

Cite

CITATION STYLE

APA

Güney, I. A., Küçük, G., & Özcan, E. (2014). Hyper-heuristics for performance optimization of simultaneous multithreaded processors. In Lecture Notes in Electrical Engineering (Vol. 264 LNEE, pp. 97–106). Springer Verlag. https://doi.org/10.1007/978-3-319-01604-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free