Trade-offs in Matching Jobs and Balancing Load for Distributed Desktop Grids
In Future Generation Computer Systems, 24(5): 415-424, 2008.
Jik-Soo Kim,Beomseok Nam,Peter Keleher,Michael Marsh,Bobby Bhattacharjee,Alan Sussman
Abstract:
Desktop grids can achieve tremendous computing power at low cost
through opportunistic sharing of resources.
However, traditional client-server Grid architectures do not deal with
all types of failures, and do not always cope well with very dynamic
environments.
This paper describes the design of a desktop grid implemented over a
modified Peer-to-Peer (P2P) architecture.
The underlying P2P system is decentralized and inherently adaptable,
giving the Grid robustness, scalability, and the ability to cope with
dynamic environments, while still efficiently mapping application
instances to available resources throughout the system.
We use simulation to compare three different types of matching
algorithms under differing workloads.
Overall, the P2P approach produces significantly lower wait times than
prior approaches, while adapting efficiently to the dynamic
environment.
@article{fgcs08,
title = "Trade-offs in Matching Jobs and Balancing Load for Distributed Desktop Grids",
author = "Jik-Soo Kim,Beomseok Nam,Peter Keleher,Michael Marsh,Bobby Bhattacharjee,Alan Sussman",
journal = {Future Generation Computer Systems},
pages = {415-424},
volume = {24},
issue = {5},
year = {2008},
}
Available: bibtex, abstract, 
Edit