Off-campus University of Richmond users: To download campus access theses, please use the following link to log in to our proxy server with your university username and password.
Date of Award
5-2008
Document Type
Restricted Thesis: Campus only access
Degree Name
Bachelor of Science
Department
Mathematics
First Advisor
Dr. Barry Lawson
Abstract
Distributed volunteer computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power previously available only through the use of expensive clusters or supercomputers. However, distributed computations running in untrustworthy environments raise a number of security concerns, including computation integrity and data privacy. This paper presents efforts to secure distributed volunteer computations. In particular, we present a framework for determining optimal redundancy-based task distributions using genetic algorithms. We also extend previous efforts to determine assignment-minimizing optimal distributions. Finally, we present efforts to minimize the number of pre-computed tasks required for such redundancy schemes.
Recommended Citation
White, Andrew M., "Securing distributed volunteer computations : investigating techniques for effective and efficient task assignment" (2008). Honors Theses. 673.
https://scholarship.richmond.edu/honors-theses/673