한국정보과학회논문지:데이타베이스 (Journal of KIISE:Databases)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

멀티미디어 저장 시스템을 위한 사용자 요청 통합

Unifying User Requests for Multimedia Storage Systems

  • 황인준 (아주대학교 통신전문대학원)
  • 발행 : 2002.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

대부분의 멀티미디어 저장 시스템은 사용자의 요청을 라운드-로빈(round-robin) 방식으로 수행한다. 즉, 사용자는 일정한 간격을 두고 정해진 시간 동안 저장 시스템의 서비스를 받게 된다. 더욱이, 여기에 사용되는 대부분의 알고리즘들은 시스템과 밀접하게 연관된 비용함수를 바탕으로 평가를 받게 된다. 이러한 알고리즘의 FCFS, SCAN, SCAN-EDF 등이 있다. 본 논문에서는 주어진 사용자 요청에 대해서 사용자 대기 시간이나 최대 디스크 대역폭과 같은 제약 조건들을 만족시키는 동시에 임의의 비용 함수에 대해 최적의 스케줄인 통합 읽기 요청(Unified Read Request)을 생성하는 요청 통합기(Request Unifier) 모듈을 설계한다. 그리고 이러한 사용자 요청 통합에 사용될 수 있는 세 개의 알고리즘을 제안하고 성능 평가를 통해 그들의 장단점을 비교해 본다.

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.

키워드

참고문헌

  1. S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju, 'Staggered Striping in Multimedia Information Systems,' Proc. of ACM SIGMOD Conference, pp. 79-90, 1994 https://doi.org/10.1145/191839.191852
  2. M. Budhikot, G. Parulkar, and J.R. Cox Jr, 'Design of a Large Scale Video Server,' Journal of Computer Networks and ISDN Systems, pp. 504-517, Dec. 1994
  3. H.J. Chen, A. Krishnamurthy, T.D.C. Little, and D. Venkatesh, 'A Scalable Video- On-Demand Service for the Provision of VCR-like Functions,' Proc. of Int'l. Conference on Multimedia Computing and Systems, pp. 65-72, 1995 https://doi.org/10.1109/MMCS.1995.484909
  4. M.S. Chen, D.D. Kandlur, and P.S. Yu, 'Support for Fully Interactive Playout in a Disk-Array-Based Video Server,' Proc. of ACM Multimedia, pp. 391-398, 1994 https://doi.org/10.1145/192593.192708
  5. R.T. Ng and J. Yang, 'Maximising Buffer and Disk Utilisations for News On-Demand,' Proc. of the 20'th VLDB Conference, Chile, 1994
  6. P.V. Rangan and H. Vin, 'Designing File Systems for Digital Video and Audio,' Proc. of ACM Symposium on Operating Systems Principles, pp. 69-79, 1991
  7. A. Dan and D. Sitaram, 'A Generalised Interval Caching Policy for Mixed Interactive and Long Video Workloads,' Multimedia Computing and Networking, San Jose, Jan. 1996
  8. L. Golubchik, J. Lui, and R. Muntz, 'Reducing I/O Demand in Video-On-Demand Storage Servers,' Proc. of ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, pp. 25-36, 1995 https://doi.org/10.1145/223587.223590
  9. R.T. Ng and Paul Shum, 'Optimal Clip Ordering for News On-Demand Queries,' Int'l Workshop on Multimedia Information Systems, New Work, 1996
  10. S. Chaudhuri, S. Ghandeharizadeh, and C. Shahabi, 'Avoiding Retrieval Contention for Composite Multimedia Object,' Proc. of the VLDB Conference, Zurich, Switzerland, 1995
  11. C.L. Liu and J.W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' Journal of the ACM, Vol. 20, No. 1, pp. 46-61, Jan. 1973 https://doi.org/10.1145/321738.321743
  12. G. Nerjes, P. Muth, M. Paterakis, Y, Rompogiannakis, P. Triantafillou, and G. Weikum, 'Scheduling Strategies for the Mixed Workloads in Multimedia Information Servers,' Int'l Workshop on Research Issues in Data Engineering, Orlando, Florida, Feb. 1998
  13. Y. Rompogiannakis, G. Nerjes, P. Muth, M. Paterakis, P. Triantafillou, and G. Weikum, 'Disk Scheduling for Mixed-Media Workloads in a Multimedia Server,' Proc. of ACM Multimedia, pp. 297-302, 1988 https://doi.org/10.1145/290747.290785
  14. N.H Balkir and G. Ozsoyoglu, 'Delivering Presentations from Multimedia Servers,' VLDB journal, Dec. 1998
  15. Y.M. Pluang and S.L. Tsao, 'An Efficient Disk Layout Scheme for Multi-Disks Continuous Media Servers,' Multimedia Tools and Applications Journal, Kluwer Academic Publishers, Vol. 9, No. 2, pp. 147-166, Sep. 1999 https://doi.org/10.1023/A:1009628223063
  16. A.L. Drapeau, D.A. Patterson, and R.H. Kate, 'Toward Workload Characterisation of Video Server and Digital Library Application,' Proc. Of ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, Nashville, May 1994
  17. M. Garey and D. Johnson, 'Computer and Intractability: A Guide to the Theory of NP-Completeness,' Freeman and Company, NY, 1979
  18. E. Hwang and B. Prabhakaran, 'Merging Retrieval Requests for Multimedia Storage Server,' Int'l Workshop on Intelligent Multimedia Computing and Networking, New Jersey, Feb. 2000
  19. J.Y. Leung and M.I.. Merrill, 'A Note on Preemptive Scheduling of Periodic Real-Time Tasks,' Information Processing Letters, Vol. 11, No. 3, pp. 115-118, Nov. 1980 https://doi.org/10.1016/0020-0190(80)90123-4
  20. 'Video Store Magazine,' Dec. 13, 1992
  21. E. Hwang, V. S. Subrahmanian, and B. Prabhakaran, 'Distributed Video Presentation,' Int'l Conference on Data Engineering, pp. 268-275, Florida. Feb. 1998