RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      A Study on the optimal design of the realtime multimedia server

      한글로보기

      https://www.riss.kr/link?id=E805433

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. We address several problems in the designing of large-scale multimedia servers, with the following contributions: (I) We first propose a striping scheme that minimizes the number of seeks and hence maximizes the performance. (2) We present a simple and efficient mechanism to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system: (3) We investigate the characteristics and resource requirements of several scheduling schemes in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. We believe that our results are of value in the design of effective large-scale multimedia servers.
      번역하기

      When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. We address several problems in t...

      When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. We address several problems in the designing of large-scale multimedia servers, with the following contributions: (I) We first propose a striping scheme that minimizes the number of seeks and hence maximizes the performance. (2) We present a simple and efficient mechanism to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system: (3) We investigate the characteristics and resource requirements of several scheduling schemes in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. We believe that our results are of value in the design of effective large-scale multimedia servers.

      더보기

      목차 (Table of Contents)

      • 1. Introduction
      • 2. Striping Multimedia Objects
      • 3. Deciding Round Length and Striping Unit Size
      • 3.1 Constraints in Admission Control
      • 3.2 Determining the optimal DT
      • 1. Introduction
      • 2. Striping Multimedia Objects
      • 3. Deciding Round Length and Striping Unit Size
      • 3.1 Constraints in Admission Control
      • 3.2 Determining the optimal DT
      • 4. Disk Scheduling Schemes
      • 4.1 Disk Service Time
      • 4.2 Buffer Requirement
      • 5. Experimental Results
      • 6. Conclusion
      • References
      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼