English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the pull-based broadcast scheduling model. In this model, thereare n unit-sized pages of information available at the server. Requests arriveover time at the server asking for a specific page. When the server transmits apage, all outstanding requests for the page are simultaneously satisfied, andthis is what distinguishes broadcast scheduling from the standard schedulingsetting where each job must be processed separately by the server. Broadcastscheduling has received a considerable amount of attention due to thealgorithmic challenges that it gives in addition to its applications inmulticast systems and wireless and LAN networks. In this paper, we give thefollowing new approximation results for two popular objectives:  - For the objective of minimizing the maximum flow time, we give the firstPTAS. Previously, it was known that the algorithm First-In-First-Out (FIFO) isa 2-approximation, and it is tight. It has been suggested as an open problem toobtain a better approximation.  - For the objective of maximizing the throughput, we give a0.7759-approximation which improves upon the previous best known0.75-approximation.  Our improved results are enabled by our novel rounding schemes and linearprogramming which can effectively reduce congestion in schedule which is oftenthe main bottleneck in designing scheduling algorithms based on linearprogramming. We believe that our algorithmic ideas and techniques could be ofpotential use for other scheduling problems.

Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling