Finite-horizon scheduling of radar dwells with online template construction
Resource
Real-Time Systems 33 (1-3): 47-75
Journal
Real-Time Systems
Journal Volume
33
Journal Issue
1-3
Pages
47-75
Date Issued
2006
Author(s)
Abstract
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. © Springer Science + Business Media, LLC 2006.
Subjects
Energy constraints; Finite horizon; Radar dwell scheduling; Real-time scheduling
Type
journal article