RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
From MaRDI portal
Publication:3144930
DOI10.1142/S0129626412500028zbMath1253.68046MaRDI QIDQ3144930
No author found.
Publication date: 12 December 2012
Published in: Parallel Processing Letters (Search for Journal in Brave)
cost; volunteer computing; task execution; dependable computing; malicious processors; public-resource computing
Related Items
Cites Work
- Computing Boolean functions from multiple faulty copies of input bits
- The Do-All problem with Byzantine processor failures
- Optimal decision strategies in Byzantine environments
- Voting mechanisms in distributed systems
- Finding parity in a simple broadcast network
- The Byzantine Generals Problem
- Performing Work Efficiently in the Presence of Faults
- Average-Case Lower Bounds for Noisy Boolean Decision Trees
- On boolean decision trees with faulty nodes
- Lower bounds for the complexity of reliable Boolean circuits with noisy gates
- Computing with Noisy Information
- Sabotage-tolerance mechanisms for volunteer computing systems
- Computation in Noisy Radio Networks
- Probability and Computing