A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SETI@home: an experiment in public-resource computing
Communications of the ACM
Condor and preemptive resume scheduling
Grid resource management
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Distributed computing in practice: the Condor experience: Research Articles
Concurrency and Computation: Practice & Experience - Grid Performance
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Dynamic thread assignment on heterogeneous multiprocessor architectures
Proceedings of the 3rd conference on Computing frontiers
Unstructured peer-to-peer networks for sharing processor cycles
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Designing a runtime system for volunteer computing
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Peer-to-peer for computational grids: mixing clusters and desktop machines
Parallel Computing
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
Peer-to-Peer Discovery of Computational Resources for Grid Applications
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Using content-addressable networks for load balancing in desktop grids
Proceedings of the 16th international symposium on High performance distributed computing
Design and implementation tradeoffs for wide-area resource discovery
HPDC '05 Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium
Trade-offs in matching jobs and balancing load for distributed desktop grids
Future Generation Computer Systems
Falkon: a Fast and Light-weight tasK executiON framework
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Toward loosely coupled programming on petascale systems
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Integrating categorical resource types into a P2P desktop grid system
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
WaveGrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
IEEE Internet Computing
A super-peer model for building resource discovery services in grids: design and simulation analysis
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Balanced Overlay Networks (BON): An Overlay Technology for Decentralized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Peer-to-Peer (P2P) desktop grid computing systems circumvent the performance bottleneck and limited scalability of centralized Grid architectures resulting in a massively scalable and robust system. We have designed a set of protocols that implement a distributed, decentralized desktop grid via P2P techniques. Incoming jobs having different types of resource requirements are matched with system nodes through proximity in an N-dimensional resource space. In this paper, we address problems that arise from static load balancing mechanisms for assigning jobs to nodes that can arise for various reasons, including the heterogeneity of the available nodes or the jobs to be run, and from stale information in the P2P system. We greatly improve upon our prior work by providing lightweight yet effective dynamic load balancing mechanisms to overcome load imbalances caused by the limitations of the initial static job assignment scheme. Unlike other systems, we can effectively support resource constraints of jobs during the course of redistribution since we simplify the problem of matchmaking through building a multi-dimensional resource space and mapping jobs and nodes to this space. Throughout extensive simulation results, we show that dynamic load balancing makes the overall system more scalable, by improving system throughput and response time with low additional overhead.