多进程共享的高效哈希表  

Efficient hash table supporting multi-process sharing

作　　者：张伟[1] 许海洋[2] 周百顺[1] ZHANG Wei XU Hai-yang ZHOU Bai-shun(Computer Application Teaching and Research Section, China Institute of Industrial Relations, Beijing 100048, China College of Science and Information, Qingdao Agricultural University, Qingdao 266109, China)

机构地区：[1]中国劳动关系学院计算机应用教研室,北京100048 [2]青岛农业大学理学与信息学院,山东青岛266109

出　　处：《计算机工程与设计》2017年第5期1190-1195,共6页Computer Engineering and Design

基　　金：国家自然科学基金青年科学基金项目(61403223);中央高校基本科研业务费专项基金项目(13YQ010)

摘　　要：为有效存储和处理海量网络报文,设计一种支持多进程共享的高效哈希表。结合开地址法的思想,对链式哈希表进行改进,设计一种既具有灵活处理哈希冲突和占用内存小的优点,又能够进行快速查询和插入操作的哈希表。为实现进程间数据的共享,设计一种高效的内存管理算法处理哈希表申请和释放共享内存的问题。实验结果表明,与标准内存管理库算法相比,所提内存管理算法提高了内存申请和释放的速度,改进的哈希表在哈希冲突较低和较高时,可以保持快速稳定的查找和插入速度。To effectively store and process massive network packets, an efficient hash table supporting multi-process sharing was designed. Combined with the idea of open address,the chain hash table was improved. The hash table which not only had the advantages of flexible handling of hash collision and using less memory, but also could quickly query and insert operation was de-signed. To realize the sharing of data between processes, an efficient memory management algorithm was designed to deal with the problem of hash table application and the release of shared memory. Experimental results show that compared with the standard memory management algorithm, the proposed memory management algorithm improves the speed of applying and relea-sing memory. The improved hash table can maintain both fast and stable query and insertion speed when the hash collision is low and high.

关 键 词：哈希 链地址法 共享内存 装载因子 缓存 分布式拒绝服务 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]