Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Validating timing constraints in multiprocessor and distributed systems
Validating timing constraints in multiprocessor and distributed systems
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
ACM Transactions on Embedded Computing Systems (TECS)
Solving real-time scheduling problems with model-checking
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Resource management policies for real-time Java remote invocations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition, jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when scheduled on a priority-driven basis. It describes three algorithms for computing upper bounds on the completion times of jobs that have arbitrary release times and priorities. The first two are simple but do not yield sufficiently tight bounds, while the last one yields the tightest bounds but has the greatest complexity.