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

Volunteer computing is being used successfully for large scale scientificcomputations. This research is in the context of Volpex, a programmingframework that supports communicating parallel processes in a volunteerenvironment. Redundancy and checkpointing are combined to ensure consistentforward progress with Volpex in this unique execution environment characterizedby heterogeneous failure prone nodes and interdependent replicated processes.An important parameter for optimizing performance with Volpex is the frequencyof checkpointing. The paper presents a mathematical model to minimize thecompletion time for inter-dependent parallel processes running in a volunteerenvironment by finding a suitable checkpoint interval. Validation is performedwith a sample real world application running on a pool of distributed volunteernodes. The results indicate that the performance with our predicted checkpointinterval is fairly close to the best performance obtained empirically byvarying the checkpoint interval.

Checkpointing to minimize completion time for Inter-dependent Parallel Processes on Volunteer Grids