Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Linux Journal
A unifying approach to scheduling
Communications of the ACM
A scheduling philosophy for multiprocessing systems
Communications of the ACM
Scheduling of conditional process graphs for the synthesis of embedded systems
Proceedings of the conference on Design, automation and test in Europe
Pocket PC Developer's Guide
Synthesis of real-time embedded software with local and global deadlines
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Meta-scheduling algorithms for managing inter-cloud interoperability
International Journal of High Performance Computing and Networking
Hi-index | 0.00 |
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.