Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Power-Aware, Best-Effort Real-Time Task Scheduling Algorithm
WSTFES '03 Proceedings of the IEEE Workshop on Software Technologies for Future Embedded Systems
On Energy-Constrained Real-Time Scheduling
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
| Hi-index | 0.00 |
Embedded hard real-time systems have stringent timing constraints that must be satisfied for the correct functioning of the system. Additionally, there are systems where energy is another constraint that must also be satisfied. In order to satisfy such requirements, a pre-runtime scheduling is presented to find a feasible schedule satisfying both constraints. The proposed approach uses state space exploration for finding feasible schedules taking into account timing and energy constraints. The main problem with such method is the space size, which can grow exponentially. This paper shows how to minimize this problem, and presents a depth-first search method on a timed labeled transition system derived from the time Petri net model. EZPetri is an Eclipse perspective for Petri nets based on PNML. It provides facilities for integrating Petri net applications and existing Petri net tools. In this paper we demonstrate how the plug-in technology of Eclipse was employed to integrate the pre-runtime scheduling synthesis framework with the EZPetri environment. In order to depict the practical usability of the proposed approach, a pulse-oximeter case study is adopted to show how to find a feasible schedule.