Resource Management Middleware for Dynamic, DependableReal-Time Systems
Real-Time Systems - Special issue on challenges in design and implementation of middlewares for real time systems
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems
The Journal of Supercomputing
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Template-Based Real-Time Dwell Scheduling with Energy Constraint
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Efficient Reclaiming in Reservation-Based Real-Time Systems with Variable Execution Times
IEEE Transactions on Computers
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Predicting computation time for advanced processor architectures
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.02 |
In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithms have different performance and complexity. Simulation was performed to compare their performance.