Elements of information theory
Elements of information theory
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The scheduling of maintenance service
Discrete Applied Mathematics
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Nearly optimal perfectly periodic schedules
Distributed Computing - Special issue: Selected papers from PODC '01
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Data Broadcast Scheduling: On-line and Off-line Algorithms
Data Broadcast Scheduling: On-line and Off-line Algorithms
General perfectly periodic scheduling
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Customized newspaper broadcast: data broadcast with dependencies
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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 |
In a perfectly-periodic schedule, time is divided into time-slots, and each client gets a time slot precisely every predefined number of time slots, called the period of that client. Periodic schedules are useful in mobile communication where they can help save power in the mobile device, and they also enjoy the best possible smoothness. In this paper we study the question of dispatching in a perfectly periodic schedule, namely how to find the next item to schedule, assuming that the schedule is already given somehow. Simple dispatching algorithms suffer from either linear time complexity per slot or from exponential space requirement. We show that if the schedule is given in a natural tree representation, then there exists a way to get the best possible running time per slot for a given space parameter, or the best possible space (up to a polynomial) for a given time parameter. We show that in many practical cases, the running time is constant and the space complexity is polynomial.