Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Allocating hard real-time tasks: an NP-hard problem made easy
Real-Time Systems
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Visual assessment of a real-time system design: a case study on a CNC controller
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Genetic-algorithm-based real-time task scheduling with multiple goals
Journal of Systems and Software - Special issue: Computer systems
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Integrated scheduling and synthesis of control applications on distributed embedded systems
Proceedings of the Conference on Design, Automation and Test in Europe
Multilevel static real-time scheduling algorithms using graph partitioning
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Hi-index | 14.98 |
The problem of scheduling real-time tasks with minimum jitter is particularly important in many control applications; nevertheless, it has rarely been studied in the scientific literature. This paper presents a unconventional 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. 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. Experimental results demonstrate the significant improvement of our algorithm over earliest deadline first and rate monotonic algorithms.