博碩士論文 110522015 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:5 、訪客IP:18.222.119.148
姓名 陳昕(Sin Chen)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱
(On Minimizing Writing Overhead to Establish a Low-latency LSM-tree on Skyrmion-based Racetrack Memory)
相關論文
★ 重新思考虛擬記憶體管理的方式以開放通道式固態硬碟最大限度地減少深度學習推薦系統演算法的讀寫流量★ 開啟製程相似檢查方法在組裝超級塊上以最小化額外的寫入延遲
★ LaDy: Enabling Locality-aware Deduplication Technology on Shingled Magnetic Recording Drives★ On Minimizing Writing Overhead to Establish a Low-latency LSM-tree on Skyrmion-based Racetrack Memory
★ WABE: Rethinking B-epsilon-tree to Minimize Write-amplification on NAND Flash Memory★ Rethinking Bϵ tree Indexing Structure over NVM with the Support of Multi-write Modes
★ Prophet’s Insight: Unleashing Deduplication System Performance in Multi-tier Storage Systems★ Freeing the Power of High Parallelism: Accelerating the Bϵ-Tree Indexing Scheme Performance on Open-Channel SSD
★ Applying Content-Defined Chunking to OCSSD-based Deduplication Systems★ GraLoc: Preserving Graph Locality to Minimize Read and Write Amplification on NAND Flash Memory
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 (2026-12-13以後開放)
摘要(中) 隨著對高記憶體密度和快速記憶體讀寫性能的需求不斷增加,斯格明子賽道 式記憶體(Skyrmion Racetrack Memory,SKRM)正逐漸成為替代當前 DRAM 技術在 主記憶體應用中的主要競爭者。然而,斯格明子賽道式記憶體具有一些獨特的特 點,包括其能夠進行元素移位、生成和銷毀的能力,這些特點與傳統的 DRAM 有 很大的不同。如果不重新評估傳統的演算法和資料結構,以使其能夠適應基於斯 格明子(Skyrmion)的主記憶體的獨特性質,則系統性能可能會受到嚴重影響。在 各種演算法中,例如排序、搜索、圖形處理和機器學習等,交換操作都是基本的, 然而,直接應用於基於斯格明子的主記憶體時,會面臨到一些挑戰。傳統的方法 可能會導致高能源消耗,因為需要頻繁地生成斯格明子元素,或者會因經常進行 移位操作而導致系統性能下降。為了應對這些挑戰,我們的研究提出了一種斯格 明子友善的方法,引入了一種適合交換操作的賽道式記憶體架構,以同時降低能 耗和存取延遲。此外,我們將這一解決方案與基於決策樹的機器學習框架結合, 認識到在決策樹構建過程中,交換操作在頻繁執行中的重要作用。我們的實驗結 果令人振奮,結果顯示了能源消耗和存取延遲的減少。
摘要(英) With the demand of the high memory density and fast memory load/store performance, Skyrmion racetrack memory emerges as a leading contender to replace current DRAM technology in main memory applications. However, the distinctive features of skyrmion racetrack memory, including its ability to shift, generate, and destroy skyrmion elements, diverge significantly from traditional DRAM. Without reevaluating conventional algorithms and data structures to align with the unique properties of skyrmion-based main memory, system performance becomes poor. The swapping operation, fundamental in various algorithms like sorting, searching, graph, and machine learning, poses challenges when directly applied to skyrmion-based main memory. The conventional approach can lead to heightened power consumption from frequent skyrmion element creation or suboptimal system performance due to frequent shifting operations. To address this, our paper proposes a skyrmion-friendly approach, introducing a swappingfriendly racetrack memory architecture to concurrently minimize energy consumption and access latency. Furthermore, we integrate this solution with a decision tree-based machine learning framework, recognizing the pivotal role of the swapping process in frequent execution during decision tree construction. Our experiments yield encouraging results, demonstrating reductions in energy consumption and access latency.
關鍵字(中) ★ 斯格明子賽道式記憶體
★ 機器學習
★ 隨機森林
★ 交換演算法
關鍵字(英) ★ Skyrmion Racetrack Memory
★ Machine Learning
★ Random Forest
★ Swapping Algorithm
論文目次 1 Introduction 1

2 Technical Background and Motivation 3
2.1 Skyrmion-based Racetrack Memory 5
2.2 Decision Tree-based Machine Learning 7
2.3 Related Works 8

3 Skyrmion-Friendly Swapping Design 11
3.1 System Overview 11
3.2 Foundational Details for SkySwap 13
3.2.1 Swapping Track 13
3.2.2 Data Scanner and Cache Data 13
3.2.3 Rewrite+ and Swap+ 15
3.2.4 Policy Adjudicator 17
3.2.5 Shift-back Swapping Mechanism 18
3.3 Overhead Analysis 20

4 Evaluations 21
4.1 Experimental Environment 21
4.2 Findings and Results 23
4.2.1 Energy consumption 23
4.2.2 Execution latency 23

5 Concluding Remarks 29

Reference 30
參考文獻 [1] K. Bache and M. Lichman. 2013. UCI Machine Learning Repository. http://archive.ics.uci.edu/ml

[2] P. F. Bessarab, D. Yudin, D. R. Gulevich, P. Wadley, M. Titov, and Oleg A. Tretiakov.2019. Stability and lifetime of antiferromagnetic skyrmions. Phys. Rev. B 99 (Apr2019),140411. Issue
14.https://doi.org/10.1103/PhysRevB.99.140411

[3] Jin-Wei Chang and Tseng-Yi Chen. 2022. When B-Tree Meets Skyrmion Memory:How Skyrmion Memory Affects an Indexing Scheme. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 41, 11 (2022), 3814–3825.https://doi.org/10.1109/TCAD.2022.3197519

[4] Tianqi Chen and Carlos Guestrin. 2016. XGBoost: A Scalable Tree Boosting System. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (San Francisco, California, USA) (KDD’16). Association for Computing Machinery, New York, NY, USA, 785–794. https://doi.org/10.1145/2939672.2939785

[5] Albert Fert, Nicolas Reyren, and Vincent Cros. 2017. Magnetic skyrmions: advances in physics and potential applications. Nature Reviews Materials 2, 7 (2017), 1–15.

[6] Yanhong Gu, Yilin Wang, Jiaqi Lin, Jonathan Pelliciari, Jiemin Li, Myung-Geun Han, Marcus Schmidt, Gabriel Kotliar, Claudio Mazzoli, Mark PM Dean, et al. 2022. Site-specific electronic and magnetic excitations of the skyrmion material
Cu2OSeO3. Communications Physics 5, 1 (2022), 156.

[7] Yun-Shan Hsieh, Po-Chun Huang, Ping-Xiang Chen, Yuan-Hao Chang, Wang
Kang, Ming-Chang Yang, and Wei-Kuan Shih. 2020. Shift Limited Sort: Optimizing Sorting Performance on Skyrmion Memory-Based Systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39, 11 (2020), 4115–4128. https://doi.org/10.1109/TCAD.2020.3012880

[8] Wang Kang, Bi Wu, Xing Chen, Daoqian Zhu, Zhaohao Wang, Xichao Zhang, Yan Zhou, Youguang Zhang, and Weisheng Zhao. 2019. A Comparative Cross-Layer Study on Racetrack Memories: Domain Wall vs Skyrmion. J. Emerg. Technol.Comput. Syst. 16, 1, Article 2 (oct 2019), 17 pages.https://doi.org/10.1145/3333336

[9] Yong-Cheng Liaw, Shuo-Han Chen, Yuan-Hao Chang, and Yu-Pei Liang. 2023.Sky-NN: Enabling Efficient Neural Network Data Processing with Skyrmion Racetrack Memory. In 2023 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED). 1–6.https://doi.org/10.1109/ISLPED58423.2023.10244351

[10] Scott M Lundberg, Gabriel Erion, Hugh Chen, Alex DeGrave, Jordan M Prutkin,Bala Nair, Ronit Katz, Jonathan Himmelfarb, Nisha Bansal, and Su-In Lee. 2020.
From local explanations to global understanding with explainable AI for trees.Nature machine intelligence 2, 1 (2020), 56–67.

[11] Sougata Mallick, Sujit Panigrahy, Gajanan Pradhan, and Stanislas Rohart. 2022.Current-Induced Nucleation and Motion of Skyrmions in Zero Magnetic Field.Phys. Rev. Appl. 18 (Dec 2022), 064072. Issue 6. https://doi.org/10.1103/
PhysRevApplied.18.064072

[12] Zhenyu Sun, Wenqing Wu, and Hai (Helen) Li. 2013. Cross-Layer Racetrack Memory Design for Ultra High Density and Low Power Consumption. In Proceedings of the 50th Annual Design Automation Conference (Austin, Texas) (DAC ’13).
Association for Computing Machinery, New York, NY, USA, Article 53, 6 pages.https://doi.org/10.1145/2463209.2488799

[13] Marvin N. Wright and Andreas Ziegler. 2017. ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R. Journal of Statistical Software 77, 1 (2017), 1–17. https://doi.org/10.18637/jss.v077.i01

[14] Ya-Hui Yang, Shuo-Han Chen, and Yuan-Hao Chang. 2022. Evolving Skyrmion Racetrack Memory as Energy-Efficient Last-Level Cache Devices (ISLPED ’22).Association for Computing Machinery, New York, NY, USA, Article 8, 6 pages.https://doi.org/10.1145/3531437.3539709

[15] Ruifu Zhang, Chunli Tang, Xiaozhen Sun, Mengyuan Li, Wencan Jin, Peng Li,Xiaomin Cheng, and X. Sharon Hu. 2023. Sky-TCAM: Low-Power SkyrmionBased Ternary Content Addressable Memory. IEEE Transactions on Electron Devices 70, 7 (2023), 3517–3522.https://doi.org/10.1109/TED.2023.3274506

[16] Daoqian Zhu, Wang Kang, Sai Li, Yangqi Huang, Xichao Zhang, Yan Zhou, and Weisheng Zhao. 2018. Skyrmion Racetrack Memory With Random Information Update/Deletion/Insertion. IEEE Transactions on Electron Devices 65, 1 (2018), 87–95. https://doi.org/10.1109/TED.2017.2769672
指導教授 陳增益(Tseng-Yi Chen) 審核日期 2023-12-18
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明