Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
STRESS: a simulator for hard real-time systems
Software—Practice & Experience
Aperiodic servers in a deadline scheduling environment
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
TaskPair-scheduling with optimistic case execution times-an example for an adaptive real-time system
WORDS '96 Proceedings of the 2nd Workshop on Object-Oriented Real-Time Dependable Systems (WORDS '96)
Hi-index | 0.00 |
Real-time systems seek to guarantee predictable run-time be-ha viour to ensure that tasks will meet their deadlines. Optimal scheduling decisions, however, easily impose unacceptable run-time costs for many but the most basic scheduling problems, specifically in the context of multiprocessors and distributed systems. Deriving suitable heuristics then usually requires extensive simulations to gain confidence in the chosen approach. In this paper we therefore present Fortissimo, an open framework that facilitates the development of taylor-made real-time scheduling simulators for multiprocessor systems.