By Topic

An Efficient Disk Scheduling Algorithm for Multimedia System Based on GSR Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rahmani, H. ; Electr. & Comput. Eng. Dept., Shahid Beheshti Univ., Tehran ; Moghaddam, M.E.

Disk scheduling has an important role in QOS guarantee of soft real-time environments such as video-on-demand and multimedia servers. Since now, some disk scheduling algorithms have been proposed to optimize scheduling disk requests. One of the most recent algorithms is GSR. GSR improved the disk throughput by globally rescheduling scheme for real-time disk requests. In this paper, we propose a new algorithm based on GSR that is called IGSR (Improved GSR). The proposed method improves throughput and decreases the number of missed deadline requests by employing FTS (Feasible Tasks Sequence). Simulation results showed IGSR decreased the number of missed deadlines 50% and increased disk throughput 12% in compare with GSR. Also, when the input is infeasible, IGSR provided about 40% more feasible output schedules.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009