A real-time scheduling algorithm for embedded systems with various resource requirements
ABSTRACT The scheduling algorithm is one of the most important portions of embedded operating systems especially for real-time embedded operating systems. The performance of scheduling algorithm influences the performance of the whole system. Real-time embedded operating system needs better response time for real-time process; it is more rigid on response time for hard real-time embedded operating system. A high-performance scheduling algorithm is required in order to make embedded operating system more efficient. Most of the mainstream scheduling algorithms are able to ensure response time for most processes, but for specific real-time applications for embedded system, a specialized real-time scheduling algorithm is required to ensure real-time response. In this paper, we propose a novel real-time scheduling algorithm for real-time embedded system. This algorithm divides all tasks into different sets and schedules the tasks according to the features of the set
- SourceAvailable from: Butler Lampson[show abstract] [hide abstract]
ABSTRACT: A collection of basic ideas is presented, which have been involved by various workers over the past four years to provide a suitable framework for the design and analysis of multiprocessing systems. The notions of process and state vector are discussed, and that the nature of basic operations on processes is considered. Some of the connections between processes and protection are analyzed. A very general approach to priority-oriented scheduling is described, and its relationship to conventional interrupt systems is explained. Some aspects of time-oriented scheduling are considered. The implementation of the scheduling mechanism is analyzed in detail and the feasibility of embodying it in hardware established. Finally several methods for interlocking execution of independent processes are presented and compared.Commun. ACM. 05/1968; 11(5):347-360.
Conference Proceeding: Synthesis of real-time embedded software with local and global deadlines[show abstract] [hide abstract]
ABSTRACT: Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical path in a task. This creates unnecessary modeling limitations which directly affect the types of systems synthesizable. We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks. Through this scheduling procedure, we are able to formally synthesize real-time embedded software from a network of real-time Petri net specifications. Application examples, including a driver for the master/slave role switch in Bluetooth wireless communication devices, are given to illustrate the feasibility of the scheduling algorithm.Hardware/Software Codesign and System Synthesis, 2003. First IEEE/ACM/IFIP International Conference on; 11/2003
- [show abstract] [hide abstract]
ABSTRACT: The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.J. ACM. 01/1973; 20:46-61.