By Topic

Real-time scheduling of non-preemptive periodic tasks for continuous media retrieval

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
$33 $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)
Yun-Cheol Baek ; Dept. of Comput. Sci., Seoul Nat. Univ., South Korea ; Kern Koh

A real-time system should guarantee that each hard real-time task completes execution before its deadline. When non-preemptive earliest deadline first (EDF) scheduling is used for a set of periodic tasks, one can achieve full processor utilization, but its schedulability test is known to be an NP-hard problem. Continuous media (CM) retrieval is becoming an important application of real-time systems. In such an application, the CM server should provide CM data requested by clients within the specified deadline. We examine the O(1) time online schedulability tests for a set of equal computation time tasks and for a set of equal period tasks using non-preemptive EDF algorithm. We also demonstrate that these results can be used for scheduling a set of client requests in CM retrieval system

Published in:

TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994

Date of Conference:

22-26 Aug 1994