End-to-end scheduling to meet deadlines in distributed systems
End-to-end scheduling to meet deadlines in distributed systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distance-Constrained Scheduling and Its Applications to Real-Time Systems
IEEE Transactions on Computers
Time Slot Allocation for Real-Time Messages with Negotiable Distance Constrains
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
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
Distributed pinwheel scheduling with end-to-end timing constraints
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Fixed-Priority End-To-End Scheduling in Distributed Real-Time Systems
Fixed-Priority End-To-End Scheduling in Distributed Real-Time Systems
Template-based scheduling algorithms for real-time tasks with distance constraints
Template-based scheduling algorithms for real-time tasks with distance constraints
Scheduling Real-Time Dwells Using Tasks with Synthetic Periods
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Radar Dwell Scheduling Considering Physical Characteristics of Phased Array Antenna
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Integrated Resource Management and Scheduling with Multi-Resource Constraints
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Real-time digital signal processing of component-oriented phased array radars
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Utility Accrual Real-Time Scheduling under Variable Cost Functions
IEEE Transactions on Computers
| Hi-index | 0.01 |
Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible intervals for dealing with the temporal distance constraints. In order to increase the freedom that the scheduler can offer a high-level resource manager, we introduce a technique for nesting and interleaving dwells online while accounting for the energy constraint that radar systems need to satisfy. Further, in radar systems, the task set changes frequently and we advocate the use of finite horizon scheduling in order to avoid the pessimism inherent in schedulers that assume a task will execute forever. The combination of feasible intervals and online dwell packing allows modular schedule updates whereby portions of a schedule can be altered without affecting the entire schedule, hence reducing the complexity of the scheduler. Through extensive simulations we validate our claims of providing greater scheduling flexibility without compromising on performance when compared with earlier work based on templates constructed offline. We also evaluate the impact of two parameters in our scheduling approach: the template length (or the extent of dwell nesting and interleaving) and the length of the finite horizon.