Branch prediction using branch correlation in self history-based branch predictors자신역사 기반 분기 예측기에서 분기 명령어 상호관계를 이용한 분기 예측

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 525
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorCho, Jung-Wan-
dc.contributor.advisor조정완-
dc.contributor.authorKang, Young-Jae-
dc.contributor.author강영재-
dc.date.accessioned2011-12-13T05:25:32Z-
dc.date.available2011-12-13T05:25:32Z-
dc.date.issued2001-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=165634&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33175-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2001.2, [ ix, 88 p. ]-
dc.description.abstractOne of the main obstacles in designing of today`s wide-issue, deeply-pipelined superscalar processors is the conditional branch instruction. This is because the outcome of a conditional branch instruction is resolved in the late stage of a pipeline, which results in wasted processor cycles due to pipeline stalls. Various approaches have been proposed to solve the branch problem, including dynamic branch prediction that is probably the most popular one, because it gives good performance and can be implemented without any modification of existing binary programs. Dynamic branch prediction predicts the outcome of a conditional branch instruction using branch history information collected at run-time and allows instructions from predicted path to be executed speculatively while the conditional branch instruction is being resolved. If a misprediction occurs, the speculatively executed instructions are thrown away and instruction fetch restarts from the correct path. Modern superscalar processors tend to have wider issue width and deeper pipeline depth to exploit more and more of the instruction level parallelism (ILP). In these superscalar processors, the performance degradation due to a misprediction becomes more severe, since the amount of speculative work that must be thrown away in the event of a misprediction increases significantly as the issue width and the pipeline depth increase. Therefore, wide-issue, deeply-pipelined modern superscalar processors require very accurate branch prediction to fully exploit their potential performance. Two-level branch predictors, introduced by Yeh & Patt in 1991, are generally considered to be good solutions to achieve the desired high prediction accuracy. Actually, novel variations of two-level branch predictors have been adopted by various commercial microprocessors, such as Intel Pentium-Pro and DEC Alpha 21264. Two-level branch predictors can be classified broadly as either global history-based branch predictors or self...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectspeculative execution-
dc.subjectbranch correlation-
dc.subjectbranch prediction-
dc.subjectsuperscalar-
dc.subject슈퍼스칼라-
dc.subject예측 수행-
dc.subject분기 명령어 상호관계-
dc.subject분기 예측-
dc.titleBranch prediction using branch correlation in self history-based branch predictors-
dc.title.alternative자신역사 기반 분기 예측기에서 분기 명령어 상호관계를 이용한 분기 예측-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN165634/325007-
dc.description.department한국과학기술원 : 전산학전공, -
dc.identifier.uid000935006-
dc.contributor.localauthorCho, Jung-Wan-
dc.contributor.localauthor조정완-
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0