A statistical admission control algorithm for multimedia servers
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy
Information Processing Letters
On-line extraction of SCSI disk drive parameters
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Stochastic service guarantees for continuous data on multi-zone disks
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
BubbleUp: low latency fast-scan for media servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
A comparative analysis of disk scheduling policies
Communications of the ACM
Graph Algorithms
Storage Allocation Policies for Time-Dependent Multimedia Data
IEEE Transactions on Knowledge and Data Engineering
Deterministic Admission Control Strategies in Video Servers with Variable Bit Rate Streams
IDMS '96 Proceedings of the European Workshop on Interactive Distributed Multimedia Systems and Services
Proceedings of the Third International Workshop on Network and Operating System Support for Digital Audio and Video
New algorithms for the disk scheduling problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Track-Pairing: a Novel Data Layout for VOD Servers with Multi-Zone-Recording Disks
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
Support for continuous media in file servers
Support for continuous media in file servers
Modular and efficient resource management in the exedra media server
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Comparing disk scheduling algorithms for VBR data streams
Computer Communications
IEEE Transactions on Consumer Electronics
IEEE Transactions on Consumer Electronics
| Hi-index | 14.98 |
We derive the guaranteed throughput of a multizone disk that repeatedly handles batches of n requests of constant size. Using this guaranteed throughput in the design of multimedia systems, one can admit more streams or get smaller buffer requirements and guaranteed response times than when an existing lower bound is used. We consider the case that nothing can be assumed about the location of the requests on the disk. Furthermore, we assume that successive batches are handled one after the other, where the n requests in a batch are retrieved using a SCAN-based sweep strategy. We show that we only have to consider two successive batches to determine the guaranteed throughput. Using this, we can compute the guaranteed throughput by determining a maximum-weighted path in a directed acyclic graph in {\cal{O}}(z_{\max}^3 n^2) time, where z_{\max} is the number of zones of the disk.