Random number generators: good ones are hard to find
Communications of the ACM
Two fast implementations of the “minimal standard” random number generator
Communications of the ACM
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
IEEE/ACM Transactions on Networking (TON)
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
A Class of Rate-Based Real-Time Scheduling Algorithms
IEEE Transactions on Computers
Handling Execution Overruns in Hard Real-Time Control Systems
IEEE Transactions on Computers
Stochastic Analysis of a Reseveration Based System
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Robust aperiodic scheduling under dynamic priority systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations
IEEE Transactions on Computers
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Modified MUF and EDF algorithms for overloaded soft real time systems
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
| Hi-index | 0.00 |
Traditional overrun handling approaches for real-time systems enforce some isolation property at the job or task level. This paper shows that by ''relaxing'' task isolation, it is possible to efficiently deal with overruns in soft real-time systems with highly variable task execution times and proposes Randomized Dropping (RD), a novel overrun handling mechanism. RD is able to bound task overruns in a probabilistic manner, thus providing ''soft'' task isolation. The paper shows how to combine RD with priority-driven and rate-based scheduling algorithms, and how to analyze the resulting system. Performance evaluation and comparison between simulation and analytical results are discussed.