NEAR-OPTIMAL HEURISTIC SOLUTIONS FOR TRUNCATED HARMONIC WINDOWS SCHEDULING AND HARMONIC GROUP WINDOWS SCHEDULING by
نویسنده
چکیده
منابع مشابه
Generating asymptotically optimal broadcasting schedules to minimize average waiting time
The performance of a Video-on-Demand broadcasting scheme is commonly evaluated by the maximum waiting time encountered by the customer before viewing can start. This paper addresses the issue of minimizing the average waiting time. Recently, we proposed Harmonic Block Windows scheduling to specifically minimize the average waiting time for given bandwidth. Here, we present an efficient heuristi...
متن کاملHarmonic Block Windows Scheduling Through Harmonic Windows Scheduling
Broadcasting offers a bandwidth-efficient way of delivering popular content in media-on-demand (MoD) systems. Harmonic windows scheduling (HWS) is a mathematical framework that is relevant to bandwidth minimization in MoD broadcasting. Given c channels, the optimal HWS problem tries to schedule as many pages of a video as possible in the c channels. Let κ be the largest integer n satisfying Hn ...
متن کاملMinimizing Average Startup Delay of Periodic VOD Broadcasting Schedules
Consider a video consisting of a sequence of fixedsize pages to be transmitted over c broadcast channels such that a page fits in a slot of a channel. In Shifted Harmonic Windows scheduling, page i must be scheduled at least once in any consecutive i+m−1 slots for some integer m ≥ 1, to ensure continuous display of successive pages by the viewer, starting at the m slot boundary after tuning in....
متن کاملAn Omniscient Scheduling Oracle for Systems with Harmonic Periods
Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides schedules for periodic task sets with harmonic periods and variable resource requirements. Three di erent job value functions are described and implemented. Each corresponds t...
متن کاملOn-line scheduling with forbidden zones
In various manufacturing and computing contexts there may be a certain period in each time interval, during which processing may continue but may not be initiated. We examine the problem of on-line scheduling in the presence of such forbidden zones, whose complements are starting time windows. We show that no on-line algorithm is better than 9 7 competitive, when minimizing the number of interv...
متن کامل