Economy-Based Computing with WebCom

Authors: Adarsh Patil, David A. Power, John P. Morrison

Abstract:

Grid environments consist of the volatile integration of discrete heterogeneous resources. The notion of the Grid is to unite different users and organisations and pool their resources into one large computing platform where they can harness, inter-operate, collaborate and interact. If the Grid Community is to achieve this objective, then participants (Users and Organisations) need to be willing to donate or share their resources and permit other participants to use their resources. Resources do not have to be shared at all times, since it may result in users not having access to their own resource. The idea of reward-based computing was developed to address the sharing problem in a pragmatic manner. Participants are offered a reward to donate their resources to the Grid. A reward may include monetary recompense or a pro rata share of available resources when constrained. This latter point may imply a quality of service, which in turn may require some globally agreed reservation mechanism. This paper presents a platform for economybased computing using the WebCom Grid middleware. Using this middleware, participants can configure their resources at times and priority levels to suit their local usage policy. The WebCom system accounts for processing done on individual participants- resources and rewards them accordingly.

Keywords: WebCom, Economy-based computing, WebComGrid Bank Reward, Condensed Graph, Distributor, Accounting, GridPoint.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1083075

References:

[1] Mojo nation. link: http://sourceforge.net/projects/mojonation/
[2] Platform Computing: Symphony. http://www.platform.com/products/Symphony/.
[3] Sun n1 grid engine 6, http://www.sun.com/software/gridware/.
[4] T. Ackemann, R. Gold, C. Mascolo, and W. Emmerich. Incentives in peer-to-peer and grid networking. Torsten Ackemann, Richard Gold, Cecilia Mascolo, and Wolfgang Emmerich. Incentives in peer-to-peer and grid networking. UCL Research. Note RN/02/24, 2002.
[5] E. Adar and B. Huberman. Free riding on gnutella. Eytan Adar and Bernardo A. Huberman. Free riding on gnutella. Technical report, Xerox PARC, 10 Aug. 2000.
[6] S. Agrawal, J. Dongarra, K. Seymour, and S. Vadhiyar. Net-Solve: Past, Present, and Future - a Look at a Grid Enabled Server.
[7] D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. Seti@home: an experiment in public-resource computing. Communications of the ACM, 45(11):56-61, November 2002.
[8] R. Buyya. Economic-based distributed resource management and scheduling for grid computing. Ph.D Dissertation.
[9] R. Buyya, D. Abramson, J. Giddy, and H. Stockinger. Economic models for resource management and scheduling in grid computing, 2002.
[10] I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. Lecture Notes in Computer Science, 2009:46+, 2001.
[11] E. David, R. Azoulay-Schwartz, and S. Kraus. An English auction protocol for multi-attribute items. In AAMAS -02: Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent- Mediated Electronic Commerce IV, Designing Mechanisms and Systems, pages 52-68, London, UK, 2002. Springer-Verlag.
[12] S. N. Foley, B. P. Mulcahy, T. B. Quillinan, M. O-Connor, and J. P. Morrison. Supporting heterogeneous middleware security policies in webcom. Journal of High Speed Networks, 15(3):301-313, 2006.
[13] S. N. Foley, T. B. Quillinan, M. O-Connor, B. P. Mulcahy, and J. P. Morrison. A framework for heterogeneous middleware security.
[14] I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115-128, Summer 1997.
[15] A. Grimshaw, A. Ferrari, F. Knabe, and M. Humphrey. Legion: An operating system for wide-area computing. IEEE Computer, 32((5)): 1999.
[16] P. Haddawy, N. Rujikeadkumjorn, K. Dhananaiyapergse, and C. Cheng. Balanced matching of buyers and sellers in e-market places:the barter trade exchange model. In ICEC -04: Proceedings of the 6th international conference on Electronic commerce, pages 85-94, New York, NY, USA, 2004. ACM Press.
[17] L. He and T. R. Ioerger. Task-oriented computational economic based distributed resource allocation mechanisms for computational grids. In IC-AI, pages 462-468, 2004.
[18] O. Heckmann, A. Bock, A. Mauthe, and R. Steinmetz. The eDonkey File-Sharing Network. In Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications, InIformatik 2004, Sept. 2004.
[19] J. Hoskins. IBM On Demand Technology Made Simple: Understanding the IBM On Demand Business Strategy and Underlying Products (Max Facts Guidebook series). Maximum Press, Gulf Breeze, FL, USA, 2005.
[20] A. Kothari, S. Suri, and Y. Zhou. Bandwidth constrained allocation in grid computing, 2003.
[21] R. Kothari, M. K. Mohania, and Y. Kambayashi. Increasing realized revenue in a web based dutch auction. In EC-WEB -02: Proceedings of the Third International Conference on Ecommerce and Web Technologies, pages 7-16, London, UK, 2002. Springer-Verlag.
[22] S. Kungpisdan, B. Srinivasan, and P. D. Le. A secure wireless prepaid micropayment protocol with extension to postpaid micropayment. In iiWAS, 2004.
[23] K. Kutzner and T. Fuhrmann. Measuring large overlay networks- the overnet example. In Konferenzband der 14. Fachtagung Kommunikation in Verteilten Systemen (KiVS 2005), Kaiserslautern, Germany, 2005.
[24] S. M. Larson, C. D. Snow, M. R. Shirts, and V. S. Pande. Folding@home and genome@home: Using distributed computing to tackle previously intractable problems in computational biology. Computational Genomics, 2002.
[25] A. Manning. A generalised model of monopsony. The Economic Journal, 116(508):84-100, January 2006.
[26] P. P. Mcafee and J. Mcmillan. Auctions and bidding. Journal of Economic Literature, 25(2):699-738, 1987.
[27] M. J. Miranda. Numerical strategies for solving the nonlinear rational expectations commodity market model. Comput. Econ., 11(1-2):71-87, 1998.
[28] J. P. Morrison. Condensed Graphs: Unifying Availability- Driven, Coercion-Driven and Control-Driven Computing. PhD thesis, Technische Universiteit Eindhoven, 1996.
[29] J. P. Morrison, B. Clayton, D. A. Power, and A. Patil. Webcom-G:Grid enabled metacomputing. The Journal of Neural, Parallel and Scientific Computation. Special Issue on Grid Computing. 2004(12)(2):419-438, April 2004.
[30] K. Peng, C. Boyd, E. Dawson, and K. Viswanathan. Five sealed-bid auction models. In ACSW Frontiers -03: Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003, pages 77-86, Darlinghurst, Australia, Australia, 2003. Australian Computer Society, Inc.
[31] T. B. Quillinan, B. C. Clayton, and S. N. Foley. GridAdmin: Decentralising grid administration using trust management.
[32] A. L. Rosenberg. Accountable web-computing. IEEE Trans. Parallel Distrib. Syst., 14(2):97-106, 2003.
[33] L. F. G. Sarmenta. Volunteer computing.
[34] M. Shubik. A double auction market: Teaching, experiment, and theory. Simul. Gaming, 36(2):166-182, 2005.
[35] M. A. Spence. Monopoly, quality, and regulation. The Bell Journal of Economics, 6(2):417-429, 1975.
[36] P. Strong. Enterprise grid computing. Queue, 3(6):50-59, 2005.
[37] The napster website.
[38] X. Vives. Oligopoly Pricing: Old Ideas and New Tools. The MIT Press, March 2000.
[39] R. Wolski, J. Brevik, J. S. Plank, and T. Bryan. Grid resource allocation and control using computational economies. In F. Berman, G. Fox, and 7361529A. Hey, editors, Grid Computing: Making Th e Global Infrastructure a Reality. John Wiley & Sons, 2003.
[40] R. Wolski, J. S. Plank, J. Brevik, and T. Bryan. Analyzing market-based resource allocation strategies for the computational grid. International Journal of High Performance Computing Applications, 15(3):258-281, Fall 2001.
[41] Y. Zhu, L. Xiao, L. M. Ni, and Z. Xu. Incentive-based p2p scheduling in grid computing. In GCC, pages 209-216, 2004.