A Method for Real-Time Scheduling Problems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Solving a real-time allocation problem with constraint programming
Journal of Systems and Software
ACO approach with learning for preemptive scheduling of real-time tasks
International Journal of Bio-Inspired Computation
Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Robust partitioning for real-time multiprocessor systems with shared resources
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
This paper presents a non-conventional scheduling approach for distributed static systems where tasks are periodic and have arbitrary deadlines, precedence, and exclusion constraints. The solution presented in this work not only creates feasible schedules, but also minimizes jitter for periodic tasks. The problem of scheduling real-time tasks with minimum jitter is particularly important in many control applications, nevertheless, it has been rarely studied in the scientific literature. We present a general framework consisting of an abstract architecture model and a general programming model. We show how to design a surprisingly simple and flexible scheduling method based on simulated annealing and present some experimental results.