Disk scheduling for mixed-media workloads in a multimedia server
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Architectural considerations for next generation file systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Providing QoS guarantees for disk I/O
Multimedia Systems
SMDP: minimizing buffer requirements for continuous media servers
Multimedia Systems
Mitigating impact of starting new session in zoned disk
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
A heuristic-based real-time disk scheduling algorithm for mixed-media workload
IMSA'06 Proceedings of the 24th IASTED international conference on Internet and multimedia systems and applications
Adaptive cycle management in soft real-time disk retrieval
Information Systems
HERMES: embedded file system design for A/V application
Multimedia Tools and Applications
G-SCAN: a novel real-time disk scheduling using grouping and branch-and-bound strategy
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Apollon: file system level support for qos augmented i/o
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
| Hi-index | 0.00 |
Handling mixed workload in streaming server becomes important issue as integrated file system gets momentum as the choice for next generation file system. In this article, we present novel approach of handling sporadically arriving non-playback related disk request while minimizing its interference with the timely retrieval of data blocks for ongoing playbacks. The main idea of our approach is to extend the length of period in period based disk scheduling in multi-media streaming and subsequently a certain fraction of each period can be set aside for handling unexpected I/O request. We develop the analytical model to establish the relationship between the length of period, request arrival rate, request service time, and P(jitter). This model is used to precisely compute the length of period and the respective buffer size. We present the result of simulation based experiment.