基于拍卖模型的网格资源管理与调度仿真研究
|
摘要
计算技术和网络技术的飞速发展,极大地促进了基于网络环境的科学应用研究和商用发展。许多领域对计算能力的要求越来越高,单台计算机己经很难满足计算需求。网格计算技术的产生正是各种应用对计算资源和计算能力不断增长的需求的结果,网格的最终目标是实现网络虚拟环境上的资源共享和协同工作。资源管理与调度机制是网格的核心服务之一,一个良好的资源管理与调度策略能高效地协调和分配网格资源,有效降低网格计算的总执行时间和总耗费,从而使网格达到最大的性能。本文分析了拍卖模型下的资源管理和调度机制,重点分析了组合拍卖模型下的资源管理和调度机制。
本文围绕如何高效合理地管理和调度网格资源,主要做了如下研究工作:
1、基于合作博弈论,探讨了如何将资源提供者形成网格虚拟组织联盟,来实现资源的组合利用。提出了一个资源管理系统用来支持虚拟组织联盟的形成。
2、探讨了网格资源管理中常见的几种拍卖机制,并详细介绍了基于经济学模型的Nimrod-G网格项目,重点讨论了它的拍卖机制及资源分配的特点。
3、重点探讨了组合拍卖机制在网格资源管理和调度中的应用。创建了基于组合拍卖的资源映射算法,不仅保证了资源信息的真实和映射结果的最优性,而且降低了交互量,满足用户的个性化和多样化的需求,从而实现了有效的资源调度与分配。
4、实现了基于组合拍卖的资源映射算法的仿真实验。实验结果表明,提出的算法和策略是可行的,能够较好的提高资源分配的效用。
The rapid growth of the technology of computing and network mostly promotes the scientific research and commercial application based on Internet. In many fields, there are more and more requests for the computing capacity and it is difficult for a single computer to undertake calculation task. As the result of the increasing requirements of various applications which need more calculative resources and capacities, the grid computing technology appears. The final goal of grid is to realize resource share and coordinating work in a virtual network environment. The resource management and scheduling mechanism is a part of the Grid core services. An excellent resource management and scheduling strategy can coordinate and schedule the grid resources effectively, it can effectively reduce the total run time and total expense in the grid computing as well, which will implement the purpose of maximizing the preference of the grid. This paper analyzes the resource management and scheduling mechanism based on the auction model, and focuses on analyzing the resource management and scheduling mechanism based on the combinational auction model.
This paper aims at how to manage and schedule the grid resources effectively and reasonably. The major research works are below:
1. Based on the coalitional game theory, we discuss how to make the grid resource providers form the grid virtual organization (VO) which is able to provide the composite resource. We also propose a resource management system that supports the VO formation.
2. We discuss some common auction mechanisms in grid resource management. We introduce the Nimrod-G grid project based on Economics model in detail and focus on discussing the auction mechanism and resource scheduling in the Nimrod-G grid project.
3. We discuss mainly how the combinational auction mechanism is used in grid resource management and scheduling. We also propose a resource mapping algorithm based on the combinational auction mechanism. The algorithm ensures not only the reality of resource information and the optimization of mapping result, but also reduces the interaction communication and meets the user requirement of personalization and diversification. The algorithm also realizes effective resource management and scheduling.
4. In this paper, we implement the simulation experiment of resource mapping algorithm based on the combinational auction. The experiment results show that the algorithm and strategy present in this paper are feasible; it can improve the utility of resource scheduling.
本文围绕如何高效合理地管理和调度网格资源,主要做了如下研究工作:
1、基于合作博弈论,探讨了如何将资源提供者形成网格虚拟组织联盟,来实现资源的组合利用。提出了一个资源管理系统用来支持虚拟组织联盟的形成。
2、探讨了网格资源管理中常见的几种拍卖机制,并详细介绍了基于经济学模型的Nimrod-G网格项目,重点讨论了它的拍卖机制及资源分配的特点。
3、重点探讨了组合拍卖机制在网格资源管理和调度中的应用。创建了基于组合拍卖的资源映射算法,不仅保证了资源信息的真实和映射结果的最优性,而且降低了交互量,满足用户的个性化和多样化的需求,从而实现了有效的资源调度与分配。
4、实现了基于组合拍卖的资源映射算法的仿真实验。实验结果表明,提出的算法和策略是可行的,能够较好的提高资源分配的效用。
The rapid growth of the technology of computing and network mostly promotes the scientific research and commercial application based on Internet. In many fields, there are more and more requests for the computing capacity and it is difficult for a single computer to undertake calculation task. As the result of the increasing requirements of various applications which need more calculative resources and capacities, the grid computing technology appears. The final goal of grid is to realize resource share and coordinating work in a virtual network environment. The resource management and scheduling mechanism is a part of the Grid core services. An excellent resource management and scheduling strategy can coordinate and schedule the grid resources effectively, it can effectively reduce the total run time and total expense in the grid computing as well, which will implement the purpose of maximizing the preference of the grid. This paper analyzes the resource management and scheduling mechanism based on the auction model, and focuses on analyzing the resource management and scheduling mechanism based on the combinational auction model.
This paper aims at how to manage and schedule the grid resources effectively and reasonably. The major research works are below:
1. Based on the coalitional game theory, we discuss how to make the grid resource providers form the grid virtual organization (VO) which is able to provide the composite resource. We also propose a resource management system that supports the VO formation.
2. We discuss some common auction mechanisms in grid resource management. We introduce the Nimrod-G grid project based on Economics model in detail and focus on discussing the auction mechanism and resource scheduling in the Nimrod-G grid project.
3. We discuss mainly how the combinational auction mechanism is used in grid resource management and scheduling. We also propose a resource mapping algorithm based on the combinational auction mechanism. The algorithm ensures not only the reality of resource information and the optimization of mapping result, but also reduces the interaction communication and meets the user requirement of personalization and diversification. The algorithm also realizes effective resource management and scheduling.
4. In this paper, we implement the simulation experiment of resource mapping algorithm based on the combinational auction. The experiment results show that the algorithm and strategy present in this paper are feasible; it can improve the utility of resource scheduling.
引文
[1]吴政南.基于拍卖机制的网格资源管理分配模型研究[D].武汉:武汉理工大学,2006.
[2]姜珊.基于经济模型的网格资源调度和分配的研究[D].山东:山东师范大学,2007.
[3]丁箐,陈国良,单九龙,何家华.一个基于证券市场的计算网格环境下的资源分配模型[J].小型微型计算机系统,2003,24(1).
[4]姜样兰.基于委托-代理理论的网格资源分配研究[D].江西:江西师范大学,2007.
[5]刘鹏.网格发展趋势[D].北京:清华大学计算机系高性能所网格研究组. http://www.chinagrid.net/dvnews/show.aspx?id=41&cid=16.
[6]刘鹏.网格应用研究现状[D].北京:清华大学计算机系高性能所网格研究组. http://www.chinagrid.net/dvnews/show.aspx?id=970&cid=48.
[7]李茂胜.基于市场的网格资源管理研究[D].安徽:中国科学技术大学,2006.
[8]宋风龙.基于经济原理的网格资源管理模型与策略研究[D].山东:山东师范大学,2006.
[9]刘祥瑞,朱建勇,樊孝忠.基于组合拍卖的网格资源映射算法[J].北京理工大学学报, 2005,25(8).
[10]刘祥瑞,朱建勇,樊孝忠.基于组合拍卖的网格映射算法设计与模拟[J].计算机应用, 2005,25(2).
[11] FOSTER I, KESSELMAN C, EDS. The Grid 2:Blueprint for a New Computing Infrastructure[M].2nd ed. San Francisco,CA,USA:Morgan Kaufmann Publishers Inc, 2003.
[12] OWEN G. Game Theory[M].3rd ed. New York, NY, USA: Academic Press, 1995.
[13] AUMANN R J and DREZE J H. Cooperative games with coalition structures[J]. Int. J. Game Theory, 1974, 3(4):217-237.
[14] MYERSON R B. Conference structures and fair allocation rules[J]. Int. J. Game Theory, 1978, 9(3):169-182.
[15]张维迎.博弈论与信息经济学[M].上海:上海人民出版社,2004.
[16] SHEHORY O and KRAUS S. Task allocation via coalition formation among autonomous agents:Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI’94)[C]. [S.l.]:[s.n.],1995:655-661.
[17] AUMANN R J and MYERSON R B. Endogenous formation of links between players and of coalitions:an application of the shapley value[M]. [S.l.]:Cambridge University Press, 1988:175-191.
[18] LAU H C and Zhang L. Task allocation via multi-agent coalition formation: taxonomy, algorithms, and complexity:Proc. of the 15th IEEE International conference on Tools with Artificial Intelligence (IACTAI’03)[C]. [S.l.]:[s.n.],2003:346-350.
[19] GRAHAM R L. Bounds on multiprocessing timing anomalies[J]. SIAM J. Applied Math.,1969,17(2):416-429.
[20] FRIESEN D K. Tighter bounds for LPT scheduling on uniform processors[J]. SIAM J. Comput., 1987,16(3):554-560.
[21] CARROLL T E and GROSU D. A strategy proof mechanism for scheduling divisible loads in linear networks:Proc. of the 21st IEEE International Parallel and Distributed Processing Symp.(IPDPS’07)[C]. [S.l.]:[s.n.],2007.
[22] NISAN N and RONEN A. Algorithmic mechanism design[J]. Games and Economic Behaviour, 2001, 35(1/2):166-196.
[23] EFRAIMIDIS P and SPIRAKIS P G. Approximation schemes for scheduling and covering on unrelated machines[J].Theory Comput. Sci.,2006,359(1,3):400-417.
[24]秦金磊.网格计算环境下资源管理的研究[D].河北:华北电力大学,2006.
[25]柴进.基于计算经济模型的网格任务调度策略研究[D].兰州:兰州理工大学,2007.
[26]韩勇.基于计算市场模型的网格资源调度算法研究[D].青岛:青岛大学,2006.
[27]张涛.基于网格计算经济模型的资源调度算法研究[D].无锡:江南大学,2005.
[28]朱穗晖.GridSim安装报告.中国网格中转站:http://www.chinagrid.net.
[29]郦钧.网格资源管理的研究[D].北京:清华大学,2004.
[30]张澜.基于Gridsim的改进Min-Min算法模拟.中国科技论文在线. http://www.paper.edu.cn
[31]孙叶萌.计算网格中货物市场模型和拍卖模型的比较[D].吉林:吉林大学,2005.
[32]刘祥瑞.GridSim Toolkit的使用和开发.中国网格中转站.http://www.chinagrid.net.
[33]李昊.使用Gridsim工具包实现计算网格任务调度模拟[J].吉林师范大学学报(自然科学版), 2005, 3.
[34]郑骏,闰丽慧,任娇娜,薛利.一种基于经济模型的网格资源调度算法[J].华东师范大学学报(自然科学版),2006,3。
[35]王坤.基于网格的资源调度的研究[D].西安:西安电子科技大学,2007.
[36]吴淞.基于网格仿真平台GRIDSIM的任务调度算法[D].成都:四川大学,2006.
[37]丛珊.基于GridSim的网格模拟技术的研究[D].哈尔滨:哈尔滨工业大学,2006.
[38]华中科技大学CGCL实验室,网格系统平台组.http://grid.hust.edu.cn/platform/
[39]黄智兴.网格环境下基于经济机制的资源预留方法研究[D].重庆:西南大学,2006.
[40] Rajkumar Buyya. GridSim: A Grid Simulation Toolkit for Resource Modelling and Application Scheduling for Parallel and Distributed Computing. http://www.buyya.com/gridsim/.
[41] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya. Visual Modeler for Grid Modeling and Simulation (GridSim) Toolkit, Proc. of the 3rd International Conference on Computational Science (ICCS 2003), Springer Verlag Publications (LNCS Series), June 2-4, 2003, Melbourne, Australia. http://www.gridbus.org.
[42] Rajkumar Buyya. Economic-based Distributed Resource Management and Scheduling for Grid Computing, School of Computer Science and Software Engineering Monash University, Melbourne, Australia. http://www.buyya.com.
[43] KWang Mong Sim. A Survey of Bargaining Models for Grid Resource Allocation, Department of Computer Science, Hong Kong Baptist University.
[44] Rajkumar Buyya and Manzur Murshed. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing, The Journal of Concurrency and Computation: Practice and Experience (CCPE), Volume 14, Issue 13-15, Wiley Press, Nov.-Dec., 2002.
[45] Roth, Alvin E, and Axel Ockenfels. Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet. 2001.http://kuznets.harvard.edu/~aroth/papers/eBay.veryshortaer.pdf.
[46] Efeng Lu,Zhihong Xu,Jizhou Sun. An Extendable Grid Simulation Environment Based on GridSim, 2nd International Workshop on Grid and Cooperative Computing (GCC 2003), part I.
[47] Omer Ozan Sonme,Attila Gursoy. A Novel Economic-Based Scheduling Heuristic for Computational Grids,International Journal of High Performance Computing Applications, Vol.21/No.1, p.21-29, 2007.
[48] Manzur Murshed,Rajkumar Buyya. Using the GridSim Toolkit for Enabling Grid Computing Education, Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation (CNDS 2002), Jan 27-31, 2002, San Antonio, Texas, USA.
[49] Wen-Chung Shi,Chao-Tung Yan,Shian-Shyong Tseng. A performance-based parallel loop scheduling on grid environments,Journal of Supercomputing, Vol.41/No.3, p.247-267,2007.
[50] Eddy Caron,Vincent Garonne,Andrei Tsaregorodtsev. Definition, modelling and simulation of a grid computing scheduling system for high throughput computing, Future generation computer systems, vol.23/no.8 , p.968-976, 2007.
[51] WANG Cheng,JIANG Congfeng,LIU Xiaohu. Fuzzy Logic-Based Secure and Fault Tolerant Job Scheduling in Grid. Tsinghua Science and Technology, Vol.12/No.S1,p.45-50, 2007.
[52] Zhao Chengling,Cao Yan,Tan Xiaodong,Luo Qi,Yu ying. Research on Grid-Based Personalized Collaborative Learning System, Proceedings of 2006 international conference on artificial intelligence, 7-5635-1324-8, p.638-642,2006.
[53] Yu'an H,Tao Yu,Lilan Liu,Haiyang Sun. Research on Manufacturing Resource Discovery and Scheduling in Manufacturing Grid.IFIP 207,IFIP(International Federat), P.902-907,2006.
[54] Sharath Babu Musunoori,Geir Horn. Application service placement in stochasticgrid environments using learning and ant-based methods, Multiagent and grid systems, Vol.3 /No.1 , p.19-41 ,2007.
[55] B.T. Benjamin Khoo, Bharadwaj Veeravalli, Terence Hung, C.W. Simon See. A multi-dimensional scheduling scheme in a Grid computing environment, Journal of Parallel and Distributed Computing, Vol.67 /No.6, p.659-673,2007.
[56] Analyzing Market-Based Resource Allocation Strategies for the Computational Grid. [Online]. Available: http://www.cs.utk.edu/~rich/ publications/CS-00 453.ps.gz
[57] Ausubel L M, M.ilgrom P R. Ascending auctions with package bidding [J]. Frontiers of Theoretical Economics,2002.1(1):1—42
[58] Braun T D,Siege H J. Beck N. A comparison of eleven static heuristics for schedule a class of independent tasks onto heterogeneous distributed computing systems [J].Journal of Parallel and Distributed Computing,2001,61(6):810—837
[59] Faruk G. Ennio S. The English auction with differentiated commodities [J].Journal of Economic Theory. 2000. 92(1): 66—95.
[60] Gagliano, R. A., M. D. Fraser, and M. E. Schaefer. Auction allocation for computing resources[C]. Communications of the ACM 38(6), 1995, 88—102.
[61] Gibbens, R.J. and F.P. Kelly. Resource pricing and the evolution of congestion control[C]. Automatics 35(12), 1999,1969—1985.
[62] Grid computing: Conceptual flyover for developers, IBM. [Online]. Available: http://www-128.ibm.com/developerworks/grid/library/gr-fly.html?ca=dgr-lnxw01-obg-GridFlyover.
[63] Henri C, Arnaud L, Dmitrii Z. et a1. Heuristics for scheduling parameter sweep applications in grid environments[A]. Proceedings of 9th Heterogeneous Computing Workshop [C]. Washington: IEEE Computer Society Press. 2000. 349—363.
[64] I. Foster and C. Kesselman (editors). The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA, 1999.
[65] I. Foster, Jennings, and C.Kesselman. Brain meets brawn:Why Grid and agents need each other, in Proc.3rd Int. Conf. Auto. Agents and Multi-Agent Syst., New York, 2004, pp.8–15.
[66] K.M.Sim. From market-driven agents to market-oriented Grids[C]. ACM SIGECOM: E-Commerce Exchange, Nov.2004. vol.5, no.2, pp.45–53.
[67] M.Miller and K.Drexler. Markets and computation: Agonic open systems,in the Ecology of Computation,B.Huberman,Ed.North Holland,The Netherlands:Elsevier, 1988, pp.133–176.
[68] MacKie-Mason, J. K. and H. R. Varian. Pricing the Internet'. In: Public Access to the Internet. JFK School of Government. 1993.`
[69] Mackie-Mason, J. K. and H. R. Varian. Pricing congestible network resources. IEEE Journal on Selected Areas in Communications[J]. 1995, 13(7),1141—1148.
[70] Noriyuki. F,Kenichi. H. A comparison among grid scheduling algorithms for independent coarse-grained tasks [A]. Proceedings of the 2004 Symposium on Applications and the Internet Workshops [C]. Washington: IEEE Computer Society Press, 2004.674—680.
[71] R. Buyya. Economic-based Distributed Resource Management and Scheduling for Grid Computing. PhD Thesis, Monash University, Australia, April 12, 2002. http://www.buyya.com/thesis/.
[72] R.Buyya, D. Abramson, and J. Giddy. Nimrod/G:An Architecture for a Resource Management and Scheduling System in a Global Computational Grid[C]. 4th International Conference and Exhibition on High Performance Computing in Asia-Pacific Region (HPC ASIA 2000), May 14-17,2000,Beijing,China.
[73] R.Wolski et al. G-Commerce: Building Computational Market-places for the Computational Grid.2001. http://www.cs.ucsb.edu/~rich/publications/.
[74] Regev, O. and N. Nisan. The POPCORN Market: An online market for computational resources[C]. In: Proceedings of the 1st International Conference on Information and Computational Economies. Charleston, SC.1998, pp.148—157.
[2]姜珊.基于经济模型的网格资源调度和分配的研究[D].山东:山东师范大学,2007.
[3]丁箐,陈国良,单九龙,何家华.一个基于证券市场的计算网格环境下的资源分配模型[J].小型微型计算机系统,2003,24(1).
[4]姜样兰.基于委托-代理理论的网格资源分配研究[D].江西:江西师范大学,2007.
[5]刘鹏.网格发展趋势[D].北京:清华大学计算机系高性能所网格研究组. http://www.chinagrid.net/dvnews/show.aspx?id=41&cid=16.
[6]刘鹏.网格应用研究现状[D].北京:清华大学计算机系高性能所网格研究组. http://www.chinagrid.net/dvnews/show.aspx?id=970&cid=48.
[7]李茂胜.基于市场的网格资源管理研究[D].安徽:中国科学技术大学,2006.
[8]宋风龙.基于经济原理的网格资源管理模型与策略研究[D].山东:山东师范大学,2006.
[9]刘祥瑞,朱建勇,樊孝忠.基于组合拍卖的网格资源映射算法[J].北京理工大学学报, 2005,25(8).
[10]刘祥瑞,朱建勇,樊孝忠.基于组合拍卖的网格映射算法设计与模拟[J].计算机应用, 2005,25(2).
[11] FOSTER I, KESSELMAN C, EDS. The Grid 2:Blueprint for a New Computing Infrastructure[M].2nd ed. San Francisco,CA,USA:Morgan Kaufmann Publishers Inc, 2003.
[12] OWEN G. Game Theory[M].3rd ed. New York, NY, USA: Academic Press, 1995.
[13] AUMANN R J and DREZE J H. Cooperative games with coalition structures[J]. Int. J. Game Theory, 1974, 3(4):217-237.
[14] MYERSON R B. Conference structures and fair allocation rules[J]. Int. J. Game Theory, 1978, 9(3):169-182.
[15]张维迎.博弈论与信息经济学[M].上海:上海人民出版社,2004.
[16] SHEHORY O and KRAUS S. Task allocation via coalition formation among autonomous agents:Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI’94)[C]. [S.l.]:[s.n.],1995:655-661.
[17] AUMANN R J and MYERSON R B. Endogenous formation of links between players and of coalitions:an application of the shapley value[M]. [S.l.]:Cambridge University Press, 1988:175-191.
[18] LAU H C and Zhang L. Task allocation via multi-agent coalition formation: taxonomy, algorithms, and complexity:Proc. of the 15th IEEE International conference on Tools with Artificial Intelligence (IACTAI’03)[C]. [S.l.]:[s.n.],2003:346-350.
[19] GRAHAM R L. Bounds on multiprocessing timing anomalies[J]. SIAM J. Applied Math.,1969,17(2):416-429.
[20] FRIESEN D K. Tighter bounds for LPT scheduling on uniform processors[J]. SIAM J. Comput., 1987,16(3):554-560.
[21] CARROLL T E and GROSU D. A strategy proof mechanism for scheduling divisible loads in linear networks:Proc. of the 21st IEEE International Parallel and Distributed Processing Symp.(IPDPS’07)[C]. [S.l.]:[s.n.],2007.
[22] NISAN N and RONEN A. Algorithmic mechanism design[J]. Games and Economic Behaviour, 2001, 35(1/2):166-196.
[23] EFRAIMIDIS P and SPIRAKIS P G. Approximation schemes for scheduling and covering on unrelated machines[J].Theory Comput. Sci.,2006,359(1,3):400-417.
[24]秦金磊.网格计算环境下资源管理的研究[D].河北:华北电力大学,2006.
[25]柴进.基于计算经济模型的网格任务调度策略研究[D].兰州:兰州理工大学,2007.
[26]韩勇.基于计算市场模型的网格资源调度算法研究[D].青岛:青岛大学,2006.
[27]张涛.基于网格计算经济模型的资源调度算法研究[D].无锡:江南大学,2005.
[28]朱穗晖.GridSim安装报告.中国网格中转站:http://www.chinagrid.net.
[29]郦钧.网格资源管理的研究[D].北京:清华大学,2004.
[30]张澜.基于Gridsim的改进Min-Min算法模拟.中国科技论文在线. http://www.paper.edu.cn
[31]孙叶萌.计算网格中货物市场模型和拍卖模型的比较[D].吉林:吉林大学,2005.
[32]刘祥瑞.GridSim Toolkit的使用和开发.中国网格中转站.http://www.chinagrid.net.
[33]李昊.使用Gridsim工具包实现计算网格任务调度模拟[J].吉林师范大学学报(自然科学版), 2005, 3.
[34]郑骏,闰丽慧,任娇娜,薛利.一种基于经济模型的网格资源调度算法[J].华东师范大学学报(自然科学版),2006,3。
[35]王坤.基于网格的资源调度的研究[D].西安:西安电子科技大学,2007.
[36]吴淞.基于网格仿真平台GRIDSIM的任务调度算法[D].成都:四川大学,2006.
[37]丛珊.基于GridSim的网格模拟技术的研究[D].哈尔滨:哈尔滨工业大学,2006.
[38]华中科技大学CGCL实验室,网格系统平台组.http://grid.hust.edu.cn/platform/
[39]黄智兴.网格环境下基于经济机制的资源预留方法研究[D].重庆:西南大学,2006.
[40] Rajkumar Buyya. GridSim: A Grid Simulation Toolkit for Resource Modelling and Application Scheduling for Parallel and Distributed Computing. http://www.buyya.com/gridsim/.
[41] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya. Visual Modeler for Grid Modeling and Simulation (GridSim) Toolkit, Proc. of the 3rd International Conference on Computational Science (ICCS 2003), Springer Verlag Publications (LNCS Series), June 2-4, 2003, Melbourne, Australia. http://www.gridbus.org.
[42] Rajkumar Buyya. Economic-based Distributed Resource Management and Scheduling for Grid Computing, School of Computer Science and Software Engineering Monash University, Melbourne, Australia. http://www.buyya.com.
[43] KWang Mong Sim. A Survey of Bargaining Models for Grid Resource Allocation, Department of Computer Science, Hong Kong Baptist University.
[44] Rajkumar Buyya and Manzur Murshed. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing, The Journal of Concurrency and Computation: Practice and Experience (CCPE), Volume 14, Issue 13-15, Wiley Press, Nov.-Dec., 2002.
[45] Roth, Alvin E, and Axel Ockenfels. Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet. 2001.http://kuznets.harvard.edu/~aroth/papers/eBay.veryshortaer.pdf.
[46] Efeng Lu,Zhihong Xu,Jizhou Sun. An Extendable Grid Simulation Environment Based on GridSim, 2nd International Workshop on Grid and Cooperative Computing (GCC 2003), part I.
[47] Omer Ozan Sonme,Attila Gursoy. A Novel Economic-Based Scheduling Heuristic for Computational Grids,International Journal of High Performance Computing Applications, Vol.21/No.1, p.21-29, 2007.
[48] Manzur Murshed,Rajkumar Buyya. Using the GridSim Toolkit for Enabling Grid Computing Education, Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation (CNDS 2002), Jan 27-31, 2002, San Antonio, Texas, USA.
[49] Wen-Chung Shi,Chao-Tung Yan,Shian-Shyong Tseng. A performance-based parallel loop scheduling on grid environments,Journal of Supercomputing, Vol.41/No.3, p.247-267,2007.
[50] Eddy Caron,Vincent Garonne,Andrei Tsaregorodtsev. Definition, modelling and simulation of a grid computing scheduling system for high throughput computing, Future generation computer systems, vol.23/no.8 , p.968-976, 2007.
[51] WANG Cheng,JIANG Congfeng,LIU Xiaohu. Fuzzy Logic-Based Secure and Fault Tolerant Job Scheduling in Grid. Tsinghua Science and Technology, Vol.12/No.S1,p.45-50, 2007.
[52] Zhao Chengling,Cao Yan,Tan Xiaodong,Luo Qi,Yu ying. Research on Grid-Based Personalized Collaborative Learning System, Proceedings of 2006 international conference on artificial intelligence, 7-5635-1324-8, p.638-642,2006.
[53] Yu'an H,Tao Yu,Lilan Liu,Haiyang Sun. Research on Manufacturing Resource Discovery and Scheduling in Manufacturing Grid.IFIP 207,IFIP(International Federat), P.902-907,2006.
[54] Sharath Babu Musunoori,Geir Horn. Application service placement in stochasticgrid environments using learning and ant-based methods, Multiagent and grid systems, Vol.3 /No.1 , p.19-41 ,2007.
[55] B.T. Benjamin Khoo, Bharadwaj Veeravalli, Terence Hung, C.W. Simon See. A multi-dimensional scheduling scheme in a Grid computing environment, Journal of Parallel and Distributed Computing, Vol.67 /No.6, p.659-673,2007.
[56] Analyzing Market-Based Resource Allocation Strategies for the Computational Grid. [Online]. Available: http://www.cs.utk.edu/~rich/ publications/CS-00 453.ps.gz
[57] Ausubel L M, M.ilgrom P R. Ascending auctions with package bidding [J]. Frontiers of Theoretical Economics,2002.1(1):1—42
[58] Braun T D,Siege H J. Beck N. A comparison of eleven static heuristics for schedule a class of independent tasks onto heterogeneous distributed computing systems [J].Journal of Parallel and Distributed Computing,2001,61(6):810—837
[59] Faruk G. Ennio S. The English auction with differentiated commodities [J].Journal of Economic Theory. 2000. 92(1): 66—95.
[60] Gagliano, R. A., M. D. Fraser, and M. E. Schaefer. Auction allocation for computing resources[C]. Communications of the ACM 38(6), 1995, 88—102.
[61] Gibbens, R.J. and F.P. Kelly. Resource pricing and the evolution of congestion control[C]. Automatics 35(12), 1999,1969—1985.
[62] Grid computing: Conceptual flyover for developers, IBM. [Online]. Available: http://www-128.ibm.com/developerworks/grid/library/gr-fly.html?ca=dgr-lnxw01-obg-GridFlyover.
[63] Henri C, Arnaud L, Dmitrii Z. et a1. Heuristics for scheduling parameter sweep applications in grid environments[A]. Proceedings of 9th Heterogeneous Computing Workshop [C]. Washington: IEEE Computer Society Press. 2000. 349—363.
[64] I. Foster and C. Kesselman (editors). The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA, 1999.
[65] I. Foster, Jennings, and C.Kesselman. Brain meets brawn:Why Grid and agents need each other, in Proc.3rd Int. Conf. Auto. Agents and Multi-Agent Syst., New York, 2004, pp.8–15.
[66] K.M.Sim. From market-driven agents to market-oriented Grids[C]. ACM SIGECOM: E-Commerce Exchange, Nov.2004. vol.5, no.2, pp.45–53.
[67] M.Miller and K.Drexler. Markets and computation: Agonic open systems,in the Ecology of Computation,B.Huberman,Ed.North Holland,The Netherlands:Elsevier, 1988, pp.133–176.
[68] MacKie-Mason, J. K. and H. R. Varian. Pricing the Internet'. In: Public Access to the Internet. JFK School of Government. 1993.`
[69] Mackie-Mason, J. K. and H. R. Varian. Pricing congestible network resources. IEEE Journal on Selected Areas in Communications[J]. 1995, 13(7),1141—1148.
[70] Noriyuki. F,Kenichi. H. A comparison among grid scheduling algorithms for independent coarse-grained tasks [A]. Proceedings of the 2004 Symposium on Applications and the Internet Workshops [C]. Washington: IEEE Computer Society Press, 2004.674—680.
[71] R. Buyya. Economic-based Distributed Resource Management and Scheduling for Grid Computing. PhD Thesis, Monash University, Australia, April 12, 2002. http://www.buyya.com/thesis/.
[72] R.Buyya, D. Abramson, and J. Giddy. Nimrod/G:An Architecture for a Resource Management and Scheduling System in a Global Computational Grid[C]. 4th International Conference and Exhibition on High Performance Computing in Asia-Pacific Region (HPC ASIA 2000), May 14-17,2000,Beijing,China.
[73] R.Wolski et al. G-Commerce: Building Computational Market-places for the Computational Grid.2001. http://www.cs.ucsb.edu/~rich/publications/.
[74] Regev, O. and N. Nisan. The POPCORN Market: An online market for computational resources[C]. In: Proceedings of the 1st International Conference on Information and Computational Economies. Charleston, SC.1998, pp.148—157.