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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A coflow is a collection of parallel flows belonging to the same job. It hasthe all-or-nothing property: a coflow is not complete until the completion ofall its constituent flows. In this paper, we focus on optimizing\emph{coflow-level delay}, i.e., the time to complete all the flows in acoflow, in the context of an $N\times N$ input-queued switch. In particular, wedevelop a throughput-optimal scheduling policy that achieves the best scalingof coflow-level delay as $N\rightarrow\infty$. We first derive lower bounds onthe coflow-level delay that can be achieved by any scheduling policy. It isobserved that these lower bounds critically depend on the variability of flowsizes. Then we analyze the coflow-level performance of some existingcoflow-agnostic scheduling policies and show that none of them achievesprovably optimal performance with respect to coflow-level delay. Finally, wepropose the Coflow-Aware Batching (CAB) policy which achieves the optimalscaling of coflow-level delay under some mild assumptions.

Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms