Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing

DOI10.1109/TC.2012.186MaRDI QIDQ5268367zbMATH OpenFDO

Authors Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro

Publication date 20 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Internet topics (68M11)

Cited in

(4)

• Verifiable crowd computing: coping with bounded rationality
• Game-theoretic model of a volunteer computing grid
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Verifiable crowd computing: coping with bounded rationality

This page was built for publication: Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268367)