Complex applications often require the execution of a large number of jobs in a distributed environment. 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. However, applications that are based on this paradigm currently rely upon centralized job assignment mechanisms that can hinder the achievement of performance requirements in terms of overall execution time, load balancing, fault-tolerance, reliability of execution results, scalability and so on. This paper extends a superpeer protocol, proposed earlier by this group, for the execution of jobs based upon the volunteer requests of workers. The paper introduces a distributed algorithm that aims to achieve a more efficient and fair distribution of jobs to workers. This is obtained by the definition of different roles that can be assumed by super-peers and ordinary nodes on the basis of their characteristics. A simulation study is carried out to analyze the performance of the super-peer protocol and demonstrate the advantage of distributing the job assignment process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
David P. Anderson. Public computing: Reconnecting people to science. In Proceedings of Conference on Shared Knowledge and the Web, pages 17-19, Madrid, Spain, November 2003.
David P. Anderson. Boinc: A system for public-resource computing and storage. In GRID ’04: Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing (GRID’04), pages 4-10, 2004.
David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky, and Dan Werthimer. Seti-home: an experiment in public-resource computing. Communications of the ACM, 45 (11),2002.
Peter Brucker. Scheduling Algorithms. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2001.
Climateprediction.net. See web site at http://climateprediction.net/.
B. Cohen. Incentives Build Robustness in BitTorrent. In Proceedings of the First Workshop on Economics of Peer-to-Peer Systems, June 2003.
Pasquale Cozza, Ian Kelley, Carlo Mastroianni, Domenico Talia, and Ian Taylor. Cacheenabled super-peer overlays for multiple job submission on grids. In Proceedings of the CoreGRID Workshop on Grid Middleware, Dresden, Germany, June 2007.
Pasquale Cozza, Carlo Mastroianni, Domenico Talia, and Ian Taylor. A super-peer protocol for multiple job submission on a grid. In Euro-Par 2006 Workshops, volume 4375 of Springer-Verlag LNCS, Dresden, Germany, 2007.
Einstein-home. See web site at http://einstein.phys.uwm.edu/.
GridOneD. See web site at http://www.gridoned.org/.
Klaus Krauter, Rajkumar Buyya, and Muthucumaru Maheswaran. A taxonomy and survey of grid resource management systems for distributed computing. Software-Practice and Experience, 32(2).
Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan, and P. Sadayappan. Distributed job scheduling on computational grids using multiple simultaneous requests. In Proceedings of the 11th IEEE Symposium on High Performance Distributed Computing, Edinburgh, UK, 2002.
Norihiro Umeda, Hidemoto Nakada, and Satoshi Matsuoka. Peer-to-peer scheduling system with scalable information sharing protocol. In Proceedings of the 2007 International Symposium on Applications and the Internet Workshops SAINT-W ’07, 2007.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Barbalace, D., Cozza, P., Mastroianni, C., Talia, D. (2008). P2P-based Job Assignment For Public Resource Computing. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds) Grid Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09457-1_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-09457-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09456-4
Online ISBN: 978-0-387-09457-1
eBook Packages: Computer ScienceComputer Science (R0)