Title: Embedded hard real-time scheduling algorithm based on task's resource requirement

Authors: Wei Hu, Tianzhou Chen, Bin Xie, Like Yan

Addresses: College of Computer Science, Wuhan University of Science and Technology, Wuhan, Hubei, 430065, China; College of College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, 310027, China. ' College of College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, 310027, China. ' College of College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, 310027, China. ' College of College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, 310027, China

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.

Keywords: real-time scheduling; task scheduling; embedded systems; resource requirements; scheduling sequences.

DOI: 10.1504/IJHPCN.2010.037798

International Journal of High Performance Computing and Networking, 2010 Vol.6 No.3/4, pp.234 - 239

Available online: 30 Dec 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article