請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64412
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 廖世偉 | |
dc.contributor.author | Ping-Jung Lu | en |
dc.contributor.author | 呂品融 | zh_TW |
dc.date.accessioned | 2021-06-16T17:45:40Z | - |
dc.date.available | 2012-08-20 | |
dc.date.copyright | 2012-08-20 | |
dc.date.issued | 2012 | |
dc.date.submitted | 2012-08-14 | |
dc.identifier.citation | [1] B. Calder, C. Krintz, S. John, and T. Austin. Cache-conscious data placement. SIG-
PLAN Not., 33(11):139–149, Oct. 1998. [2] M. Franz. Dynamic linking of software components. Sept. 2006. [3] P. B. Gibbons and S. S. Muchnick. Efficient instruction scheduling for a pipelined architecture. SIGPLAN Not., 21(7):11–16, July 1986. [4] N. P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache prefetch buffers. In 25 years of the international symposia on Computer architecture (selected papers), ISCA ’98, pages 388–397, New York, NY, USA, 1998. ACM. [5] R. E. Kessler, R. Jooss, A. Lebeck, and M. D. Hill. Inexpensive implementations of set-associativity. SIGARCH Comput. Archit. News, 17(3):131–139, Apr. 1989. [6] J. R. Levine. Linker and Loader. Morgan-Kauffman, 1999. [7] T. C. Mowry, M. S. Lam, and A. Gupta. Design and evaluation of a compiler algo- rithm for prefetching. SIGPLAN Not., 27(9):62–73, Sept. 1992. [8] L. Tang. Low level virtual machine linker for moblie computing, 2011. 21 [9] I. L. Taylor. A new elf linker. May 2006. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64412 | - |
dc.description.abstract | 現今多數的連結器 (linker) 產生共用目的檔 (dynamic shared object
file) 的時候並沒有考慮到產生的動態重定表 (dynamic relocation list) 其排列順序會影響到所產生出來的共用目的檔 (shared object file) 在被 動態連結器 (dynamic linker) 載入時的效率, 因此其重定的順序還有優化 的可能性,以達到更好的空間區域性 (spatial locality)。 故本論文的主 要貢獻在於: 根據重定地址,符號引索 (symbol index) , 以及重定類 型 (relocation type) 來排序連結器所產生的共用目的檔的重定表,使得 動態連結器在載入共用目的檔的時候, 其重定之效率更高,使得應用 程式之啟動時間縮短。 | zh_TW |
dc.description.abstract | The spatial locality of relocating a dynamic object file by dynamic linker
are poor on most of linkers. The major contribution is we introduce a new optimization algorithm of reordering the dynamic relocations at linking-time when the linkers want to generate a dynamic object file. It can improve the spatial locality and decrease loading time when the dynamic linker loads the dynamic object file. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T17:45:40Z (GMT). No. of bitstreams: 1 ntu-101-R99922138-1.pdf: 888968 bytes, checksum: 5797df8ee429282355d2599319307366 (MD5) Previous issue date: 2012 | en |
dc.description.tableofcontents | 致謝 i
中文摘要 ii Abstract iii 1 Introduction 1 1.1 The Poor Spatial Locality of Applying Relocations . . . . . . . . . . . . 1 1.2 The Frameworks and Background . . . . . . . . . . . . . . . . . . . . . 2 1.3 Reordering of Output Relocations . . . . . . . . . . . . . . . . . . . . . 2 1.4 Weekness of the algorithm provided by GOLD . . . . . . . . . . . . . . 2 2 The Dynamic Relocations 4 2.1 The Process of Generating Dynamic Relocations at Linking . . . . . . . . 4 2.2 The Dynamic Relocations The Process of Applying Relocations by The Dynamic Linker . . . . . . 6 3 Sorting Algorithms 8 3.1 Tradeoff of Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . 8 3.2 Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 GOLD’s Sorting Algorithm . . . . . . . . . . . . . . . . . . . .8 3.2.2 New Sorting Algorithm . . . . . . . . . . . . . . . . . . . . . . .11 4 Experimental Results 12 4.1 Experimental Framework . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 The Launch Time After Reordering The Output Relocations . . . . . . . 12 4.3 Analysis of The Result . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4.3.1 Position Independant Code . . . . . . . . . . . . . . . . . . . . . 13 4.3.2 The Number of Relative Type Relocation . . . . . . . . . . . . . 15 5 Conclusion 18 Bibliography 20 | |
dc.language.iso | en | |
dc.title | 連結時注重快取效率的重定排序 | zh_TW |
dc.title | Cache-conscious Relocation Reordering at Linking | en |
dc.type | Thesis | |
dc.date.schoolyear | 100-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 陳呈瑋,梁伯嵩,陳官辰 | |
dc.subject.keyword | 連結器,動態連結器,共用目的檔,動態重定表,空間區域性,重定類型, | zh_TW |
dc.subject.keyword | dynamic object file,linker,linking,dynamic linker,dynamic relocation,spatial locality, | en |
dc.relation.page | 21 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2012-08-14 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-101-1.pdf 目前未授權公開取用 | 868.13 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。