Por favor, use este identificador para citar o enlazar este ítem: https://rd.uffs.edu.br/handle/prefix/3374
Type: Monografia
Título : Investigating hierarchical temporal memory networks applied to dynamic branch prediction
Author: Konflanz, Daniel Mello
First advisor: Caimi, Luciano Lores
Resumen : As a consequence of the high application of instruction-level parallelism techniques in modern processors, the branch prediction are a of study remains relevant after 40 years of research. This work applies neural networks based on the Hierarchical Temporal Memory (HTM) theory to the branch prediction task and explores their adequacy to the problem’s characteristics. More specifically, the problem is faced asa sequence prediction task and tackled by the HTM sequence memory. Four traditional branch prediction schemes adapted to operate with an HTM system and two variations of the previous designs were evaluated on a slice of the traces provided by the 4th Championship Branch Prediction contest. The leading result was achieved by the HTM predictor based on the g share branch predictor, that for 8 million instructions was able to improve them is prediction rate by 14.3% incomparison to it straditiona l2-bitcounters version when both used a 13-bithi storyl ength. However, high level so faliasing were found to prevent the HTM system to scale and compete again stlarger conventional branch predictors.
Palabras clave : Memória ram
Redes neurais
Ciência da computação
Language: eng
Country: Brasil
Editorial : Universidade Federal da Fronteira Sul
Acronym of the institution: UFFS
College, Institute or Department: Campus Chapecó
Type of Access: Acesso Aberto
URI : https://rd.uffs.edu.br/handle/prefix/3374
Fecha de publicación : 2019
Aparece en las colecciones: Ciência da Computação

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
KONFLANZ.pdf2,57 MBAdobe PDFVisualizar/Abrir


Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.