By Topic

Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform

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)
Tong Wu ; Nat. Lab. of Parallel & Distrib. Process., NUDT, Changsha ; Shiyao Jin

Multiprocessor architectures are becoming more attractive for embedded systems, and also for multimedia embedded systems. In multimedia embedded systems, there exist both hard real-time tasks and multimedia stream with QoS guarantee. In this context, researched on integrated schedule of both hard real-time tasks and streams are urgent affairs. This paper analyzes the shortcomings of the current approach - multimedia server, and then based on the DBP algorithm, proposes an algorithm which also considers the resource constraint. According to the different budget schemes, greedy algorithm and optimistic algorithm are brought up. Results show the performance of the algorithms.

Published in:

Ubi-Media Computing, 2008 First IEEE International Conference on

Date of Conference:

July 31 2008-Aug. 1 2008