Performance Improvements of Scheduling Algorithms for Multimedia Server (Special Issue on Multimedia Computing and Communications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, the real-time scheduling mechanism which could support multimedia retrieval services more efficiently is investigated. In order to support multimedia service, the MEDF (modified earliest deadline first) algorithm that takes advantage of the priority queue and the virtual deadline mechanism is proposed. Additionally, its performance is analyzed and compared with conventional RR (round robin), FCFS (first come first serve), SS (sporadic server), MRF (minimum remained-time first), and EDF (earliest deadline first) algorithms. According to the simulation results, the proposed MEDF algorithm shows better performance than other scheduling algorithms in the multimedia environments.
- 社団法人電子情報通信学会の論文
- 1996-06-25
著者
-
Cho D
Korea Advanced Inst. Sci. And Technol. Daejeon Kor
-
Park Seong
Faculty Of Department Of Computer Engineering Kyunghee University
-
CHO Dong
TFaculty of Department of Computer Engineering, Kyunghee University