City University of Hong Kong
DSpace
 

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Electronic Engineering  >
EE - Master of Philosophy  >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2031/4988

Title: Combining local and global history hashing in perceptron branch prediction
Other Titles: Jie he qu yu he quan yu li shi za cou yu gan zhi qi fen zhi yu ce
結合區域和全域歷史雜湊於感知器分支預測
Authors: Ho, Chung Yan (何頌恩)
Department: Dept. of Electronic Engineering
Degree: Master of Philosophy
Issue Date: 2007
Publisher: City University of Hong Kong
Subjects: Computer architecture
Hashing (Computer science)
Neural networks (Computer science)
Perceptrons
Notes: CityU Call Number: QA76.9.A73 H6 2007
Includes bibliographical references (leaves 91-95)
Thesis (M.Phil.)--City University of Hong Kong, 2007
ix, 96 leaves : ill. ; 30 cm.
Type: Thesis
Abstract: As instruction issue rates and depths of pipelining continue to increase, branch prediction becomes a performance hurdle for modern processors. Extremely high branch prediction accuracy is essential to achieve these processors’ potential performance. Many perceptron branch predictors have been investigated to improve the dynamic branch prediction in recent years. This thesis introduces combining local history hashing and global history hashing in perceptron branch prediction. The proposed perceptron predictor utilizes self-history as well as global history in indexing different weights of a perceptron. The simulation results show that our proposed perceptron predictor is more accurate than the one using either global history hashing or local history hashing alone. Moreover, our proposed perceptron predictor improves the misprediction rate by up to 26.9% over path-based neural predictor, and 17.2% over hashed perceptron predictor at 8,192 perceptrons configuration. And it is 12.2% more accurate than the global hashed perceptron predictor when the number of perceptrons is 256. In addition, a reducing aliasing approach is employed to improve the accuracy of our proposed perceptron predictor by diminishing the impact of destructive interference. The simulation results provide evidence that the reducing aliasing approach has relatively significant improvement on our proposed perceptron predictor configured with smaller number of perceptrons. Keywords: branch prediction, perceptrons, hashing, neural networks.
Online Catalog Link: http://lib.cityu.edu.hk/record=b2217826
Appears in Collections:EE - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer