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

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.