Chord: A scalable peer-to-peer lookup service for internet applications
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
XtremWeb: A Generic Global Computing System
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Entropia: architecture and performance of an enterprise desktop grid system
Journal of Parallel and Distributed Computing - Special issue on computational grids
Toward a Synergy Between P2P and Grids
IEEE Internet Computing
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
A super-peer model for resource discovery services in large-scale grids
Future Generation Computer Systems
Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Aneka: Next-Generation Enterprise Grid Platform for e-Science and e-Business Applications
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
A super-peer model for multiple job submission on a grid
Euro-Par'06 Proceedings of the CoreGRID 2006, UNICORE Summit 2006, Petascale Computational Biology and Bioinformatics conference on Parallel processing
Future Generation Computer Systems
A proximity-aware load balancing in peer-to-peer-based volunteer computing systems
The Journal of Supercomputing
The Journal of Supercomputing
| Hi-index | 0.00 |
Many types of distributed scientific and commercial applications require the submission of a large number of independent jobs. One highly successful, and low cost mechanism for acquiring the necessary compute power is the ''public-resource computing'' paradigm, which exploits the computational power of private computers. Recently decentralized peer-to-peer and super-peer technologies have been proposed for adaptation in these systems. We designed a super-peer protocol for the execution of jobs based upon the volunteer requests of workers, and a super-peer overlay for performing two kinds of matching operations: the assignment of jobs to workers and the download of input data needed for job execution. This paper analyzes a dynamic and general scenario, in which: (i) workers can leave the network at any time; (ii) each job is executed multiple times, either to obtain better statistical accuracy or to perform parameter sweep analysis; and, (iii) input data is replicated and distributed to multiple data caches on-the-fly. A simulation study was performed to analyze the super-peer protocol and specifically evaluate performance in terms of execution time, utilization of data centers, load balancing, and ability to efficiently scale with the number of jobs and the network size.