• Title/Summary/Keyword: Real-time Disk Scheduling

Search Result 18, Processing Time 0.029 seconds

Design and Implementation of a Main-memory Storage System for Real-time Retrievals (실시간 검색을 위한 다중 사용자용 주기억장치 자료저장 시스템 개발)

  • Kwon, Oh-Su;Hong, Dong-Kweon
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.187-194
    • /
    • 2003
  • Main Memory storage system can increase the performance of the system by assigning enough slack time to real-time transactions. Due to its high response time of main memory devices, main memory resident data management systems have been used for location management of personal mobile clients to cope with urgent location related operations. In this paper we have developed a multi-threaded main memory storage system as a core component of real-time retrieval system to handle a huge amount of readers and writers of main memory resident data. The storage system is implemented as an embedded component which is working with the help of a disk resident database system. It uses multi-threaded executions and utilizes latches for its concurrency control rather than complex locking method. It only saves most recent data on main memory and data synchronization is done only when disk resident database asks for update transactions. The system controls the number of read threads and update threads to guarantee the minimum requirements of real-time retrievals.

Insertion Real-Time Disk Scheduling Scheme and A Both Direction SCAN Algorithms (삽입 실시간 디스크 스케줄링기법과 양방향 SCAN기법)

  • 이덕용;박창현;조행래
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.34-36
    • /
    • 2004
  • 실시간 스케줄링에서 시간당 처리량을 놓이기 위해서 EDF에 SCAN기법을 추가하는 많은 방법이 연구되었다. 하지만 기존 기법들은 SCAN그룹을 생성할 때, 연속된 태스크들만 SCAN그룹의 포함 대상으로 고려하기 때문에 많은 제한이 따른다. 또한 SCAN기법은 처리방향이 고정되었기 때문에 시간적 손실이 많은 단점을 가진다. 본 연구에서는 연속되지 않은 태스크들을 SCAN그룹의 포함 대상으로 고려할 수 있는 태스크 삽입기법과, 기존의 SCAN그룹에서 합병하지 못하는 SCAN그룹들을 합병할 수 있는 SCAN합병기법, 마지막으로 SCAN그룹을 처리하는데 시간적 이점을 얻을 수 있는 양 방향 SCAN기법을 제시한다.

  • PDF

Disk Scheduling Scheme for Soft Real-Time Service (연성 실시간 서비스를 위한 디스크 스케줄링 기법)

  • 이용수;이승원;김정원;정기동
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2000.04a
    • /
    • pp.349-352
    • /
    • 2000
  • 본 연구에서는 연성 실시간 태스크 즉 비디오, 오디오와 같은 태스크의 실시간 적인 특성을 만족시키기 위하여 현재 각광 받고 있는 리눅스 커널을 사용하여 연성 실시간 커널을 개발하고자 한다. 리눅스 파일시스템의 디스크 스케줄링 은 오디오와 비디오와같은 연성 실시간 태스크의 실시간 요건을 고려하지 않았다. 본 연구에서는 우선 주기 당 일정 대역폭을 요구하는 멀티미디어 서비스를 지원하기 위해 디스크 대역폭 예약이 가능한 디스크 스케줄링 기법을 제시하여 태스크간 공정한 디스크 서비스를 제공한다.

  • PDF

Power Conscious Disk Scheduling for Multimedia Data Retrieval (저전력 환경에서 멀티미디어 자료 재생을 위한 디스크 스케줄링 기법)

  • Choi, Jung-Wan;Won, Yoo-Jip;Jung, Won-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.4
    • /
    • pp.242-255
    • /
    • 2006
  • In the recent years, Popularization of mobile devices such as Smart Phones, PDAs and MP3 Players causes rapid increasing necessity of Power management technology because it is most essential factor of mobile devices. On the other hand, despite low price, hard disk has large capacity and high speed. Even it can be made small enough today, too. So it appropriates mobile devices. but it consumes too much power to embed In mobile devices. Due to these motivations, in this paper we had suggested methods of minimizing Power consumption while playing multimedia data in the disk media for real-time and we evaluated what we had suggested. Strict limitation of power consumption of mobile devices has a big impact on designing both hardware and software. One difference between real-time multimedia streaming data and legacy text based data is requirement about continuity of data supply. This fact is why disk drive must persist in active state for the entire playback duration, from power management point of view; it nay be a great burden. A legacy power management function of mobile disk drive affects quality of multimedia playback negatively because of excessive I/O requests when the disk is in standby state. Therefore, in this paper, we analyze power consumption profile of disk drive in detail, and we develop the algorithm which can play multimedia data effectively using less power. This algorithm calculates number of data block to be read and time duration of active/standby state. From this, the algorithm suggested in this paper does optimal scheduling that is ensuring continual playback of data blocks stored in mobile disk drive. And we implement our algorithms in publicly available MPEG player software. This MPEG player software saves up to 60% of power consumption as compared with full-time active stated disk drive, and 38% of power consumption by comparison with disk drive controlled by native power management method.

The Efficient Buffer Management for a Multimedia File System (멀티미디어 파일 시스템을 위한 효율적 버퍼 관리)

  • Hong, Chul-Eui
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.8
    • /
    • pp.1743-1749
    • /
    • 2011
  • The multimedia data for video-on-demand(VOD) service has large, continuous and real time characteristics. The frequent disk I/O operations takes much time and decrease the system performance in multimedia services. Therefore the efficient buffer management is needed in order to reduce the disk accesses to multimedia data. This paper addresses how to increase the buffer hit ratio and the number of users in a multimedia service like VOD by increasing the utility of buffer. This paper also simulated various resource management algorithms and strategies and evaluated, compared and analyzed their performances.

An Efficient Pre-Fetching Service for Multi-media Server based on Disc Partition Scheduling (멀티미디어 서버에서 효율적인 선반입 서비스를 위한 디스크 파티션 스케쥴링)

  • Choi Sung-Wook
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.3
    • /
    • pp.379-390
    • /
    • 2005
  • Intensive studies have been made in the area of VOD server Multimedia files in the VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient $pre\_fetching$ policy for multimedia services with dynamic monitoring and management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about $28\%$ performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

  • PDF

An Integrated File System for Guaranteeing the Quality of Service of Multimedia Stream (멀티미디어 스트림의 QoS를 보장하는 통합형 파일시스템)

  • 김태석;박경민;최정완;김두한;원유집;고건;박승민;김정기
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.9
    • /
    • pp.527-535
    • /
    • 2004
  • Handling mixed workload in digital set-top box or streaming server becomes an important issue as integrated file system gets momentum as the choice for the next generation file system. The next generation file system is required to handle real-time audio/video playback while being able to handle text requests such as web page, image file, etc. Legacy file system provides only best effort I/O service and thus cannot properly support the QoS of soft real-time I/O. In this paper, we would like to present our experience in developing the file system which fan guarantee the QoS of multimedia stream. We classify all application I/O requests into two category: periodic I/O and sporadic I/O. The QoS requirement of multimedia stream could be guaranteed by giving a higher priority to periodic requests than sporadic requests. The proto-type file system(Qosfs) is developed on Linux Operating System.

Dynamic Stream Merging Scheme for Reducing the Initial Latency Time and Enhancing the Performance of VOD Servers (VOD 서버의 초기 대기시간 최소화와 성능 향상을 위한 동적 스트림 합병 기법)

  • 김근혜;최황규
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.5
    • /
    • pp.529-546
    • /
    • 2002
  • A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

  • PDF