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

In the past decade, increasingly network scheduling techniques have beenproposed to boost the distributed application performance. Flow-level metrics,such as flow completion time (FCT), are based on the abstraction of flows yetthey cannot capture the semantics of communication in a cluster application.Being aware of this problem, coflow is proposed as a new network abstraction.However, it is insufficient to reveal the dependencies between computation andcommunication. As a result, the real application performance can be hurt,especially in the absence of hard barriers. Based on the computation DAG of theapplication, we propose an expressive abstraction namely metaflow that residesin the middle of the two extreme points of flows and coflows. Evaluationresults show that metaflow-based scheduling can outperform the coflow-basedalgorithm by 1.78x.

Metaflow: A DAG-Based Network Abstraction for Distributed Applications