Packet delay under the golden ratio weighted tdm policy in a multiple-access channel
IEEE Transactions on Information Theory
Exact computation of optimal inventory policies over an unbounded horizon
Mathematics of Operations Research
Pinwheel scheduling with two distinct numbers
Theoretical Computer Science
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
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
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
QEM: A Scheduling Method for Wireless Broadcast Data
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
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
Windows scheduling problems for broadcast systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
General perfectly periodic scheduling
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for periodic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
On distributed smooth scheduling
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Smooth scheduling under variable rates or the analog-digital confinement game
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Adaptive general perfectly periodic scheduling
Information Processing Letters
Adaptive general perfectly periodic scheduling
Information Processing Letters
Harmonic block windows scheduling through harmonic windows scheduling
MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems
Customized newspaper broadcast: data broadcast with dependencies
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
We consider the problem of scheduling a set of jobs on a single shared resource using time-multiplexing. A perfectly-periodic schedule is one where resource time is divided into equal size “time-slots” quanta, and each job gets a time slot precisely every fixed interval of time (the period of the job). Periodic schedules are advantageous in distributed settings with synchronized clocks, since they require very little communication to establish, and thereafter no additional communication overhead is needed.In this work we study the case where each job i has a given demand probability wi, and the goal is to design a perfectly-periodic schedule that minimizes the average time a random client waits until its job is executed. The problem is known to be NP-hard. The best known polynomial algorithm to date guarantees average waiting time of at most 3/2 opt + O(log M), where opt is the optimal waiting time. In this paper, we develop a tree-based methodology for periodic scheduling, and using new general results, we derive algorithms with better bounds. A key quantity in our methodology is a1 def = √ max {wi}/ &Sgr; √ wi. We compare the cost of a solution provided by our algorithms to the cost of a solution to a relaxed (non-integral) version of the problem. Our asymptotic tree-based algorithm guarantees cost of at most 1 + a O(1) 1 times the cost of the relaxed problem; on the other hand, we prove that the cost of any integral solution is bounded from below by the cost of the relaxed solution times 1 + a&OHgr;(1)1. We also provide three other tree-based algorithms with cost bounded by the cost of the relaxed solution times 3/2, 4/3+O(a1), and 9/8+O(a1). Each one of our four algorithms is the best known for some range of values of a1.