本文選題：高并發(fā) + 搜索引擎�。� 參考：《西安工業(yè)大學(xué)學(xué)報(bào)》2016年03期

【摘要】：為了在輸入關(guān)鍵詞后能從網(wǎng)絡(luò)搜索中快速、準(zhǔn)確地返回信息,并有效降低搜索系統(tǒng)在高并發(fā)狀態(tài)下頻繁分配和回收內(nèi)存對(duì)程序性能的影響.文中根據(jù)搜索引擎中不同的場(chǎng)景,設(shè)計(jì)出了可回收定長(zhǎng)內(nèi)存池,可回收變長(zhǎng)內(nèi)存池和只分配不釋放內(nèi)存池.實(shí)例計(jì)算結(jié)果表明:與系統(tǒng)默認(rèn)的內(nèi)存分配器對(duì)比,可回收定長(zhǎng)內(nèi)存池的效率提升了70.20%;可回收變長(zhǎng)內(nèi)存池的效率提升了13.84%;只分配不釋放內(nèi)存池的效率提升了90.80%.
[Abstract]:In order to return the information quickly and accurately from the network search after input key words, and effectively reduce the impact of frequent allocation and recovery of memory on the program performance in the high concurrency state of the search system. According to the different scenarios of search engine, this paper designs a reclaimed fixed-length memory pool, a variable length memory pool and a non-releasing memory pool. The calculation results show that compared with the system default memory allocator, the efficiency of recoverable fixed length memory pool is increased by 70.20, the efficiency of recyclable variable length memory pool is increased by 13.84, and the efficiency of allocating and not releasing memory pool is increased by 90.80.
【作者單位】： 西安工業(yè)大學(xué)計(jì)算機(jī)科學(xué)與工程學(xué)院;
【基金】：陜西省科技廳項(xiàng)目資助(2013K13-04-07) 陜西省教育廳自然科學(xué)專項(xiàng)(2013JK1158)
【分類號(hào)】：TP391.3

【相似文獻(xiàn)】

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

1 郭丙軒;張京莉;張志超;;基于內(nèi)存池的空間數(shù)據(jù)調(diào)度算法[J];計(jì)算機(jī)工程;2008年06期

2 吳捷;陶志榮;;一種自適應(yīng)變長(zhǎng)塊內(nèi)存池SVBSMP[J];計(jì)算機(jī)應(yīng)用;2008年S1期

3 許健;于鴻洋;;一種Linux多線程應(yīng)用下內(nèi)存池的設(shè)計(jì)與實(shí)現(xiàn)[J];電子技術(shù)應(yīng)用;2012年11期

4 王小銀;陳莉君;;Linux內(nèi)核中內(nèi)存池的實(shí)現(xiàn)及應(yīng)用[J];西安郵電學(xué)院學(xué)報(bào);2011年04期

5 ;[J];;年期

，

本文編號(hào)：1876709