Embedded hard real-time scheduling algorithm based on task's resource requirement Online publication date: Thu, 30-Dec-2010
by Wei Hu, Tianzhou Chen, Bin Xie, Like Yan
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 6, No. 3/4, 2010
Abstract: The embedded systems are resource limited systems and response time is commonly one of the most important requirements. In this paper, we present a real-time scheduling algorithm based on task's resource requirements for embedded system. In embedded systems, the resources and tasks are restricted, especially in specific systems. The tasks can be divided into different sets according to their resource requirements. In the same set, specific scheduling algorithm can be selected to schedule the tasks according to the features of the set. Thus different sets can have different scheduling algorithms. Then the scheduling sequences can be calculated as preparation partly. It is more efficient for embedded specific system.
Online publication date: Thu, 30-Dec-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com