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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider online algorithms for pull-based broadcast scheduling. In thissetting there are n pages of information at a server and requests for pagesarrive online. When the server serves (broadcasts) a page p, all outstandingrequests for that page are satisfied. We study two related metrics, namelymaximum response time (waiting time) and maximum delay-factor and theirweighted versions. We obtain the following results in the worst-case onlinecompetitive model.  - We show that FIFO (first-in first-out) is 2-competitive even when the pagesizes are different. Previously this was known only for unit-sized pages [10]via a delicate argument. Our proof differs from [10] and is perhaps moreintuitive.  - We give an online algorithm for maximum delay-factor that isO(1/eps^2)-competitive with (1+\eps)-speed for unit-sized pages and with(2+\eps)-speed for different sized pages. This improves on the algorithm in[12] which required (2+\eps)-speed and (4+\eps)-speed respectively. In additionwe show that the algorithm and analysis can be extended to obtain the sameresults for maximum weighted response time and delay factor.  - We show that a natural greedy algorithm modeled after LWF(Longest-Wait-First) is not O(1)-competitive for maximum delay factor with anyconstant speed even in the setting of standard scheduling with unit-sized jobs.This complements our upper bound and demonstrates the importance of thetradeoff made in our algorithm.

Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling