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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

This paper studies pipelined algorithms for protecting distributed gridcomputations from cheating participants, who wish to be rewarded for tasks theyreceive but don't perform. We present improved cheater detection algorithmsthat utilize natural delays that exist in long-term grid computations. Inparticular, we partition the sequence of grid tasks into two interleavedsequences of task rounds, and we show how to use those rounds to devise thefirst general-purpose scheme that can catch all cheaters, even when cheaterscollude. The main idea of this algorithm might at first seemcounter-intuitive--we have the participants check each other's work. A naiveimplementation of this approach would, of course, be susceptible to collusionattacks, but we show that by, adapting efficient solutions to the parallelprocessor diagnosis problem, we can tolerate collusions of lazy cheaters, evenif the number of such cheaters is a fraction of the total number ofparticipants. We also include a simple economic analysis of cheaters in gridcomputations and a parameterization of the main deterrent that can be usedagainst them--the probability of being caught.

Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations