This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Database Design Principles for Placement of Delay-Sensitive Data on Disks
May/June 1999 (vol. 11 no. 3)
pp. 425-447

Abstract—We investigate design principles for placing striped delay-sensitive data on a number of disks in a distributed environment. The cost formulas of our performance model allow us to calculate the maximum number of users that can be supported by n disks, as well as to study the impact of other performance-tuning options. We show that, for fixed probabilities of accessing the delay-sensitive objects, partitioning the set of disks is always better than striping in all of the disks. Then, given a number n of disks and r distinct delay-sensitive objects with probabilities of access p1, p2, ..., pr that must be striped across r different disk partitions (i.e., nonoverlapping subsets of the n disks), we use the theory of Schur functions in order to find what is the optimal number of disks that must be allocated to each partition. For objects with different consumption rates, we provide an analytic solution to the problem of disk partitioning. We analyze the problem of grouping the more- and less-popular delay-sensitive objects together in partitions—when the partitions are less than the objects—so that the number of supported users is maximized. Finally, we analyze the trade-off of striping on all the disks versus partitioning the set of the disks when the access probabilities of the delay-sensitive objects change with time.

[1] S. Berson, S. Ghandeharizadeh, R.R. Muntz, and X. Ju, “Staggered Striping in Multimedia Information Systems,” Proc. SIGMOD, 1994.
[2] E. Chang and H. Garcia-Molina, Effective Memory Use in a Media Server Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 496-505, 1997.
[3] P.M. Chen and D.A. Patterson, "Maximizing Performance in a Striped Disk Array," Proc. 17th Int'l Symp. Computer Architecture,Seattle, pp. 322-331, May 1990.
[4] S. Christodoulakis and P. Triantafillou, "Research and Development Issues for Large-Scale Storage Servers," Information Systems J., vol. 20, no. 6, pp. 443-445, 1995.
[5] S. Christodoulakis and F. Zioga, "Data Base Design Principles for Striping and Placement of Delay-Sensitive Data on Disks," Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS '98),Seattle, June 1998.
[6] S. Christodoulakis, N. Pappas, G. Kyriakaki, Y. Maragoudakis, Y. Mavraganis, and C. Tsinaraki, "The KYDONIA Multimedia Information Server," Proc. ECMAST, 1997.
[7] S. Christodoulakis, D. Magoulioti, and P. Triantafillou, "Benchmarking and Performance Tuning of Multimedia Servers," Proc. EuroPAR, 1997.
[8] A. Dan, M. Kienzle, and D. Sitaram, “A Dynamic Policy of Segment Replication for Load-Balancing in Video-On-Demand Servers,” ACM Multimedia Systems J., 1995.
[9] J. Gemmell and S. Christodoulakis, "Principles of Storage and Retrieval of Multimedia Data," ACM Trans. Information Systems, vol. 10, no. 1, Jan. 92.
[10] D.J. Gemmell, "Disk Scheduling for Continuous Media," Multimedia Information Storage and Management," S.M. Chung, ed., Kluwer, 1996.
[11] J. Hsieh, M. Lin, J.C.L. Liu, and D. Du, "Performance of a Mass Storage System for Video-On-Demand," J. Parallel and Distributed Computing, special issue on multimedia processing tech nology, vol. 30, no. 2, pp. 147-167, Nov. 1995.
[12] D. Jadav, C. Srinilta, A. Choudhary, and B. Berra, "Techniques for Scheduling I/O in a High Performance Multimedia-On-Demand Server," J. Parallel and Distributed Computing, vol. 30, no. 2, Nov. 1995.
[13] K. Keeton and R. Katz, "Evaluating Video Layout Strategies for a High Performance Storage Server," Multimedia Systems, vol. 3, pp. 43-52, ACM/Verlag, 1995.
[14] A. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, Academic Press, Univ. of Southern California, 1979.
[15] A. Merchant and P. Yu, "Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays," IEEE Trans. Computers, vol. 44, pp. 419-433, 1995.
[16] R. Ng and J. Yang, "An Analysis of Buffer Sharing and Prefetching Techniques for Multimedia Systems," Dept. of Computer Science, Univ. of British Columbia, Technical Report TR-94-20, ().
[17] B. Özden, R. Rastogi, and A. Silberschatz, "On the Design of a Low-Cost Video-On-Demand Storage System," Multimedia Systems, vol. 4, pp. 40-54, 1996.
[18] K. Salem and H. Garcia-Molina, Disk Striping Proc. Data Eng. '86, pp. 336-342, 1986.
[19] P. Scheuermann, G. Weikum, and P. Zabback, "Data Partitioning and Load Balancing in Parallel Disk Systems," VLDB J., vol. 7, no. 1, pp. 48-66, 1998.
[20] 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.
[21] P. Triantafillou and C. Faloutsos, “Overlay Striping and Optimal Parallel I/O for Modern Applications,” Parallel Computing, vol. 24, no. 1, Jan. 1998.

Index Terms:
Database design, delay-sensitive objects, continuous media, parallel retrieval, data striping, multimedia servers, performance optimization, video, audio.
Citation:
Stavros Christodoulakis, Fenia A. Zioga, "Database Design Principles for Placement of Delay-Sensitive Data on Disks," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 3, pp. 425-447, May-June 1999, doi:10.1109/69.774102
Usage of this product signifies your acceptance of the Terms of Use.