臺灣大學: 資訊網路與多媒體研究所劉邦鋒林志庭Lin, Chih-TingChih-TingLin2013-03-222018-07-052013-03-222018-07-052010http://ntur.lib.ntu.edu.tw//handle/246246/251380我們針對了兩個十分有效率的元數據管理方法提出了一種選擇準則,這兩種元數據管理方法分別為單純式布隆過濾器與階層式布隆過濾器。我們提出的選擇準則可以幫助我們知道對於不同種類的檔案存取形式,哪一種元數據管理方法可以有較好的效能表現。我們提出的選擇準則除了分析兩種方法個別的理論效能表現,並且將我們分析的理論效能表現與實際的檔案系統效能做比較。我們利用模擬的方式測量真實檔案系統效能,由其所測量的結果顯示,我們對於兩種元數據管理方法的理論效能分析,都與真實的分散式系統效能十分相近。We propose a selection criteria of two efficient distributed metadata management schemes, pure Bloom filter arrays and hierarchical Bloom filter arrays. The selection criteria helps us to know which metadata management scheme can have better performance for the different file access patterns. The selection criteria not only analyzes the theoretical performance for both metadata management schemes, but also compares the theoretical results with the real file system workload. The simulation results indicate that our theoretical analysis results are close to the real distributed system performance.388936 bytesapplication/pdfen-US元數據管理布隆過濾器分散式檔案系統效能分析選擇準則Metadata managamentBloom filterdistributed file systemsperformance analysisselection criteria階層式布隆過濾器之敏感性分析Sensitivity Analysis of Hierarchical Bloom Filter Arraysthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/251380/1/ntu-99-R97944021-1.pdf