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

Mapping applications onto heterogeneous platforms is a difficult challenge,even for simple application patterns such as pipeline graphs. The problem iseven more complex when processors are subject to failure during the executionof the application. In this paper, we study the complexity of a bi-criteriamapping which aims at optimizing the latency (i.e., the response time) and thereliability (i.e., the probability that the computation will be successful) ofthe application. Latency is minimized by using faster processors, whilereliability is increased by replicating computations on a set of processors.However, replication increases latency (additional communications, slowerprocessors). The application fails to be executed only if all the processorsfail during execution. While simple polynomial algorithms can be found forfully homogeneous platforms, the problem becomes NP-hard when tacklingheterogeneous platforms. This is yet another illustration of the additionalcomplexity added by heterogeneity.

Optimizing Latency and Reliability of Pipeline Workflow Applications