Pinwheel scheduling with two distinct numbers
Theoretical Computer Science
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
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
Harmonic broadcasting is optimal
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Efficient Periodic Broadcast Technique for Digital VideoLibraries
Multimedia Tools and Applications
Pfair Scheduling of Generalized Pinwheel Task Systems
IEEE Transactions on Computers
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Nearly optimal perfectly periodic schedules
Distributed Computing - Special issue: Selected papers from PODC '01
Efficient schemes for broadcasting popular videos
Multimedia Systems
Windows Scheduling Problems for Broadcast Systems
SIAM Journal on Computing
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A general buffer scheme for the windows scheduling problem
Journal of Experimental Algorithmics (JEA)
Energy-efficient windows scheduling
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
The generalized windows scheduling problem for n jobs onmultiple machines is defined as follows: Given is a sequence,I =\ang(w1,l1),(w2, l2),...,(wn, ln) ofn pairs of positive integers that are associated with thejobs 1,2,...,n, respectively. The processing length of jobi is li slots (a slot is the processingtime of one length unit). The goal is to repeatedly andnon-preemptively schedule all the jobs on the fewest possibleparallel machines such that the gap (window) between twoconsecutive executions of the first slot of job i is at mostwi slots. This problem arises in push broadcastsystems in which data is transmitted on parallel channels.The problem is NP-hard even for unit-length jobs and a(1+Σ)-approximation algorithm is known for this case byapproximating the natural lower boundW(I)=Σ=1n(1/Wi). The techniques used for approximatingunit-length jobs cannot be applied for arbitrary-length jobs mainlybecause the optimal number of machines might be arbitrarily largerthan the generalized lower boundW(I)=Σ=1n(li/wi).Our main result is an 8-approximation algorithm for thegeneralized problem using new methods, different from those usedfor the unit-length case. We also present an algorithm that uses2(1+Σ)W(I)+ log wmax machinesand a greedy algorithm that is based on a new tree representationof schedules. The greedy algorithm is optimal for some special andsimulations show that it performs very well in practice.