Performance Improvements of Scheduling Algorithms for Multimedia Server

Seong Soo PARK; Dong Ho CHO

Performance Improvements of Scheduling Algorithms for Multimedia Server

Seong Soo PARK, Dong Ho CHO

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.6 pp.706-711

Publication Date: 1996/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Multimedia Computing and Communications)

Category

Cite this

Copy

Seong Soo PARK, Dong Ho CHO, "Performance Improvements of Scheduling Algorithms for Multimedia Server" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 6, pp. 706-711, June 1996, doi: .
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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e79-d_6_706/_p

Copy

@ARTICLE{e79-d_6_706,
author={Seong Soo PARK, Dong Ho CHO, },
journal={IEICE TRANSACTIONS on Information},
title={Performance Improvements of Scheduling Algorithms for Multimedia Server},
year={1996},
volume={E79-D},
number={6},
pages={706-711},
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.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Performance Improvements of Scheduling Algorithms for Multimedia Server
T2 - IEICE TRANSACTIONS on Information
SP - 706
EP - 711
AU - Seong Soo PARK
AU - Dong Ho CHO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1996
AB - 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.
ER -