一種基于訪問趨勢的數(shù)據(jù)網(wǎng)格動態(tài)副本創(chuàng)建策略
發(fā)布時間:2019-06-27 17:53
【摘要】:當(dāng)前的副本創(chuàng)建策略在選取熱點數(shù)據(jù)時往往沒有對訪問突變做出反應(yīng),造成副本頻繁創(chuàng)建和刪除的網(wǎng)格動蕩.針對上述情況,本文引入文件訪問趨勢的概念,提出一種基于訪問趨勢的數(shù)據(jù)網(wǎng)格動態(tài)副本創(chuàng)建策略(ADRS),ADRS根據(jù)歷史數(shù)據(jù)訪問情況計算出文件的訪問趨勢,然后根據(jù)文件的訪問趨勢決定數(shù)據(jù)副本的創(chuàng)建和刪除.仿真結(jié)果表明,在隨機訪問模式下,對比最近訪問最大權(quán)重算法(LALW),ADRS能有效地降低數(shù)據(jù)副本的創(chuàng)建次數(shù),提高網(wǎng)格副本利用率并且在節(jié)點空間有限的情況下不會影響網(wǎng)格的效率.
[Abstract]:The current replica creation strategy often does not respond to the access mutation when selecting hot data, resulting in grid turbulence where copies are created and deleted frequently. In view of the above situation, this paper introduces the concept of file access trend, and proposes a dynamic replica creation strategy for data grid based on access trend. (ADRS), ADRS calculates the access trend of the file according to the historical data access situation, and then determines the creation and deletion of the data copy according to the access trend of the file. The simulation results show that compared with the recent access maximum weight algorithm (LALW), ADRS, the simulation results show that the creation times of data replicas can be effectively reduced, the utilization of grid replicas can be improved, and the grid efficiency will not be affected when the node space is limited.
【作者單位】: 四川大學(xué)計算機學(xué)院;攀枝花學(xué)院數(shù)學(xué)與計算機學(xué)院;
【基金】:教育部重大項目培育基金(708075) 國家自然科學(xué)基金(61173159)
【分類號】:TP393.01
[Abstract]:The current replica creation strategy often does not respond to the access mutation when selecting hot data, resulting in grid turbulence where copies are created and deleted frequently. In view of the above situation, this paper introduces the concept of file access trend, and proposes a dynamic replica creation strategy for data grid based on access trend. (ADRS), ADRS calculates the access trend of the file according to the historical data access situation, and then determines the creation and deletion of the data copy according to the access trend of the file. The simulation results show that compared with the recent access maximum weight algorithm (LALW), ADRS, the simulation results show that the creation times of data replicas can be effectively reduced, the utilization of grid replicas can be improved, and the grid efficiency will not be affected when the node space is limited.
【作者單位】: 四川大學(xué)計算機學(xué)院;攀枝花學(xué)院數(shù)學(xué)與計算機學(xué)院;
【基金】:教育部重大項目培育基金(708075) 國家自然科學(xué)基金(61173159)
【分類號】:TP393.01
【參考文獻】
相關(guān)期刊論文 前2條
1 亓雪冬;李霞;梁鴻;邢常振;仝兆岐;;一種新型的數(shù)據(jù)網(wǎng)格動態(tài)副本策略(英文)[J];北京交通大學(xué)學(xué)報;2008年06期
2 孫海燕,王曉東,周斌,賈焰,王懷民,鄒鵬;基于存儲聯(lián)盟的雙層動態(tài)副本創(chuàng)建策略—SADDRES[J];電子學(xué)報;2005年07期
【共引文獻】
相關(guān)期刊論文 前10條
1 蔣硯軍;馬華東;張海e,
本文編號:2507010
本文鏈接:http://sikaile.net/guanlilunwen/ydhl/2507010.html
最近更新
教材專著