Windows scheduling of arbitrary length jobs on parallel machines
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Jitter-approximation tradeoff for periodic scheduling
Wireless Networks
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
Optimal delay for media-on-demand with pre-loading and pre-buffering
Theoretical Computer Science
An efficient scheme for broadcasting popular videos at low buffer demand
Computer Communications
A general buffer scheme for the windows scheduling problem
Journal of Experimental Algorithmics (JEA)
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Broadcasting scheme with low client buffers and bandwidths for video-on-demand applications
Multimedia Tools and Applications
Periodic scheduling with obligatory vacations
Theoretical Computer Science
A smooth broadcasting scheme for VBR-encoded hot videos
Computer Communications
Energy-efficient windows scheduling
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
Optimal delay for media-on-demand with pre-loading and pre-buffering
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On-line windows scheduling of temporary items
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A general buffer scheme for the windows scheduling problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Windows scheduling of arbitrary-length jobs on multiple machines
Journal of Scheduling
Online inventory replenishment scheduling of temporary orders
Information Processing Letters
Hi-index | 0.00 |
The windows scheduling problem is defined by the positive integers n, h, and w1, ...,wn. There are n pages where the window wi is associated with page i, and h is the number of slotted channels available for broadcasting the pages. A schedule that solves the problem assigns pages to slots such that the gap between any two consecutive appearances of page i is at most wi slots. We investigate two optimization problems. (i) The optimal windows scheduling problem: given w1, ..., wn find a schedule in which h is minimized. (ii) The optimal harmonic windows scheduling problem: given h find a schedule for the windows wi = i in which n is maximized. The former is a formulation of the problem of minimizing the bandwidth in push systems that support guaranteed delay, and the latter is a formulation of the problem of minimizing the startup delay in media-on-demand systems. For the optimal windows scheduling problem we present an algorithm that constructs asymptotically close to optimal schedules, and for the optimal harmonic windows scheduling problem we show how to achieve the largest known n's for all values of h.