Analysis on Disk Scheduling for Special User Functions

K. W. Ng; K. H. Yeung

doi:10.1109/MMCS.1996.535029

Analysis on Disk Scheduling for Special User Functions

K. W. Ng
, K. H. Yeung

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

Previous studies on disk scheduling for video services are usually based on computer simulation. In this paper, we present analysis on disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as `Forward Search' and `Reverse Search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.

Original language	English
Title of host publication	Proceedings of the International Conference on Multimedia Computing and Systems
Publisher	IEEE
Pages	608-611
ISBN (Print)	0818674369
DOIs	https://doi.org/10.1109/MMCS.1996.535029
Publication status	Published - Jun 1996
Event	1996 International Conference on Multimedia Computing and Systems - Hiroshima, Japan Duration: 17 Jun 1996 → 23 Jun 1996

Conference

Conference	1996 International Conference on Multimedia Computing and Systems
Place	Japan
City	Hiroshima
Period	17/06/96 → 23/06/96

Access Output

10.1109/MMCS.1996.535029

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{1ea5548be7704b539afeaba6003b24c1,

title = "Analysis on Disk Scheduling for Special User Functions",

abstract = "Previous studies on disk scheduling for video services are usually based on computer simulation. In this paper, we present analysis on disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as `Forward Search' and `Reverse Search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.",

author = "Ng, \{K. W.\} and Yeung, \{K. H.\}",

year = "1996",

month = jun,

doi = "10.1109/MMCS.1996.535029",

language = "English",

isbn = "0818674369",

pages = "608--611",

booktitle = "Proceedings of the International Conference on Multimedia Computing and Systems",

publisher = "IEEE",

address = "United States",

note = "1996 International Conference on Multimedia Computing and Systems ; Conference date: 17-06-1996 Through 23-06-1996",

}

TY - GEN

T1 - Analysis on Disk Scheduling for Special User Functions

AU - Ng, K. W.

AU - Yeung, K. H.

PY - 1996/6

Y1 - 1996/6

N2 - Previous studies on disk scheduling for video services are usually based on computer simulation. In this paper, we present analysis on disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as `Forward Search' and `Reverse Search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.

AB - Previous studies on disk scheduling for video services are usually based on computer simulation. In this paper, we present analysis on disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as `Forward Search' and `Reverse Search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.

UR - https://www.scopus.com/pages/publications/0029703904

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0029703904&origin=recordpage

U2 - 10.1109/MMCS.1996.535029

DO - 10.1109/MMCS.1996.535029

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0818674369

SP - 608

EP - 611

BT - Proceedings of the International Conference on Multimedia Computing and Systems

PB - IEEE

T2 - 1996 International Conference on Multimedia Computing and Systems

Y2 - 17 June 1996 through 23 June 1996

ER -

Analysis on Disk Scheduling for Special User Functions

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this