AN EFFICIENT STORAGE SCHEME FOR MULTIMEDIA SERVER

Storage system in a multimedia server must satisfy two contradicting r equirements: real-timeliness and large number of parallel user request s. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requiremen ts. In this paper, we propose efficient schemes to maximize system res ource utilization and service availability: cyclic placement scheme, s ubgroup retrieval scheme, and measurement-based request admission cont rol scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.