Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
HARTIK 3.0: a portable system for developing real-time applications
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
A multiframe model for real-time tasks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
On task schedulability in real-time control systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Bounding completion times of jobs with arbitrary release times and variable execution times
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Scheduling real-time applications in an open environment
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Greedy reclamation of unused bandwidth constant-bandwidth servers
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Integration of dynamic voltage scaling and soft real-time scheduling for open mobile systems
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
User Focus in Consumer Terminals and Conditionally Guaranteed Budgets
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Resource Reservation in Dynamic Real-Time Systems
Real-Time Systems
Using resource reservation techniques for power-aware scheduling
Proceedings of the 4th ACM international conference on Embedded software
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times
IEEE Transactions on Computers
IEEE Transactions on Computers
Control-scheduling codesign of real-time systems: The control server approach
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Recent Advances in Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Overrun handling approaches for overload-prone soft real-time systems
Advances in Engineering Software
Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments
Journal of Parallel and Distributed Computing
Proceedings of the 2010 ACM Symposium on Applied Computing
A capacity sharing and stealing strategy for open real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
Implementing mixed criticality systems in Ada
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
Demand bound server: generalized resource reservation for hard real-time systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Formal simulation and analysis of the CASH scheduling algorithm in real-time maude
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Server-based scheduling of parallel real-time tasks
Proceedings of the tenth ACM international conference on Embedded software
An elastic mixed-criticality task model and its scheduling algorithm
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.01 |
In this paper, we present a general scheduling methodology for managing overruns in a real-time environment, where tasks may have different criticality and flexible timing constraints. The proposed method achieves isolation among tasks through a resource reservation mechanism which bounds the effects of task interference, but also performs efficient reclaiming of the unused computation times to relax the utilization constraints imposed by isolation. The enhancements achieved by the proposed approach resulted to be very effective with respect to classical reservation schemes. The performance has been evaluated by implementing the algorithm on a real-time kernel. The runtime overhead introduced by the scheduling mechanism has also been investigated with specific experiments, in order to be taken into account in the schedulability analysis. However, it resulted to be negligible in most practical cases.