Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
QEM: A Scheduling Method for Wireless Broadcast Data
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Dispatching in perfectly-periodic schedules
Journal of Algorithms
Efficient algorithms for periodic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Windows scheduling of arbitrary length jobs on parallel machines
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On distributed smooth scheduling
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Adaptive general perfectly periodic scheduling
Information Processing Letters
Jitter-approximation tradeoff for periodic scheduling
Wireless Networks
Adaptive general perfectly periodic scheduling
Information Processing Letters
Scheduling on-demand data broadcast in mixed-type request environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In a perfectly-periodic schedule, time is divided into time-slots, and each client is scheduled precisely every some predefined number of slots, called the period of that client. Periodic schedules are useful in wireless communication and other settings. The quality of a schedule is measured by the proportion between the requested and the granted periods: either the maximum over all jobs, or the average. There exist good scheduling algorithms for the average measure in the unit-length single-server model in which all jobs are one slot long, and at most one job is served in each time unit. In this paper we study the general model, where each job may have a different length, and m jobs can be served in parallel for some given m. We give a lower bound for this model which demonstrates the inherent difficulty of multiple lengths, and present a sequence of algorithms, culminating in an algorithm for the general case which is asymptotically optimal under the maximum ratio measure (and hence also the average ratio measure). The new algorithms utilize new techniques which are rather different from the known algorithms used for the unit-length model. Some of the algorithms improve on the best known bounds for the unit-length model.