| Summary: | 碩士 === 國立成功大學 === 工程科學系 === 84 === Advances in technology of hard disk have much improvement in
storage capacity, seek time, and disk transfer rate. In recent
years, hard disksare designed with disk zoning technique which
partitions a hard disk toseveral zones. Under the technique,
every track in the same zone has the samenumber of sectors. The
technique not only promote the storage capacity, butalso makes
different zones have different disk transfer rate - outer
zoneshave higher disk transfer rate. However most studies of
video servers did not take the advantages of diskzoning to
design the video server. To quarantee video data retrieval,
those studies use the disk transfer rate of inmost zone of disk
to schedule thevideo server. These schemes waste the disk
transfer rate of outer zones. In this thesis, a new video data
placement scheme( we called Cluster-PairingData Placement
Scheme) is proposed and a new disk scheduling scheme
toefficiently utilize the disk transfer ratesof zones in disks
and reduce theseek time by bounded the seek distance in a
specific range on given time areinvestigated. The method can
improve the number of users that video server can support. In
the thesis, we proposed an algorithm todecide the size of
clusters thenintroduce the cluster-pairing data placement
scheme. We also discuss the designissues of our method. finally,
we prove our system by simulation.
|
|---|
