General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction
IEEE Transactions on Computers
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Online computation and competitive analysis
Online computation and competitive analysis
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
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
A general buffer scheme for the windows scheduling problem
Journal of Experimental Algorithmics (JEA)
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A general buffer scheme for the windows scheduling problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Online inventory replenishment scheduling of temporary orders
Information Processing Letters
| Hi-index | 0.00 |
In this paper we study on-line windows scheduling (WS) of temporary items In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit Upon the arrival of an item with a window w, where w is a positive integer, the item has to be scheduled on a channel such that it will be broadcasted in the channel at least once every w time units until its departure With the on-line input of these temporary items, the problem is to minimize the maximum number of channels used over all time We give a 5-competitive on-line algorithm and show that there is a lower bound of 2–ε for any ε 0 on the competitive ratio of any on-line algorithm.