dc.contributor.author | Sazeides, Yiannakis | en |
dc.contributor.author | Moustakas, Andreas | en |
dc.contributor.author | Constantinides, Kypros | en |
dc.contributor.author | Kleanthous, Marios M. | en |
dc.creator | Sazeides, Yiannakis | en |
dc.creator | Moustakas, Andreas | en |
dc.creator | Constantinides, Kypros | en |
dc.creator | Kleanthous, Marios | en |
dc.date.accessioned | 2019-11-13T10:42:11Z | |
dc.date.available | 2019-11-13T10:42:11Z | |
dc.date.issued | 2008 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54934 | |
dc.description.abstract | This work investigates the potential of direction-correlations to improve branch prediction. There are two types of direction- correlation: affectors and affectees. This work considers for the first time their implications at a basic level. These correlations are determined based on dataflow graph information and are used to select the subset of global branch history bits used for prediction. If this subset is small then affectors and affectees can be useful to cut down learning time, and reduce aliasing in prediction tables. This paper extends previous work explaining why and how correlation-based predictors work by analyzing the properties of direction-correlations. It also shows that branch history selected using oracle knowledge of direction-correlations improves the accuracy of the limit and realistic conditional branch predictors, that won at the recent branch prediction contest, by up to 30% and 17% respectively. The findings in this paper call for the investigation of predictors that can learn efficiently correlations from long branch history that may be non-consecutive with holes between them. © 2008 Springer-Verlag Berlin Heidelberg. | en |
dc.source | 3rd International Conference on High Performance Embedded Architectures and Compilers, HiPEAC 2008 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-49949099128&doi=10.1007%2f978-3-540-77560-7_17&partnerID=40&md5=429b3780bf4574d354b8c19cab46c61b | |
dc.subject | History | en |
dc.subject | Forecasting | en |
dc.subject | Correlation methods | en |
dc.subject | Two types | en |
dc.subject | Program compilers | en |
dc.subject | International conferences | en |
dc.subject | High performance liquid chromatography | en |
dc.subject | Data flow analysis | en |
dc.subject | Data-flow graphs | en |
dc.subject | Aliasing | en |
dc.subject | Branch prediction | en |
dc.subject | Global branch history | en |
dc.subject | Learning time | en |
dc.subject | Conditional branches | en |
dc.subject | Embedded architectures | en |
dc.title | The significance of affectors and affectees correlations for branch prediction | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1007/978-3-540-77560-7_17 | |
dc.description.volume | 4917 LNCS | en |
dc.description.startingpage | 243 | |
dc.description.endingpage | 257 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Conference code: 73284 | en |
dc.description.notes | Cited By :5</p> | en |
dc.source.abbreviation | Lect. Notes Comput. Sci. | en |