Robust Network Supercomputing with Malicious Processes

DOI10.1007/11864219_33zbMath1155.68563OpenAlexW2113035722MaRDI QIDQ3524326

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

zbMATH Keywords

reliabilityfault-tolerancerandomized algorithmsdistributed algorithmsinternet supercomputing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (3)

Analysis of linearly elastic inextensible frames undergoing large displacement and rotation ⋮ Verifiable crowd computing: coping with bounded rationality ⋮ Dealing with undependable workers in decentralized network supercomputing

This page was built for publication: Robust Network Supercomputing with Malicious Processes