天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當(dāng)前位置:主頁 > 科技論文 > 計算機論文 >

分布式緩存系統(tǒng)的內(nèi)存利用率和并發(fā)性能優(yōu)化機制

發(fā)布時間:2018-02-09 06:47

  本文關(guān)鍵詞: 分布式緩存系統(tǒng) 內(nèi)存利用率 并發(fā)性能 布谷鳥哈希 樂觀并發(fā)控制 出處:《華中科技大學(xué)》2013年碩士論文 論文類型:學(xué)位論文


【摘要】:Memcached是一個高性能的分布式內(nèi)存對象緩存系統(tǒng),它通過在內(nèi)存中緩存對象來減少讀取數(shù)據(jù)庫的次數(shù),提高數(shù)據(jù)庫讀寫速度。隨著web應(yīng)用的高速發(fā)展,Memcached在緩存領(lǐng)域發(fā)揮越來越重要的作用,對Memcached內(nèi)存利用率和并發(fā)性能的要求也越來越高,尋求同時滿足應(yīng)用服務(wù)和性能需求的優(yōu)化機制,是目前亟待解決的問題。 結(jié)合對Memcached工作負載特征分析,和不同系統(tǒng)內(nèi)存利用率和并發(fā)機制的分析對比,,以偏重小對象鍵值存儲和讀操作為主的工作負載,難以兼顧內(nèi)存利用率和高并發(fā)請求。據(jù)此提出了相應(yīng)的解決方案:優(yōu)化布谷鳥哈希算法,用其取代系統(tǒng)中默認的開鏈哈希算法,實現(xiàn)哈希表高占用,從而提高Memcached內(nèi)存利用率;優(yōu)化哈希表查詢插入算法,基于標記值的查詢和插入保持哈希表操作的緩存友好性,實現(xiàn)對哈希表的多讀單寫并發(fā)訪問;基于計數(shù)器的樂觀并發(fā)控制采用版本計數(shù)器來替換原系統(tǒng)全局鎖,通過版本號的改變發(fā)現(xiàn)并發(fā)的替換操作,減小內(nèi)部線程同步,確保數(shù)據(jù)一致性,允許大量并發(fā)訪問,降低插入查詢開銷。 基于Linux操作平臺和cpu密集型計算,實現(xiàn)了Memcached的內(nèi)存利用率和并發(fā)性能優(yōu)化,在維持了內(nèi)存高效率的前提下,提高了Memcached多讀單寫的高并發(fā)訪問。系統(tǒng)測試采用符合zipf分布的測試數(shù)據(jù)集,存儲相同記錄,優(yōu)化后的系統(tǒng)內(nèi)存占用比原系統(tǒng)內(nèi)存占用率減小20%;客戶端請求讀寫高并發(fā)時,優(yōu)化后的系統(tǒng)相較原系統(tǒng),吞吐量至少提高2倍。
[Abstract]:Memcached is a high-performance distributed memory object caching system that reduces the number of database reads by caching objects in memory. With the rapid development of web applications, Memcached plays a more and more important role in the field of cache, and demands more and more high memory utilization and concurrent performance of Memcached. It is an urgent problem to seek optimization mechanism to meet both application service and performance requirements. Combining the characteristic analysis of Memcached workload, comparing with the memory utilization and concurrency mechanism of different systems, the workload, which is mainly focused on small object key value storage and read operation, is analyzed and compared with different system memory utilization and concurrency mechanism. It is difficult to take account of memory utilization and high concurrent request. Based on this, the corresponding solutions are put forward: optimizing the cuckoo hashing algorithm, replacing the default open-chain hash algorithm in the system to achieve high hash table occupancy, thus improving the Memcached memory utilization rate; The algorithm of hash table query insertion is optimized, and the cache friendliness of hash table operation is maintained based on the query and insert of tag value, and the multiple read single write concurrent access to hash table is realized. Optimistic concurrency control based on counter uses version counter to replace the global lock of original system, finds concurrent replacement operation by changing version number, reduces internal thread synchronization, ensures data consistency, and allows a large number of concurrent access. Reduce insert query overhead. Based on Linux operating platform and cpu intensive computing, the memory utilization and concurrency performance of Memcached are optimized, and the high memory efficiency is maintained. The system test adopts the test data set that accords with the zipf distribution, stores the same record, the optimized system memory occupation reduces 20% compared with the original system memory occupation, when the client requests the reading and writing high concurrency, the system test adopts the test data set which conforms to the zipf distribution, and stores the same record, the optimized system memory occupation reduces 20% compared with the original system memory occupation. The throughput of the optimized system is at least 2 times higher than that of the original system.
【學(xué)位授予單位】:華中科技大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2013
【分類號】:TP333.1

【參考文獻】

相關(guān)期刊論文 前1條

1 楊艷;李煒;王純;;內(nèi)存數(shù)據(jù)庫在高速緩存方面的應(yīng)用[J];現(xiàn)代電信科技;2011年12期



本文編號:1497329

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/1497329.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶1b57f***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com