Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: data management of asymmetric communication environments, in Proc. ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (1995).
A. Bar-Noy and R. E. Ladner, Windows scheduling problems for broadcast systems, SIAM J. Comput. 32(4) (2003) 1091–1113.
S. Baruah, G. Buttazzo, S. Gorinsky and G. Lipari, Scheduling periodic task systems to minimize output jitter, in Int. Conference on Real-Time Computing Systems and Applications, (IEEE Computer Society Press, Hong Kong Dec. 1999) pp. 62–69.
Bluetooth technical specifications, version 1.1. Available from http://www.bluetooth.com/ (Feb. 2001).
Z. Brakerski, A. Nisgav and B. Patt-Shamir, General perfectly periodic scheduling, in Proc. 21st Ann. ACM Symp. on Principles of Distributed Computing, (Monterey, CA July 2002) pp. 163–172.
M. B. Jones, D. Roşu and M.-C. Roşu, CPU reservations and time constraints: Efficient, predictable scheduling of independent activities, in 6th ACM Symposium on Operating Systems Principles (SOSP), (Saint-Malo, France Oct. 1997) pp. 198–211.
C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, J. ACM 20(1) (Jan. 1973) 46–61.
N. Naaman and R. Rom Scheduling real-time constant bit rate flows over a TDMA channel, Technical Report CCIT 410, Dept. of Electrical Engineering, Technion (Dec. 2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Zvika Brakerski was born in 1981. He received a masters’ degree from Tel-Aviv University in 2002 and is currently employed as an Electric Engineer.
Boaz Patt-Shamir received his PhD from MIT in 1995. He was an assistant professor in Northeastern University until 1997, and then he joined the Dept. of Electrical Engineering in Tel Aviv University, where he directs the Computer Communication and Multimedia Laboratory. He held visiting positions at MIT, Boston University, Bellcore, and HP Labs.
Rights and permissions
About this article
Cite this article
Brakerski, Z., Patt-Shamir, B. Jitter-approximation tradeoff for periodic scheduling. Wireless Netw 12, 723–731 (2006). https://doi.org/10.1007/s11276-006-6531-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-006-6531-4