A method for adjusting the periods of periodic processes to reduce the least common multiple of the period lengths in real-time embedded systems
Author:
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 288-294
Abstract
This paper presents a method for systematically adjusting the period lengths of periodic processes, such that the adjusted period lengths are as closely harmonically related to each other (having a smaller LCM value) as possible, in order to reduce the schedule length and the number of instances of new processes, and reduce storage requirements and system overhead, while at the same time ensuring that the adjusted period lengths are sufficiently close to the original period lengths, to satisfy the processor utilization level required by the application, and maximize the chances of finding a feasible schedule.Keywords
This publication has 5 references indexed in Scilit:
- On inspection and verification of software with timing requirementsIEEE Transactions on Software Engineering, 2003
- Priority Scheduling Versus Pre-Run-Time SchedulingReal-Time Systems, 2000
- Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relationsIEEE Transactions on Software Engineering, 1993
- On satisfying timing constraints in hard-real-time systemsIEEE Transactions on Software Engineering, 1993
- Scheduling processes with release times, deadlines, precedence and exclusion relationsIEEE Transactions on Software Engineering, 1990