메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
The timeliness requirement of continuous media data calls for efficient buffer management and disk access scheme for storage systems. Despite the development of efficient storage and retrieval strategies, storage systems are likely to make a bottleneck, thereby limiting the number of concurrent sessions supportable to a continuous media storage system. However, one can more effectively utilize buffer space by allowing for buffer resident CM data reused whenever possible by exploiting future referencing behavior of CM data. In this paper, we propose a buffer replacement algorithm that enables subsequent users requesting the same data to share data efficiently. The proposed algorithm manages buffers by utilizing future reference sequences. The effectiveness of the proposed algorithm is evaluated through simulation experiments. It is found that the performance improvement of the proposed algorithm is achieved when tested against traditional buffer replacement algorithms. Therefore, if applied to continuous media applications, the proposed algorithm can reduce the response time for lagging users requests and substantially improve I/O performance.

목차

Abstract

Ⅰ. Introduction

Ⅱ. Background and Related Works

Ⅲ. The Proposed Buffer Replacement Algorithm

Ⅳ. Simulation Results

Ⅴ. Conclusion

References

저자소개

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-017766491