Performance improvements of scheduling algorithms for multimedia server

Abstract

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.