Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jooyoung SON, Yanghee CHOI, "An Efficient Storage Scheme for Multimedia Server*" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 6, pp. 712-718, June 1996, doi: .
Abstract: Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_6_712/_p
Copy
@ARTICLE{e79-d_6_712,
author={Jooyoung SON, Yanghee CHOI, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Storage Scheme for Multimedia Server*},
year={1996},
volume={E79-D},
number={6},
pages={712-718},
abstract={Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - An Efficient Storage Scheme for Multimedia Server*
T2 - IEICE TRANSACTIONS on Information
SP - 712
EP - 718
AU - Jooyoung SON
AU - Yanghee CHOI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1996
AB - Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.
ER -