This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sync Classes: A Framework for Optimal Scheduling of Requests in Multimedia Storage Servers
January/February 2000 (vol. 12 no. 1)
pp. 60-77

Abstract—There have been many proposals on how media-on-demand servers can effectively allow clients to share resources. In this paper, given a set of clients, we show how these clients may be partitioned into “sync-classes”—sets of clients who can be serviced through allocation of a single set of resources. As a set of clients may be partitioned into sync-classes in many different ways, we show that a very large class of cost functions may be used to determine which partition to choose. We provide algorithms to compute such optimal splits. Our framework is very generic in the following ways: 1) The system may plug-in any cost function whatsoever, as long as it satisfies four common-sense axioms that evaluate costs, and 2) the system may evaluate the future anticipated requests of a user using any user model (e.g., a Markovian model) that has a specified I/O interface. Thus, a wide variety of predictive methods (of what the user will do) and a wide variety of costing methods may be used within our framework.

[1] C.C. Aggarwal, J.L. Wolf, and P.S. Yu, “On Optimal Piggyback Merging Policies for Video-On-Demand Systems,” Proc. 1996 ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, pp. 200-209, May 1996.
[2] S. Berson, S. Ghandeharizadeh, R.R. Muntz, and X. Ju, “Staggered Striping in Multimedia Information Systems,” Proc. SIGMOD, 1994.
[3] A. Dan, D.M. Dias, R. Mukherjee, D. Sitaram, and R. Tewari, Buffering and Caching in Large-Scale Video Servers Digest of Papers, IEEE Int'l Computer Conf., pp. 217-225, Mar. 1995.
[4] A. Dan, O. Shahabuddin, D. Sitaram, and D. Towsley, "Channel Allocation Under Batching and VCR Control in Video-On-Demand Systems," J. Parallel and Distributed Computing, vol. 30, no. 2, pp. 147-167, Nov. 1995.
[5] A. Dan, D. Sitaram, and P. Shahabuddin, Scheduling Policies for an On-Demand Video Server with Batching Proc. Second ACM Int'l Conf. Multimedia, pp. 15-23, 1994.
[6] S. Ghandeharizadeh and C. Shahabi, “On Multimedia Repositories, Personal Computers, and Hierarchical Storage,” Proc. Second ACM Int'l Conf. Multimedia, Oct. 1994.
[7] L. Goluchik, J.C.S. Lui, and R.R. Muntz, Adaptive Piggybacking: A Novel Techniques for Data Sharing in Video-on-Demand Storage Servers ACM Multimedia Systems J., vol. 4, no. 3, pp. 140-155, 1996.
[8] L. Golubchik, J.C.S. Lui, and R. Muntz, “Reducing I/O Demand in Video-On-Demand Storage Servers,” Proc. 1995 ACM SIGMETRICS Joint Int'l Conf. Measurement and Modeling of Computer Systems, pp. 25-36, May 1995.
[9] F. Hillier and G. Lieberman, Operations Research. Holden Day, 1974.
[10] K. Ramamritham, M. Kamath, and D. Towsley, "Continuous Media Sharing in Multimedia Database Systems," Proc. Fourth Int'l Conf. Database Systems for Advanced Applications (DASFAA '95), 1995.
[11] M. Kamath, K. Ramamritham, and D. Towsley, “Continuous Media Sharing in Multimedia Database Systems,” Technical Report 94-11, Dept. of Computer Science, Univ. of Massachusets, Amherst, 1994.
[12] S.W. Lau, J.C.-S. Lui, and L. Golubchik, “Merging Video Streams in a Multimedia Storage Server: Complexity and Heuristics,” ACM Multimedia Systems Journal, vol. 6, no. 1, pp. 29-42, Jan. 1998.
[13] B. Ozden, A. Biliris, R. Rastogi, and A. Silberschatz, “A Low-Cost Storage Server for Movie on Demand Databases,” Proc. 20th Int'l Conf. Very Large Data Bases, Sept. 1994.
[14] P.V. Rangan and H.M. Vin, "Efficient Storage Techniques for Digital Continuous Multimedia," IEEE Trans. Knowledge and Data Eng. , vol. 5, no. 4, Aug. 1993, pp. 564-573.
[15] P. Rangan and H. Vin, “Designing File Systems for Digital Video and Audio,” Proc. 13th Symp. Operating Systems Principles (SOSP '91), Operating Systems Review, vol. 25, pp. 81–94, Oct. 1991.
[16] S.M. Ross, Stochastic Processes. John Wiley&Sons, 1983.
[17] W.J. Stewart, Introduction to Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
[18] F.A. Tobagi, J. Pang, R. Baird, and M. Gang, “Streaming RAID—A Disk Array Management System For Video Files,” Proc. ACM Multimedia Conf., pp. 393–399, 1993.
[19] P. Yu, M. Chen, and D. Kandlur, “Grouped Sweeping Scheduling for DASD-Based Multimedia Storage Management,” ACM Multimedia Systems J., vol. 1, no. 2, pp. 99-109, 1993.
[20] P.S. Yu, J.L. Wolf, and H. Shachnai, "Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Application," ACM/Springer Multimedia Systems, Vol. 3, No. 4, 1995, pp. 137-150.

Index Terms:
Media-on-demand servers, scheduling, optimization, interactive systems, storage servers.
Citation:
Leana Golubchik, V.s. Subrahmanian, Sherry Marcus, Joachim Biskup, "Sync Classes: A Framework for Optimal Scheduling of Requests in Multimedia Storage Servers," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 1, pp. 60-77, Jan.-Feb. 2000, doi:10.1109/69.842251
Usage of this product signifies your acceptance of the Terms of Use.