Perfect periodic scheduling for three basic cycles
Journal of Scheduling
| Hi-index | 0.00 |
The perfectly periodic scheduling problem is to schedule a set of jobs such that each job is served occasionally, at fairly regular time intervals. For wireless broadcast systems, when a server periodically broadcasts data to different mobile clients, a perfectly periodic schedule provides no-jitter broadcasting and useful information to reduce power consumption for mobile devices. In this paper, we propose an efficient algorithm to determine a perfectly periodic schedule with low average delay. Our simulation results show that the new algorithm performs still well when the total requested bandwidth is high and the variance of requested period is large.