Using Content-Addressable Networks for Load Balancing in Desktop Grids
| dc.contributor.author | Kim, Jik-Soo | |
| dc.contributor.author | Keleher, Peter | |
| dc.contributor.author | Marsh, Michael | |
| dc.contributor.author | Bhattacharjee, Bobby | |
| dc.contributor.author | Sussman, Alan | |
| dc.date.accessioned | 2007-04-10T20:01:16Z | |
| dc.date.available | 2007-04-10T20:01:16Z | |
| dc.date.issued | 2007-03-29 | |
| dc.description.abstract | Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently matching incoming jobs to available system resources and achieving good load balance in a fully decentralized and heterogeneous computing environment is a challenging problem. In this paper, we extend our prior work with a new decentralized algorithm for maintaining approximate global load information, and a job pushing mechanism that uses the global information to push jobs towards underutilized portions of the system. The resulting system more effectively balances load and improves overall system throughput. Through a comparative analysis of experimental results across different system configurations and job profiles, performed via simulation, we show that our system can reliably execute Grid applications on a distributed set of resources both with low cost and with good load balance. | en |
| dc.format.extent | 192812 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4355 | |
| dc.language.iso | en_US | en |
| dc.relation.ispartofseries | UM Computer Science Department | en |
| dc.relation.ispartofseries | CS-TR-4863 | en |
| dc.relation.ispartofseries | UMIACS | en |
| dc.relation.ispartofseries | UMIACS-TR-2007-16 | en |
| dc.title | Using Content-Addressable Networks for Load Balancing in Desktop Grids | en |
| dc.type | Technical Report | en |