General parallel computations on desktop grid and P2P systems
- James C. Browne ,
- Madulika Yalamanchi ,
- Kevin Kane ,
- Karthikeyan Sankaralingam
LCR '04: Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems |
Published by Association for Computing Machinery, Inc.
This paper defines the requirements for effective execution of iterative computations requiring communication on a desktop grid. It then proposes a combination of a p2p communication model, an algorithmic approach (asynchronous iterations) and a programming model which has promise for satisfying those requirements. Experimental results from an implementation of asynchronous algorithms in pure p2p system will be given. The integration of the p2p communication model with a commercially supported implementation of the SETI@Home desktop grid system to yield a prototype implementation of a desktop grid with communication among its hosts is described and some very preliminary results from application of the extended desktop grid for computation of Google pageranks and solution of linear systems are given. The desktop grid prototype preserves anonymity among desktop hosts, supports dynamic communication set membership and enables transparent replication of computations for fault tolerance.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. The definitive version of this paper can be found at ACM's Digital Library --http://www.acm.org/dl/.