Robust Network Supercomputing with Malicious Processes
DOI10.1007/11864219_33zbMATH Open1155.68563OpenAlexW2113035722MaRDI QIDQ3524326FDOQ3524326
Authors: Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Schwarzmann 
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11864219_33
Recommendations
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
- Brief announcement: Decentralized network supercomputing in the presence of malicious and crash-prone workers
- Dealing with undependable workers in decentralized network supercomputing
- Dealing with undependable workers in decentralized network supercomputing
- Principles of Distributed Systems
Randomized algorithms (68W20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (11)
- Analysis of linearly elastic inextensible frames undergoing large displacement and rotation
- Verifiable crowd computing: coping with bounded rationality
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
- Sabotage-tolerance mechanisms for volunteer computing systems
- Dealing with undependable workers in decentralized network supercomputing
- Brief announcement: Achieving reliability in master-worker computing via evolutionary dynamics
- Brief announcement: Decentralized network supercomputing in the presence of malicious and crash-prone workers
- Principles of Distributed Systems
- Dealing with undependable workers in decentralized network supercomputing
- Verifiable crowd computing: coping with bounded rationality
- Title not available (Why is that?)
This page was built for publication: Robust Network Supercomputing with Malicious Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524326)
