By Topic

Dynamic Memory Allocation and Data Sharing Schedule in Media Server

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kaihui Li ; Chinese Acad. of Sci., Beijing ; Yuanhai Zhang ; Jin Xu ; Changqiao Xu

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.

Published in:

Multimedia and Expo, 2007 IEEE International Conference on

Date of Conference:

2-5 July 2007