The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2008 vol.19)
pp: 903-913
ABSTRACT
A sustainable, market-like computational grid has two characteristics: it must allow resource providers and resource consumers to make autonomous scheduling decisions; and both parties of providers and consumers must have sufficient incentives to stay and play in the market. In this paper, we formulate this intuition of optimizing incentives for both parties as a dual-objective scheduling problem. The two objectives identified are to maximize the success rate of job execution, and to minimize fairness deviation among resources. The challenge is to develop a grid scheduling scheme that enables individual participants to make autonomous decisions while produces a desirable emergent property in the grid system, namely, the two objectives are achieved simultaneously. We present an incentive-based scheduling scheme which utilizes a peer-to-peer decentralized scheduling framework, a set of local heuristic algorithms, and three market instruments of job announcement, price, competition degree. The performance of this scheme is evaluated via extensive simulation using synthetic and real workloads. The results show that our approach outperforms other scheduling schemes in optimizing incentives for both consumers and providers, leading to highly successful job execution and fair profit allocation.
INDEX TERMS
Grid Computing, scheduling, incentive, peer-to-peer, market
CITATION
Lijuan Xiao, Yanmin Zhu, Lionel M. Ni, Zhiwei Xu, "Incentive-Based Scheduling for Market-Like Computational Grids", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 7, pp. 903-913, July 2008, doi:10.1109/TPDS.2007.70791
REFERENCES
[1] Proc. IEEE, special issue on grid computing, M. Parashar and C.A. Lee, eds., vol. 93, no. 3, pp. 479-714, 2005.
[2] I. Foster and C. Kesselman, “Globus: A Metacomputing Infrastructure Toolkit,” Int'l J. High-Performance Computing Applications, vol. 11, no. 2, p. 115, 1997.
[3] M. Litzkow, M. Livny, and M. Mutka, “Condor: A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems (ICDCS '88), pp. 104-111, 1988.
[4] S.J. Chapin, D. Katramatos, J. Karpovich, and A. Grimshaw, “Resource Management in Legion,” Future Generation Computer Systems, vol. 15, nos. 5-6, pp. 583-594, 1999.
[5] F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S. Figueira, J. Hayes, G. Obertelli, J. Schopf, G. Shao, S. Smallen, N. Spring, A. Su, and D. Zagorodnov, “Adaptive Computing on the Grid Using Apples,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 369-382, Apr. 2003.
[6] H. Casanova and J. Dongarra, “NetSolve: A Network Server for Solving Computational Science Problems,” Int'l J. Supercomputer Applications and High-Performance Computing, vol. 11, no. 3, pp.212-223, 1997.
[7] T.W. Malone, R.E. Fikes, K.R. Grant, and M.T. Howard, “Enterprise: A Market-Like Task Scheduler for Distributed Computing Environments,” The Ecology of Computation, B.A.Huberman, ed., pp. 177-205, 1988.
[8] C.A. Waldspurger, T. Hogg, B.A. Huberman, J.O. Kephart, and S. Stornetta, “Spawn: A Distributed Computational Economy,” IEEE Trans. Software Eng., vol. 18, no. 2, pp.103-177, 1992.
[9] R. Buyya, D. Abramson, and S. Venugopal, “The Grid Economy,” Proc. IEEE, vol. 93, no. 3, pp. 698-714, 2005.
[10] R. Buyya, D. Abramson, and J. Giddy, “Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid,” Proc. Fourth Int'l Conf. High-Performance Computing in the Asia-Pacific Region (HPC Asia), 2000.
[11] O. Regev and N. Nisan, “The POPCORN Market: An Online Market for Computational Resources,” Proc. First Int'l Conf. Information and Computation Economies (ICE '98), pp. 148-157, 1998.
[12] R. Wolski, J.S. Plank, T. Bryan, and J. Brevik, “G-Commerce: Market Formulations Controlling Resource Allocation on the Computational Grid,” Proc. 15th Int'l Parallel and Distributed Processing Symp. (IPDPS '01), p. 8, 2001.
[13] K. Lai, L. Rasmusson, E. Adar, L. Zhang, and B.A. Huberman, “Tycoon: An Implementation of a Distributed, Market-Based Resource Allocation System,” Multiagent and Grid Systems, vol. 1, no. 3, pp. 169-182, 2005.
[14] P. Padala, C. Harrison, N. Pelfort, E. Jansen, M.P. Frank, and C. Chokkareddy, “OCEAN: The Open Computation Exchange and Arbitration Network, a Market Approach to Meta Computing,” Proc. Second Int'l Symp. Parallel and Distributed Computing, pp.185-192, 2003.
[15] J. Sherwani, N. Ali, N. Lotia, Z. Hayat, and R. Buyya, “Libra: A Computational Economy-Based Job Scheduling System for Clusters,” Software: Practice and Experience, vol. 34, no. 6, pp.573-590, 2004.
[16] D.E. Irwin, L.E. Grit, and J.S. Chase, “Balancing Risk and Reward in a Market-Based Task Service,” Proc. 13th Int'l Symp. High-Performance Distributed Computing (HPDC '04), pp. 160-169, 2004.
[17] R. Gupta, S. Sekhri, and A.K. Somani, “CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 11, pp.1306-1320, Nov. 2006.
[18] F. Yun, C. Jeffrey, C. Brent, S. Stephen, and V. Amin, “SHARP: An Architecture for Secure Resource Peering,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 133-148, 2003.
[19] Y. Zhu, L. Xiao, L.M. Ni, and Z. Xu, “Incentive-Based P2P Scheduling in Grid Computing,” Proc. Third Int'l Conf. Grid and Cooperative Computing (GCC '04), p. 209, 2004.
[20] L. Xiao, Y. Zhu, L.M. Ni, and Z. Xu, “GridIS: An Incentive-Based Grid Scheduling,” Proc. 19th IEEE Parallel and Distributed Processing Symp. (IPDPS '05), p. 65, 2005.
[21] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State,” Proc. 23rd IEEE Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 500-508, 2003.
[22] Y. Liu, Z. Zhuang, L. Xiao, and L.M. Ni, “A Distributed Approach to Solving Overlay Mismatching Problem,” Proc. 24th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 132-139, 2004.
[23] V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts,” Proc. ACM SIGCOMM '01, pp. 173-185, 2001.
[24] M.J. Gonzalez, “Deterministic Processor Scheduling,” ACM Computing Surveys, vol. 9, no. 3, pp. 173-204, 1997.
[25] J. Nakai, “Pricing Computing Resources: Reading between the Lines and Beyond,” Technical Report NAS-01-010, 2002.
[26] Parallel Workloads Archive, http://www.cs.huji.ac.il/labs/parallelworkload /, 2007.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool