id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_5skuz4byfra4hjw2nr3q35de7u	Liu Pingping	Research on Optimization of memory pool management for high concurrent service requests	2017	11	.pdf	application/pdf	4244	347	69	compared with the default system memory allocator, the efficiency of the Recoverable Fixed Length Keywords: High Concurrency, search engine, memory pool, distributor use the New and Delete functions for the allocation and release of each node of the hash table, and the the present search engine system, and the allocation and release of memory of each node in the Map is managed by the distributor in the STL, take over the fixed node memory allocation and release by itself, After analysis, the search engine return the result sat the same time, memory is frequently allocated, the Based on this scene design allocate not free memory pool. Recoverable Fixed Length Memory Pool is Small object distributor, it divided into 4 layers structure. of New/Delete and the memory pool interface function of Allocate/Deallocate. 4.3 Performance test and analysis of allocate not free memory pool	./cache/work_5skuz4byfra4hjw2nr3q35de7u.pdf	./txt/work_5skuz4byfra4hjw2nr3q35de7u.txt