請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/55930
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 楊佳玲(Chia-Lin Yang) | |
dc.contributor.author | Pin-Chu Chiu | en |
dc.contributor.author | 邱品筑 | zh_TW |
dc.date.accessioned | 2021-06-16T05:11:03Z | - |
dc.date.available | 2019-08-25 | |
dc.date.copyright | 2014-08-25 | |
dc.date.issued | 2014 | |
dc.date.submitted | 2014-08-19 | |
dc.identifier.citation | [1] Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark Manasse,
and Rina Panigrahy. Design tradeoffs for ssd performance. In USENIX 2008 An- nual Technical Conference on Annual Technical Conference, ATC’08, pages 57–70, Berkeley, CA, USA, 2008. USENIX Association. [2] Exchange Trace. Snia iotta repository. [3] Stan Park and Kai Shen. Fios: a fair, efficient flash i/o scheduler. In FAST, page 13, 2012. [4] Jens Axboe. Linux block io—present and future. In Ottawa Linux Symp, pages 51– 61, 2004. [5] John S Bucy, Jiri Schindler, Steven W Schlosser, and Gregory R Ganger. The disksim simulation environment version 4.0 reference manual (cmu-pdl-08-101). Parallel Data Laboratory, page 26, 2008. [6] Richard McDougal. Getting to know the solaris file system, part 1, 1999. [7] Storage Performance Council. Spc i/o traces, 2009. [8] Changwoo Min, Kangnyeon Kim, Hyunjin Cho, Sang-Won Lee, and Young Ik Eom. Sfs: random write considered harmful in solid state drives. In FAST, page 12, 2012. [9] MARCUS PAUL DUNN. A new I/O scheduler for solid state devices. PhD thesis, Texas A&M University, 2009. 32 [10] Hongyan Li, Ping Huang, and Changsheng Xie. Regional scheduler: A region- based high efficient solid state drive scheduler. In Proceedings of the 2012 IEEE 15th International Conference on Computational Science and Engineering, pages 516–523. IEEE Computer Society, 2012. [11] Yang Hu, Hong Jiang, Dan Feng, Lei Tian, Hao Luo, and Shuping Zhang. Perfor- mance impact and interplay of ssd parallelism through advanced commands, alloca- tion strategy and data granularity. In Proceedings of the international conference on Supercomputing, pages 96–107. ACM, 2011. [12] Myoungsoo Jung and Mahmut Kandemir. An evaluation of different page allocation strategies on high-speed ssds. In Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems, pages 9–9. USENIX Association, 2012. [13] Myoungsoo Jung, Ellis H Wilson III, and Mahmut Kandemir. Physically addressed queueing (paq): improving parallelism in solid state disks. In ACM SIGARCH Com- puter Architecture News, volume 40, pages 404–415. IEEE Computer Society, 2012. [14] Eyec Hyun Nam, Bryan Suk Joon Kim, Hyeonsang Eom, and Sang Lyul Min. Ozone (o3): An out-of-order flash memory controller architecture. Computers, IEEE Trans- actions on, 60(5):653–666, 2011. [15] Youyou Lu, Jiwu Shu, Weimin Zheng, et al. Extending the lifetime of flash-based storage through reducing write amplification from file systems. In FAST, pages 257– 270, 2013. [16] Xiangyong Ouyang, David Nellans, Robert Wipfel, David Flynn, and Dha- baleswar K Panda. Beyond block i/o: Rethinking traditional storage primitives. In High Performance Computer Architecture (HPCA), 2011 IEEE 17th International Symposium on, pages 301–311. IEEE, 2011. [17] Youngjae Lee, J Kim, S Lee, and Seungryoul Maeng. Zombie chasing: Efficient flash management considering dirty data in the buffer cache. 2013. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/55930 | - |
dc.description.abstract | 這篇論文提出一個跨層級排程器的設計,在保護公平性的前提下,增進固態硬碟的效能。而因為固態硬碟的架構不同於機械式硬碟,其可藉由利用固態硬碟內部的平行度來實現更好的效能。然而,目前旨在維護公平性之現有排程器中,並沒有考慮到固態硬碟其具有內部平行度的優點,因此沒對於這方面去做優化。因此,在本篇論文中,我們設計一個跨層級排程器以充分發揮固態硬碟其內部平行的特性。當在固態硬碟內部察覺到仍有晶粒處於空閒的狀況時,固態硬碟將會通知上層位於作業系統的 I/O 排程器,告訴其可分配多一點請求至固態硬碟內部。另外,如果 I/O 排程器在為了達到更好的效能,違反公平性原則時,也將通知固態硬碟內部,將此時所事先分配之請求其優先權降低以維持公平性。為了評估我們所設計之跨層級排程器,我們將其實作在 Microsoft Research 所提出的固態硬碟模擬器,並執行合成的工作流以及由 SNIA所發布之真實的工作流。而模擬結果顯示,我們設計的跨層級排程器其效能相較於 FIOS 能提升 11% 且能不失其公平性。 | zh_TW |
dc.description.abstract | This thesis presents a cross-layer scheduler design to not only improve performance but maintain fairness in SSDs. Because the architecture of SSDs is different from that of HDDs, SSDs can achieve higher performance by exploiting internal parallelism. Currently, the existing schedulers aiming to maintain fairness are not aware of the internal parallelism that SSDs have. In this thesis, we develop a cross-layer scheduler design to fully exploit internal parallelism of SSDs. When there is any idle dies in SSDs, SSDs would notify the OS and the OS would then dispatch requests into SSDs. Also, if the OS breaks fairness limitation and dispatch requests into SSDs in advance, it
would send these messages to SSDs and let these requests have lower priority in SSDs to maintain fairness. To evaluate our cross-layer scheduler design, we implement the cross-layer scheduler design in Microsoft Research’s SSD simulator and use synthetic workloads and real-world workloads published by SNIA. Simulation results show that the performance of our cross-layer scheduler design is 11% higher with less loss of fairness on average compared to those of FIOS. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T05:11:03Z (GMT). No. of bitstreams: 1 ntu-103-R01922073-1.pdf: 740533 bytes, checksum: 5432ad319b5d7f1f96434c20b0ac87a0 (MD5) Previous issue date: 2014 | en |
dc.description.tableofcontents | 致謝 i
中文ᄔ要 ii Abstract iii Contents iv List of Figures vi List of Tables vii 1 Introduction 1 2 Background 4 2.1 Basics of NAND Flash Memory Based SSDs . . . . . . . . . . . . . . . 4 2.2 Different Scheduling Layers in SSDs . . . . . . . . . . . . . . . . . . . . 6 3 Motivation 8 4 Cross-Layer Scheduler Design 13 4.1 I/O Scheduler Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.2 SSD Internal Scheduler Design . . . . . . . . . . . . . . . . . . . . . . . 15 4.3 Notification of the Cross-Layer Scheduler . . . . . . . . . . . . . . . . . 16 5 Experimental Setup 20 5.1 Experimental Methodology . . . . . . . . . . . . . . . . . . . . . . . . . 20 iv 5.2 Configuration Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 5.3 Workloads . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.3.1 Synthetic Workload . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.3.2 Real-World Workload with Synthetic Process ID . . . . . . . . . 22 5.3.3 Real-World Workload . . . . . . . . . . . . . . . . . . . . . . . 22 6 Evaluation 24 6.1 Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 6.1.1 Evaluation with Real-World Workload . . . . . . . . . . . . . . . 25 6.2 Fairness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 6.2.1 Evaluation with Real-World Workload . . . . . . . . . . . . . . . 27 7 Related Work 29 8 Conclusion 31 Bibliography 32 | |
dc.language.iso | en | |
dc.title | 考量固態硬碟內部平行度之跨層級公平性 I/O 排程器設計方式 | zh_TW |
dc.title | Fairness-Oriented I/O Scheduler Design Considering SSD Internal Parallelism: A Cross-Layer Approach | en |
dc.type | Thesis | |
dc.date.schoolyear | 102-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 張原豪(Yuan-Hao Chang),謝仁偉(Jen-Wei Hsieh) | |
dc.subject.keyword | 固態硬碟,NAND 型快閃記憶體,公平性,排程器,跨層級, | zh_TW |
dc.subject.keyword | SSD,NAND Flash memory,Fairness,Scheduler,Cross-Layer, | en |
dc.relation.page | 33 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2014-08-19 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-103-1.pdf 目前未授權公開取用 | 723.18 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。