A heap dynamic memory management method based on Multi-Hash table
Sun Ling-yu · 2003
In this paper,we present a heap dynamic memory management method based on mul-ti-hash table.The fundamental idea of the great efficient heap dynamic memory management is mak-ing use of the quick search ability of hash table.It looks up the hash table,which uses the size of idle block as the keyword,to realize the optimal most-matched allocate strategy.While it looks up the double hash table,which uses head address and tail address of idle block as the keyword,to solve the question of crunode combination in recollecting idle block.As a conclusion,we give the imple-mentation of the method in Windows OS and Visual C++.