Research on Optimization of memory pool management for high concurrent service requests

Publications

Share / Export Citation / Email / Print / Text size:

International Journal of Advanced Network, Monitoring and Controls

Xi'an Technological University

Subject: Computer Science, Software Engineering

GET ALERTS

eISSN: 2470-8038

DESCRIPTION

0
Reader(s)
0
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 2 , ISSUE 2 (June 2017) > List of articles

Research on Optimization of memory pool management for high concurrent service requests

Liu Pingping / Lu Zhaopan

Keywords : High Concurrency, search engine, memory pool, distributor

Citation Information : International Journal of Advanced Network, Monitoring and Controls. Volume 2, Issue 2, Pages 68-78, DOI: https://doi.org/10.21307/ijanmc-2017-011

License : (CC BY-NC-ND 4.0)

Published Online: 08-April-2018

ARTICLE

ABSTRACT

In order to quickly and accurately return the information to the user after the keyword are entered, and to effectively reduce the effect on the performance of the program when the search system allocates and deal locates memory frequently under the high concurrency, the Recoverable Fixed Length Memory Pool, Recoverable Variable Length Memory Pool and Allocate Not Free Memory Pool were designed. According to the different scenes features of the search engine. The result shows that, compared with the default system memory allocator, the efficiency of the Recoverable Fixed Length Memory Pool is increased by 70.20% ,the efficiency of the Recoverable Variable Length Memory Pool is increased by 13.84% and the efficiency of the Allocate Not Free Memory Pool is increased by 90.80%.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

DAI Chunyan, XU Zhiwen. Discussion About Malloc/Free and New/Delete in C++[J].Science&Technology of Baotou Steel (Group)Corporation, 2009(35):59

 

LI Qian, PAN Minxue, LI Xuandong. Benchmark of Tools for Memory Leak [J]. Journal of Frontiers of Computer Science and Technology.2010(01)29.

 

WANG Xiaoyin, CHEN Lijun. Implementation and Application of the Memory Pool in Linux Kernel [J]. Journal of Xi’an University of Posts and Telecommunications. 2011(04):40.

 

QU Weihua, WANG Qun. Introduce and Analyzing of Search Engine Principle [J]. Computer Knowledgeand Technology. 2006(06):113.

 

DUAN Bingying. Study and Design of Web Crawler in Search Engine [D]. Xidian University. 2014.

 

GUO Bingxuan, ZHANG Jingli, ZHANG Zhichao. Algorithm of Spatial Data Scheduling Based on Memory Pool [J]. Computer Engineering. 2008,34(06):63.

 

LIU Tao, NIE Xiaofeng, JING Jiwu, WANG Yuewu. Memory Management in Worm Simulation based on Small Object Memory Allocation Technique on The GTNetS [J]. Journal of Graduate University of Chinese Academy of Sciences. 2012,29(01):131.

 

GUO Xufeng, YU Fang,LIU Zhongli. An Efficient Memory Built-in Self-Repair Method Based on Hash Table [J]. Acta Electronica Sinica. 2013(07):1371.

 

LAI Xiangfang. Select The Appropriate STL Containers [J]. Digital Technology and Application. 2015(09):177.

 

Alexandrescu A.Modern C ++ design: Generic Programming and Design Patterns Applied [M]. Boston: Addison-Wesley Professional. 2001.

 

Robert W.P.Luka, Wai Lamb. Efficient In-Memory Extensible Inverted File [J]. Information Systems, 2007(32):733.

 

EXTRA FILES

COMMENTS