Dynamic Memory Allocation and Data Sharing Schedule in Media Server

Most of the existing buffer allocation and sharing schemes can not make full use of the system resources while being implemented independently. Here, based on analysis of the existing schemes, we propose a new algorithm, Balanced Buffer Sharing of Limited Resource (BBSLR), which allocates resources for each request according to the available cache and disk bandwidth, and adjusts buffer size according to the current request distribution and available resources dynamically. It does a good job of managing resources to maximize the number of simultaneous clients and enhance start-up delay. With BBSLR, the resources consumption will be balanced by rational allocation of the available resources, the average start-up delay will be reduced by caching the data at start and more clients will be served consequently. These conclusions are proved by comparing with several existing methods experimentally.