帳號:guest(3.142.40.224)          離開系統
字體大小: 字級放大   字級縮小   預設字形  

詳目顯示

以作者查詢圖書館館藏以作者查詢臺灣博碩士論文系統以作者查詢全國書目
作者(中文):簡嘉彣
作者(外文):Chien, Chia Wen
論文名稱(中文):在高階多核心架構的增強值域傳遞技術
論文名稱(外文):Enhanced Value Range Propagation on Advanced Multi-Core Architecture
指導教授(中文):李政崑
指導教授(外文):Lee, Jenq Kuen
口試委員(中文):黃冠寰
陳鵬升
學位類別:碩士
校院名稱:國立清華大學
系所名稱:資訊工程學系
學號:102062570
出版年(民國):104
畢業學年度:104
語文別:英文
中文關鍵詞:值域傳遞技術多核心架構靜態單賦值形式
外文關鍵詞:multi-core architecturevalue range propagationstatic single assignment
相關次數:
  • 推薦推薦:0
  • 點閱點閱:558
  • 評分評分:*****
  • 下載下載:0
  • 收藏收藏:0
值域傳遞技術是一種追蹤變數值域的分析方法。值域傳遞技術類似常數傳遞,差別是他們傳遞的物件不同:常數傳遞傳遞的是常數,而值域傳遞傳遞的是值域。值域傳遞技術是在靜態編譯環境下執行,分析結果包含值域以及值域所含的比例。此分析技術可用來提升預測分支、確認迴圈界限、暫存器配置以及減少ALU計算量。由於提升執行效能的需求日漸增加,多核心架構亦越來越重要。然而,卻還沒有任何關於值域傳遞技術的是在多核心架構上,因此,我們在這篇論文提出了可以使用在高階多核心架構的增強值域傳遞技術。
Value range propagation is a analysis method to track the range of variables in a static single static form program. It is similar to constant propagation, and the difference between them is the item they propagated during execution: constant propagation propagates constants, and value range
propagation propagates value range. Value range propagation analyzes value ranges of variables in a static-single-assignment-form (SSA-form) program, and each range is with its portion. The results of the analysis can be used
to improve some optimizations such as branch prediction, loop bound check, register allocation and ALU computation reduction. With the increasing requirements of execution performance, the multi-core architecture becomes more and more important. However, there has not been a research of multi-core architecture related to value range propagation. Therefore, in this thesis, we propose an algorithm of enhanced value range propagation, which can be used to analyze programs in the multi-core architecture.
Abstract i
Contents ii
List of Figures iv
List of Tables v
1 Introduction 1
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.3 Overview of the Thesis . . . . . . . . . . . . . . . . . . . . . . 4
2 Background 6
2.1 OpenCL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.2 Static Single Assignment Form . . . . . . . . . . . . . . . . . . 8
2.3 Value Range Propagation . . . . . . . . . . . . . . . . . . . . 11
3 Algorithm 15
3.1 Enhanced Value Range Propagation . . . . . . . . . . . . . . . 15
3.2 Detail of the Algorithm . . . . . . . . . . . . . . . . . . . . . . 16
3.2.1 Algorithm of Enhanced Value Range Propagation . . . 16
3.2.2 Algorithm of Value Range Evaluation . . . . . . . . . . 19
3.2.3 Algorithm of Conditional Branch Examination . . . . . 21
3.2.4 Rule of Expressions in Enhanced Value Range Propa-
gation . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.2.5 Algorithm Efficiency . . . . . . . . . . . . . . . . . . . 26
3.3 Evaluation of Samples . . . . . . . . . . . . . . . . . . . . . . 26
3.3.1 Sample 1: With a Branch . . . . . . . . . . . . . . . . 26
3.3.2 Sample 2: With a For-Loop . . . . . . . . . . . . . . . 30
4 Conclusion 33
4.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
4.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
iii
[1] Khronos OpenCL Registry, Khronos OpenCL Working Group. [Online].
Available: https://www.khronos.org/opencl/
[2] W. Harrison, \Compiler analysis of the value ranges for variables," in
Software Engineering, IEEE Transactions. IEEE, 1977, pp. 243{250.
[3] J. R. C. Patterson, \Accurate static branch prediction by value range
propagation," in Proceedings of the ACM SIGPLAN 1995 Conference
on Programming Language Design and Implementation, ser. PLDI '95.
New York, NY, USA: ACM, 1995, pp. 67{78. [Online]. Available:
http://doi.acm.org/10.1145/207110.207117
[4] M. W. Stephenson, \Bitwise: Optimizing bitwidths using data-range
propagation," Master's thesis, Massachusetts Institute of Technology,
2000.
[5] R. Bodk, R. Gupta, and V. Sarkar, \Abcd: Eliminating array
bounds checks on demand," in Proceedings of the ACM SIGPLAN 2000
Conference on Programming Language Design and Implementation, ser.
PLDI '00. New York, NY, USA: ACM, 2000, pp. 321{333. [Online].
Available: http://doi.acm.org/10.1145/349299.349342
[6] R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and
F. K. Zadeck, \Efficiently computing static single assignment form
and the control dependence graph," ACM Trans. Program. Lang.
Syst., vol. 13, no. 4, pp. 451{490, Oct. 1991. [Online]. Available:
http://doi.acm.org/10.1145/115372.115320
[7] S. Collange, D. Defour, and Y. Zhang, \Dynamic detection of uniform
and affine vectors in gpgpu computations," in Proceedings of the
2009 International Conference on Parallel Processing, ser. Euro-Par'09.
Berlin, Heidelberg: Springer-Verlag, 2010, pp. 46{55. [Online]. Available:
http://dl.acm.org/citation.cfm?id=1884795.1884804
[8] The OpenCL Speci cation, Khronos OpenCL Working Group, 2012.
[Online]. Available: http://www.khronos.org/registry/cl/spec/opencl-
1.2.pdf
(此全文未開放授權)
電子全文
摘要
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
* *