Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
