基于頻繁序列挖掘的預(yù)取算法研究與實(shí)現(xiàn)
發(fā)布時(shí)間:2018-05-23 15:15
本文選題:頻繁序列挖掘 + 預(yù)取算法 ; 參考:《計(jì)算機(jī)研究與發(fā)展》2016年02期
【摘要】:預(yù)取作為一種提升存儲(chǔ)系統(tǒng)性能的有效手段被廣泛使用,然而傳統(tǒng)的預(yù)取算法大多基于順序性訪問特征的探測(cè),這使得它們?cè)诜琼樞驍?shù)據(jù)訪問環(huán)境下很難奏效,甚至可能因?yàn)轭A(yù)取準(zhǔn)確率較低而對(duì)存儲(chǔ)系統(tǒng)的性能帶來負(fù)面影響.而基于頻繁序列挖掘的預(yù)取算法則能夠通過分析數(shù)據(jù)的訪問行為找出潛在規(guī)律,從而能在非順序訪問模式下也取得一定的性能提升.同時(shí),為了應(yīng)對(duì)某些緩存受限的應(yīng)用場(chǎng)景,如嵌入式系統(tǒng),預(yù)取算法通過提高分析的準(zhǔn)確率減少預(yù)取可能對(duì)緩存帶來的不利影響.新提出的預(yù)取算法基于頻繁序列挖掘技術(shù),并使用字典樹組織預(yù)取規(guī)則,通過多步匹配和子樹分割技術(shù)精細(xì)地控制規(guī)則的使用,提升預(yù)取的準(zhǔn)確率,從而使得預(yù)取算法能夠有效提升存儲(chǔ)系統(tǒng)的性能.
[Abstract]:Prefetching is widely used as an effective means to improve the performance of storage systems. However, traditional prefetching algorithms are mostly based on sequential access feature detection, which makes it difficult for them to work in non-sequential data access environments. It may even have a negative impact on storage system performance because of low prefetching accuracy. The prefetching algorithm based on frequent sequence mining can find out the potential rules by analyzing the access behavior of data, which can also improve the performance in non-sequential access mode. At the same time, in order to deal with some application scenarios with limited cache, such as embedded system, prefetching algorithm can reduce the adverse effect of prefetching on cache by improving the accuracy of analysis. The proposed prefetching algorithm is based on frequent sequence mining technology, and uses dictionary tree to organize prefetching rules. The rules are carefully controlled by multi-step matching and sub-tree segmentation techniques to improve the accuracy of prefetching. Thus the prefetching algorithm can effectively improve the performance of the storage system.
【作者單位】: 武漢光電國(guó)家實(shí)驗(yàn)室(華中科技大學(xué));華中科技大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】:國(guó)家“八六三”高技術(shù)研究發(fā)展計(jì)劃基金項(xiàng)目(2013AA013203) 華中科技大學(xué)自主創(chuàng)新研究基金項(xiàng)目(2014QN010)~~
【分類號(hào)】:TP311.13
【相似文獻(xiàn)】
相關(guān)期刊論文 前5條
1 潘志華;張濤;;Linux預(yù)取算法分析與研究[J];計(jì)算機(jī)技術(shù)與發(fā)展;2009年12期
2 姚維;;Linux下一種磁盤節(jié)能的預(yù)取算法[J];計(jì)算機(jī)系統(tǒng)應(yīng)用;2010年07期
3 阮俊波,金惠華;基于實(shí)時(shí)多媒體流的預(yù)取算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2004年02期
4 吳峰光;奚宏生;徐陳鋒;;一種支持并發(fā)訪問流的文件預(yù)取算法[J];軟件學(xué)報(bào);2010年08期
5 ;[J];;年期
相關(guān)博士學(xué)位論文 前1條
1 吳峰光;Linux內(nèi)核中的預(yù)取算法[D];中國(guó)科學(xué)技術(shù)大學(xué);2008年
,本文編號(hào):1925291
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/1925291.html
最近更新
教材專著