Binnary buddy algorithm used in dynamic storage management of InnoDB engine in MySQL is analyzed deeply after introducing the basic machanisms of dynamic storage allocation.

Buddy algorithm is one of the classical algorithms for memory management,this paper analyses the characteristics of buddy algorithm based on the Linux memory management and indicates the shortcomings of this algorithm,and discusses some methods for improving the algorithm according to practical conditions and applications in order to make the algorithm more flexible.

The advantage and the disadvantage of buddy algorithm are discussed.

Then it introduces the Buddy system algorithm and Slab allocator that solve the fragment problems in kernel,and discusses the points in realization,especially analyses some m.

In this paper, we make a summarize of the popular Web caching technology through it s sort, performance index, coherency and replacement algorithm.

Study of program replacement algorithm for video server in video on demand system;

In order to improve the hit ratio and byte hit ratio of Web caching, a new replacement algorithm, site-role based (SRB), is proposed after investigating the factors which are related to the replacement operations.

This paper gives a deep research into the key techniques of a caching system, such as information filtering?stale page access and replacement algorithm,and finally presents a cache scheme based on the firewall log with little cost and a reasonable performance.

Central Cache replacement algorithm for storage system;