Pipelined algorithms to detect cheating in long-term grid computations

DOI10.1016/j.tcs.2008.08.008zbMath1157.68071OpenAlexW2093122708MaRDI QIDQ959812

Michael T. Goodrich

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.008

zbMATH Keywords

securityparallel algorithmsgrid computingpipelined algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Checking the correctness of memories
• Checking the convexity of polytopes and the planarity of subdivisions
• Self-testing/correcting with applications to numerical problems
• Designing checkers for programs that run in parallel
• Searching for High-Value Rare Events with Uncheatable Grid Computing
• Designing programs that check their work
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pipelined algorithms to detect cheating in long-term grid computations