Paper Info
Title
Dynamic optimization of readsize in hypermedia servers
Abstract
While disk scheduling techniques for Continuous Media (CM) servers are mostly designed to maximize the number of concurrent CM data streams, considerably less attention has been paid to Discrete Media (DM) data throughput. DM data throughput is vital to systems that need to support the heterogeneity and variety of data found in interactive hypermedia and digital library applications. Therefore, a server?s ability in delivering a high DM data throughput without degrading its CM data throughput deserves more attention. In this paper, a new technique is introduced to optimize the use of disk bandwidth at run-time and redirect the saved bandwidth to service DM requests. Based on a new cost model of disk access incurred in CM service, we formulate strategies to moderate the size of disk reads at run-time. Through experimental evaluations, these strategies are found to improve the efficiency of disk accesses and the DM data throughput of a hypermedia server without jeopardizing the throughput and quality of CM service.
Year
DOI
Venue
1999
10.1109/MMCS.1999.778518
Multimedia Computing and Systems, 1999. IEEE International Conference
Keywords
Field
DocType
hypermedia,multimedia servers,optimisation,quality of service,real-time systems,scheduling,concurrent data streams,continuous media servers,cost model,digital library,discrete media data throughput,disk bandwidth,disk scheduling,experiment,hypermedia servers,interactive hypermedia,quality of service,readsize optimization,run-time
Data stream mining,I/O scheduling,Computer science,Scheduling (computing),Hypermedia,Server,Quality of service,Computer network,Bandwidth (signal processing),Throughput
Conference
Volume
ISBN
Citations 
2
0-7695-0253-9
0
PageRank 
References 
Authors
0.34
3
2
Name
Order
Citations
PageRank
Tsun-ping J. To1193.59
Hamidzadeh Babak218424.99