一種RAID-5快速擴容技術(shù)的研究
發(fā)布時間:2018-01-10 07:06
本文關(guān)鍵詞:一種RAID-5快速擴容技術(shù)的研究 出處:《華中科技大學》2013年碩士論文 論文類型:學位論文
更多相關(guān)文章: 磁盤陣列 在線擴容 最小數(shù)據(jù)遷移量
【摘要】:磁盤陣列技術(shù)通過數(shù)據(jù)分條技術(shù)來提高存儲系統(tǒng)的吞吐率,通過數(shù)據(jù)冗余技術(shù)來提高存儲系統(tǒng)的可靠性。當一個磁盤陣列建立好之后,隨著用戶的使用,可用的空間將會越來越小,這個時候需要進行磁盤陣列的擴容。在擴容的過程中,如果重新建立一個更大的磁盤陣列,將會要數(shù)據(jù)整體遷移,并且遷移的過程中,原來的磁盤陣列是不能被用戶使用的,也就是說存在一個使用的空窗,對于用戶來說是很不方便的。 在使用的過程中,同時向磁盤陣列中加入新的磁盤,并且形成一個新的磁盤陣列,也就是在線擴容方式。在線擴容方式,提供了一種不存在用戶使用空窗的擴容方式,在擴容的過程中,并不影響用戶的正常讀寫請求,并能保證用戶讀寫的正確性。在研究了現(xiàn)有在線擴容算法的基礎(chǔ)上,,提出了一種新的擴容算法,達到了理論上的數(shù)據(jù)遷移量最小值,并且在擴容之后,打破了標準的磁盤陣列數(shù)據(jù)分布方式,采用一種新的數(shù)據(jù)分布方式,保證數(shù)據(jù)遷移最小值的前提下,并不破壞磁盤陣列的可靠性和高性能。 在數(shù)據(jù)遷移過程中,引入了一種速度控制機制,保證了在線擴容過程的合理性。當用戶讀寫請求較多的時候,適當降低擴容的速度,能較快響應來自用戶的請求;當用戶讀寫請求比較少的時候,加快數(shù)據(jù)遷移速度,使擴容能快一點完成。同時,在擴容過程中,維護一個擴容窗口,主要是為了保證用戶讀寫的正確性。根據(jù)用戶讀寫請求位置與擴容窗口的關(guān)系,采用不同方式來處理,保證了擴容之后數(shù)據(jù)正確性。 對實現(xiàn)的擴容算法進行了離線和在線兩種方式的測試。測試結(jié)果表明,新的擴容算法在離線擴容情況下,擴容時間比標準方式加快了很多。在線擴容的情況下,速度控制機制較好的發(fā)揮了作用,用戶的讀寫響應時間比標準方式下要好,同時擴容時間也比標準的要好。對于擴容之后,也進行了讀寫測試,測試結(jié)果表明擴容之后,新的數(shù)據(jù)分布方式的讀寫性能相比標準的并沒有降低。
[Abstract]:Disk array technology improves the throughput of storage system by data striping technology, and improves the reliability of storage system by data redundancy technology. When a disk array is set up, with the use of users. The available space will be smaller and smaller, and this time the disk array will need to be expanded. During the expansion process, if a larger array of disks is re-established, the data will have to be migrated as a whole. In the process of migration, the original disk array can not be used by the user, that is to say, there is an empty window, which is very inconvenient for the user. In the process of using, a new disk array is added to the disk array at the same time, and a new disk array is formed, that is, the online expansion mode. The invention provides a capacity expansion mode in which there is no user using empty windows, and the normal read and write request of the user is not affected during the expansion process. Based on the research of the existing online capacity expansion algorithm, a new expansion algorithm is proposed, which can achieve the minimum data migration in theory, and after the expansion. It breaks the standard data distribution mode of disk array and adopts a new data distribution mode to ensure the minimum data migration without destroying the reliability and high performance of the disk array. In the process of data migration, a speed control mechanism is introduced to ensure the rationality of the online expansion process. Can quickly respond to requests from users; When the user read and write requests are few, accelerate the speed of data migration, so that the expansion can be completed a bit faster. At the same time, in the process of expansion, maintain an expansion window. According to the relationship between the location of the user's read-write request and the expansion window, different ways are adopted to process the data, which ensures the correctness of the data after the expansion. The test results show that the new algorithm is in the case of off-line expansion. The expansion time is much faster than the standard mode. In the case of online capacity expansion, the speed control mechanism plays a better role, and the response time of the user read and write is better than that under the standard mode. At the same time, the expansion time is also better than the standard. After the expansion, the read-write test is also carried out. The test results show that the performance of the new data distribution mode is not lower than the standard after the expansion.
【學位授予單位】:華中科技大學
【學位級別】:碩士
【學位授予年份】:2013
【分類號】:TP333
【參考文獻】
相關(guān)期刊論文 前5條
1 陳凱,白英彩;網(wǎng)絡(luò)存儲技術(shù)及發(fā)展趨勢[J];電子學報;2002年S1期
2 謝長生,王宇德,曹強;進化存儲系統(tǒng)的研究[J];計算機工程;2004年22期
3 韓德志,謝長生,李懷陽;存儲備份技術(shù)探析[J];計算機應用研究;2004年06期
4 金海,張江陵,周欣榮;磁盤陣列技術(shù)及其發(fā)展趨勢[J];微處理機;1995年02期
5 謝長生;董曉明;萬繼光;譚志虎;劉瑞芳;;磁盤陣列控制器的設(shè)計與原型實現(xiàn)[J];小型微型計算機系統(tǒng);2006年01期
本文編號:1404302
本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/1404302.html
最近更新
教材專著