Using Content-Addressable Networks for Load Balancing in Desktop Grids

dc.contributor.authorKim, Jik-Soo
dc.contributor.authorKeleher, Peter
dc.contributor.authorMarsh, Michael
dc.contributor.authorBhattacharjee, Bobby
dc.contributor.authorSussman, Alan
dc.date.accessioned2007-04-10T20:01:16Z
dc.date.available2007-04-10T20:01:16Z
dc.date.issued2007-03-29
dc.description.abstractDesktop 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.extent192812 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4355
dc.language.isoen_USen
dc.relation.ispartofseriesUM Computer Science Departmenten
dc.relation.ispartofseriesCS-TR-4863en
dc.relation.ispartofseriesUMIACSen
dc.relation.ispartofseriesUMIACS-TR-2007-16en
dc.titleUsing Content-Addressable Networks for Load Balancing in Desktop Gridsen
dc.typeTechnical Reporten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
paper.pdf
Size:
188.29 KB
Format:
Adobe Portable Document Format