Professional Documents
Culture Documents
Real-Time Parallel Disk Scheduling For VBR Video Servers
Real-Time Parallel Disk Scheduling For VBR Video Servers
its IO End coincides with the IO Start of the next pressed video traces described in [7]. The frame
block to be fetched from that disk. Finally RT- rate for these traces is 24 fps and each trace con-
OPT checks for buffer violations in the sched- tains 40000 frames. Using data on the coded
ule. At any time the total number of blocks be- frame sizes for each of the video sequences, we
ing fetched or which are in the server buffer can- created CDL blocks of 64 Kbytes from 5 rep-
not exceed , the size of the server buffer. The resentative streams: Bond, Terminator, Lambs,
blocks are scanned in increasing order of time, Dino and Starwars. The blocks were then striped
and blocks whose I/O initiation would violate the across the disks in a round-robin fashion. To
buffer constraint are dropped. model the probabilistic access structure of clients
The pseudo-code for algorithm RT-OPT is we used the Zipf distribution, with a skewness
shown in Figure 1. In the description, StartPB(b) factor of 0.271. Clients were assumed to access
denotes the playback start time PB Start for the chosen clip from a random starting frame;
block b; similarly StartIO(b) and EndIO(b) de- wrapping around when the end of a stream is
note IO Start and IO End times for block b. At reached. The results reported correspond to
any time let ! represent the set of idle disks, accesses to 50000 blocks. We assumed EDF
and
"# $! $%, where # is the scheduling at individual disks, and I/O times uni-
number of free blocks in the server buffer. Let formly distributed between 16 and 44ms. In all
be a set of blocks, from idle disks, with the cases averaged results over several Monte Carlo
earliest I/O start time among all blocks from that trials are reported.
disk satisfying &
'
. We first consider the case in which all blocks
RT-OPT’s policy of fetching blocks as late as are required to meet their deadlines and measure
possible minimizes the buffer occupancy of each the number of clients that can be supported. Fig-
block and consequently the probability of buffer ure 2 shows the the number of clients serviced
overflow for a given buffer size. Using this we versus buffer size for 64 disks. RT-OPT does sub-
can formally prove that RT-OPT is optimal in stantially better than GREED-EDF over a wode
the sense that if it drops some blocks then every range of buffer sizes. Similar trends were ob-
other algorithm must also drop at least one block served with smaller number of disks.
for the same data placement, buffer size and sin- The scalability of the algorithms RT-OPT and
gle disk-head scheduling policy. As an admission GREED-EDF with number of disks is illustrated
control method RT-OPT can determine whether a in Figure 3. The scalability of RT-OPT is bet-
client can be admitted by checking if a schedule ter than that of GREED-EDF, and close to lin-
exists in which each block meets its deadline. ear at all buffer sizes: M = 32, 64, 128 and 256.
For brevity only results with M =256 are shown
4 Simulations in the figure. The performance of GREED-EDF
saturates quickly; that is, GREED-EDF requires
The performance of RT-OPT was evaluated us- a much larger amount of buffer to exploit the
ing a trace-driven simulator based on our real- available disk bandwidth. In contrast RT-OPT
time model. We used public-domain MPEG com- supports a substantially larger number of clients
3500
Greedy
RT−OPT
D=64
5 Conclusions
3000
2500
We introduced a framework for incorporating
real-time constraints on block accesses in a par-
Number of Users Allowed allel I/O system. The framework was used to de-
2000
1500
sign prefetching and scheduling algorithms for
1000
real-time playback of multiple video streams in
500
a multiple-disk, parallel-I/O-based video server.
We introduced a scheduling algorithm RT-OPT
0
0 50 100 150
Buffer Size
200 250 300 for prefetching blocks into the server buffer. RT-
OPT is shown to be optimal, in the sense that
Figure 2: Clients Serviced vs. Buffer Size if it drops a block then there exists no schedule
in which all blocks meet their deadline. Using
traces from MPEG compressed video clips we em-
pirically observed the performance of RT-OPT. By
with modest buffer requirements. dynamically multiplexing the buffer among dif-
M=256
ferent clients and disks optimally, RT-OPT was
3500
Greedy
shown to be highly scalable with the number of
3000
RT−OPT
disks with only modest buffer requirements. The
number of clients supported was shown to be su-
2500
perior to intuitive but suboptimal algorithms like
Number of users allowed
500
References
0
0 10 20 30 40 50 60 70
[1]E. W. Biersack, F. Thiesse, and C. Bernhardt. Con-
Number of disks
stant Data Length Retrieval for Video Servers with
Variable Bit Rate Streams. In Proc. of Conf. on
Figure 3: Scalability with number of disks Multimedia, pp 151–155, 1996.
[2]Ed Chang and A. Zakhor. Admission Control and
Finally in Figure 4 the two algorithms are com- Data Placement for VBR Video Servers. In Proc. of
pared by determining the number of clients that Intl. Conf. on Image Processing, pp 316–329, 1994.
can be supported with a given block dropping
[3]C. .S Freedman and D. .J DeWitt. The SPIFFI Scal-
probability. The maximum drop rate permitted
able Video-on-Demand System. In Proc. of SIG-
was fixed at 2%, and M was fixed at 256. For MOD’95, pp 352–363, 1995.
brevity only results for 64 disks are presented,
[4]M. Kallahalla and P. Varman. Optimal Read-Once
the trend is similar for 8, 16 or 32 disks also.
Parallel Disk Scheduling. In Proc. of ACM Wkshp.
RT-OPT can support substantially more number
on I/O in Parallel and Distributed Systems, 1999.
of clients at a given drop probability. The im-
provement was noticed to be greatest with larger [5]B. Ozden R. Rastogi and A. Silberschatz. Demand
Paging for Video-on-Demand Servers. In Intl. Conf.
number of disks when the need for efficient buffer
on Multimedia Computing and Systems, pp 264–
management becomes more important.
272, 1995.
3500
D = 64 [6]A. L. N. Reddy and J. C. Wyllie. I/O issues in a
Multimedia System. Computer, 27(3):69–74, 1994.
3000 [7]O. Rose. Statistical Properties of MPEG Video
Traffic and their Impact on Traffic Modelling in
2500
ATM Systems. Research Report Series 101, Uni-
Number of users
Greedy
[8]P. S. Yu, M-S. Chen, and D. D. Kandlur. Grouped
1000
RT−OPT
Sweeping Scheduling for DASD-based Multime-
0 0.002 0.004 0.006 0.008 0.01 0.012 0.014 0.016 0.018 0.02
Drop probability
dia Storage Management. Multimedia Systems,
1(1):99–109, 1993.
Figure 4: Clients Serviced vs. Drop Probability