By Topic

Analysis on disk scheduling for special user functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ng, K.W. ; Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong ; Yeung, K.A.

Previous studies on disk scheduling for video services were usually based on computer simulation. We present analysis on disk scheduling for video services. This paper first gives a short review on the various disk scheduling algorithms. It then concentrates on the analysis of two major disk scheduling algorithms, namely, CLOOK and LOOK. The purpose of the analysis is to obtain the maximum number of simultaneous users supported by systems using these two algorithms. The results of the analysis show that the CLOOK algorithm performs slightly better than LOOK algorithm in video applications. Then, this paper discusses disk scheduling for supporting special user functions such as “forward search” and “reverse search”. It is shown that the maximum number of user streams supported drops dramatically when such user functions are used. A technique called redundancy for special user functions (RESUF) is then studied. Analysis of the technique shows that it can keep the I/O demands to almost constant under all user request conditions

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:9 ,  Issue: 5 )