An alternate multiplicity-2 task assignment scheme for distributed computations

Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05

Volumn 1, Issue , 2005, Pages 59-65

  Szajda, Doug ^a   Owen, Jason ^a   Lawson, Barry ^a   Charlesworth, Arthur ^a   Kenney, E D ^a  

^a UNIVERSITY OF RICHMOND   (United States)

Author keywords

Collusion; Distributed computation; Probabilistic verification; Security

Indexed keywords

COLLUSION; COMPUTATIONAL POWER; DISTRIBUTED COMPUTATION; DISTRIBUTED COMPUTING; DISTRIBUTED COMPUTING PLATFORMS; PROBABILISTIC VERIFICATION; RUNNING-IN; SECURITY; SECURITY ISSUES; TASK ASSIGNMENTS; TASK TRACKING;

APPLICATIONS; DISTRIBUTED PARAMETER NETWORKS; PARALLEL PROCESSING SYSTEMS; PERSONAL COMPUTERS; QUALITY ASSURANCE; REDUNDANCY; SUPERCOMPUTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 63049087922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. The Folding@home Project. Stanford University. http://www.stanford.edu/ group/pandegroup/cosm/.
2. The Great Internet Mersenne Prime Search. http://www.mersenne.org/prime. htm.
3. P. Golle and I. Mironov. Uncheatable distributed computations. In Proceedings of the RSA Conference 2001, Cryptographers' Track, pages 425-441, San Francisco, CA, 2001. Springer.
4. The Search for Extraterrestrial Intelligence project. University of California, Berkeley. http://setiathome.berkeley.edu/.
5. D. Szajda, A. Charlesworth, B. Lawson, J. Owen, and E. Kenney. Collusion resistant redundancy for distributed metacomputations. Technical Report TR-05-02, Richmond, VA, 2005.
6. D. Szajda, B. Lawson, and J. Owen. Hardening functions for large-scale distributed computations. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, pages 216-224, Berkeley, CA, May 2003