Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
General perfectly periodic scheduling
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Scheduling Periodic Task Systems to Minimize Output Jitter
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Windows Scheduling Problems for Broadcast Systems
SIAM Journal on Computing
Windows scheduling of arbitrary-length jobs on multiple machines
Journal of Scheduling
Perfect periodic scheduling for three basic cycles
Journal of Scheduling
| Hi-index | 0.00 |
We consider an asymmetric wireless communication setting, where a server periodically broadcasts data items to different mobile clients. The goal is to serve items into a prescribed rate, while minimizing the energy consumption of the mobile users. Abstractly, we are presented with a set of jobs, each with a known execution time and a requested period, and the task is to design a schedule for these jobs over a single shared resource without preemption. Given any solution schedule, its period approximation is the maximal factor by which the average period of a job in the schedule is blown up w.r.t. its requested period, and the jitter is roughly the maximal variability of times between two consecutive occurrences of the same job. Schedules with low jitter allow the mobile devices to save power by having their receivers switched off longer. In this paper we consider a scenario where clients may be willing to settle for non-optimal period approximation so that the jitter is improved. We present a parametric jitter-approximation tradeoff algorithm that allows us to choose various combinations between jitter optimality and period optimality for any given set of jobs.