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 present a scheduling technique that guarantees asymptotically a performance within a factor of four of the optimum for a subclass of parallel programs even if communication is expensive on the target machine. This class includes programs for FFT and matrixmultiplication for which we give practical results on a Parsytec Power-Xplorer and on a workstation-cluster.

Optimization of parallel programs on machines with expensive communication