计算网格中基于可用性评估的资源预留关键技术研究
|
摘要
网格计算作为支持全球化资源共享与协作的关键技术,具有广泛的应用前景。在网格环境中,资源的动态性、异构性、自治性等特点致使网格用户很难获得高质量的服务,网格系统通常采用资源预留机制来保障网格用户的服务质量。然而,资源预留机制由于受到网格资源服务不确定性的影响而难以保证其性能,且资源预留对整个网格系统的性能、本地任务的执行也有负面影响。因此,研究构建可综合考虑各参与方利益、并能有效控制预留负面影响的网格资源预留机制,以期实现为网格任务提供“非凡的服务质量”,具有重要的理论价值与广泛的实用意义。
为了保证网格服务质量,资源预留机制必须保障预留时间段资源服务的可靠性、减少资源预留带来的负面影响。本文从预留违约风险、参与方预留收益、资源价格、接纳预留可靠性等方面着手,重点研究有效保障网格任务QoS、降低预留负面影响、增加接纳预留可靠性的方法,主要研究工作与创新如下：
1.面向用户收益—风险均衡的预留模型
针对网格资源服务的不确定性将导致资源在执行网格任务时难以遵守既定约定、从而无法实现资源预留目标的问题,基于对资源违约与预留收益的分析,建立了“收益—风险”模型。模型通过收益和风险来评估资源节点在预留中的性能表现,依据数学期望和方差理论分别预测收益与风险；针对模型中双目标规划问题,利用效用函数将其转换为凸二次规划问题,进而求解出可平衡预留收益与风险的均衡预留方案(BBR)；在求解过程中通过调整风险厌恶因子来满足资源使用者对风险与收益的偏好,以期预留方案能适应实际网格环境。仿真实验表明,与目前广泛采用的预留策略相比,BBR在任务违约率、资源利用率等性能指标上具有明显的优势。
2.基于效用驱动的资源预留策略
在分析资源价格、资源市场竞争力以及资源预留收益三者关系的基础之上,提出了一种基于效用驱动的多节点协同预留策略(UDS)。通过对运行在资源上任务的QoS指标分析,形成了QoS满意度量化方法,建立了资源服务QoS与市场竞争力的函数关系,并以市场经济环境为背景,通过价格杠杆调节各资源提供方的收益,求解得出可平衡各资源节点预留收益的协同预留方案。理论分析与仿真实验表明,UDS在资源负载均衡、平衡资源节点相对收益率以及任务QoS均衡保障方面的性能表现显著优于传统的预留策略。
3.面向资源提供者利益和用户QoS保障均衡的预留机制
针对传统的预留策略往往仅考虑资源提供方或使用方的利益、或仅以用户QoS保障为单一目标等问题,通过分析资源预留各参与方预留收益,提出了一个可以均衡网格用户QoS保障和资源提供者利益的资源预留机制(CPRM)。该机制基于本地任务的统计特性,理论分析得出不同本地管理策略下的资源定价方法；通过将本地任务与网格任务竞争资源的非合作博弈问题转化为系统收益最大化问题进行求解,提出了预留方案求解算法。仿真实验表明,与传统的预留策略相比,CPRM能使各资源节点负载趋于平衡,并能有效提高空闲资源的利用率。
4.可靠性增强的资源预留策略
针对网格资源节点负载的动态性会导致资源服务能力动态变化、从而难以决策是否接纳资源预留申请的问题,基于资源节点接纳预留请求可靠性分析,提出了一个可适应网格用户偏好的预留请求接纳策略(RRS)。该策略通过分析资源本地负载和已接纳预留任务的实际执行数据来获取资源服务能力；以资源能力可满足预留需求的概率来评估资源接纳预留的可靠性；通过调整预留接纳阀值来满足网格用户对预留接纳风险的容忍程度。仿真实验表明,RRS在保障预留任务违约率方面有良好的表现,尤其当预留任务请求率从15%上升到25%时,与传统的资源预留策略相比其预留违约率可降低5%。
As the key technology for the global resources sharing and coordination, grid computing will be widely used in the future. In grid environment, the dynamic, heterogeneous, and autonomous features of resources challenges the stability of QoS(quality of service) provided for grid users. Advanced resources reservation (RR) mechanism is implied in real grid systems to provide QoS guarantee for end users. However, the uncertainty of grid service makes it difficult to realize ideal performance of RR. Furthermore, RR has many negative effects on the performance of gird system and the local task execution. Therefore, study on resource reservation mechanism is both theoretically sound and practically useful, which takes the profits of each participant into accounts, and controls its negative effects with the aim of providing "non-trivial QoS" effectively
In order to assure QoS of grid tasks, RR mechanism must guarantee reliability of the resources during the reserved period and degrade the negative effects of RR. This thesis focuses on the RR that can provide effective QoS guarantee of grid tasks, degrade negative effects on local task, and increases reliability of reservation admission control, on the basis of analyzing risk of reservation violation, participants'interest, resources price, and reliability of reservation admission. The main contributions and achievements of this thesis are as follows.
1. The user-oriented balanced benefit-risk RR model
The uncertainty of resource performance is the biggest obstacle to ensure SLA can be guaranteed and realize the goal of the RR. The benefit-risk model is established based on the analysis of reservation violation and reservation benefit. The model can evaluate the performance of resources node in RR through benefit and risk, and can predict the benefit and risk based on mathematical expectation and variance theory respectively. The double task programming in the model can be transformed into convex quadratic programming through utility function, and the reservation schema characterized by balanced benefit-risk (BBR) can be achieved. Through the adjustment of risk degree, the preference of resources users for interest and risk can be satisfied, and RR can adapt to the actual grid environment. Simulation experiment shows that, compared with the currently employed RR strategy, BBR has an obvious advantage in task failure rate, resources utilization rate, and some other performance index.
2. The utility-driven RR strategy
The Utinity-driven reservation strategy (UDS) with multi-node coordination is presented based on the analysis of resources price, market competitiveness of resources, and beneficiary of RR. Through service quality analysis of undergoing resources performance, the service quality satisfaction degree can be achieved, and the functional relation between the quality of resources service and market competitiveness is established. Under market economy environment, income of resources owners can be adjusted by lever of price, and a coordination reservation schema that can balance the reservation benefit of various resources can be achieved. Theoretical analysis and simulation experiments indicate that, compared with traditional reservation strategy, UDS strategy is preferential in the resources nodes load, balancing the relative interest rates of resources nodes, and enhancing the QoS.
3. Reservation mechanism aiming at balance between the interest of resources provider and security of users' QoS
Traditional RR strategy mainly focuses on the interests of resources provider or resources user, or considers the QoS for the user as the sole goal. Through the interests analysis of RR related participants, the Cost-and-Profit-balancing reservation mechanism (CPRM) is presented to balance the security of grid users'QoS and interest of resources provider. Based on the statistical features of local tasks, the resources pricing methods under different local management strategies can be achieved. By transforming the non-cooperative game between local task and grid computing into the maximization problem of system interests, the RR algorithm is presented. The simulation experiment shows that compared with traditional RR strategy, CPRM can proportionate the resources node load and enhance the utility rate of free resources.
4. More reliable and empowered RR strategy
The dynamism of grid resources node fluctuate the ability of resources service, which makes the decision of RR acceptance very tough. RRS suitable for the preference of grid user is introduced based on the stability analysis of resources nodes RR acceptance. Resources service ability can be obtained through the analysis of local resources load and the actual performance of accepted RR task. The reliability of RR acceptance can be assessed by the probability of performing the RR tasks. The tolerance degree of grid user for RR risk may be satisfied by adjusting the threshold value of RR acceptance. Simulation experiment shows that RRS works well in the assurance of RR performance, esp. when the request rate of RR tasks increases from15%to25%, the expected breach rate can be5%lower than the traditional RR strategy.
为了保证网格服务质量,资源预留机制必须保障预留时间段资源服务的可靠性、减少资源预留带来的负面影响。本文从预留违约风险、参与方预留收益、资源价格、接纳预留可靠性等方面着手,重点研究有效保障网格任务QoS、降低预留负面影响、增加接纳预留可靠性的方法,主要研究工作与创新如下：
1.面向用户收益—风险均衡的预留模型
针对网格资源服务的不确定性将导致资源在执行网格任务时难以遵守既定约定、从而无法实现资源预留目标的问题,基于对资源违约与预留收益的分析,建立了“收益—风险”模型。模型通过收益和风险来评估资源节点在预留中的性能表现,依据数学期望和方差理论分别预测收益与风险；针对模型中双目标规划问题,利用效用函数将其转换为凸二次规划问题,进而求解出可平衡预留收益与风险的均衡预留方案(BBR)；在求解过程中通过调整风险厌恶因子来满足资源使用者对风险与收益的偏好,以期预留方案能适应实际网格环境。仿真实验表明,与目前广泛采用的预留策略相比,BBR在任务违约率、资源利用率等性能指标上具有明显的优势。
2.基于效用驱动的资源预留策略
在分析资源价格、资源市场竞争力以及资源预留收益三者关系的基础之上,提出了一种基于效用驱动的多节点协同预留策略(UDS)。通过对运行在资源上任务的QoS指标分析,形成了QoS满意度量化方法,建立了资源服务QoS与市场竞争力的函数关系,并以市场经济环境为背景,通过价格杠杆调节各资源提供方的收益,求解得出可平衡各资源节点预留收益的协同预留方案。理论分析与仿真实验表明,UDS在资源负载均衡、平衡资源节点相对收益率以及任务QoS均衡保障方面的性能表现显著优于传统的预留策略。
3.面向资源提供者利益和用户QoS保障均衡的预留机制
针对传统的预留策略往往仅考虑资源提供方或使用方的利益、或仅以用户QoS保障为单一目标等问题,通过分析资源预留各参与方预留收益,提出了一个可以均衡网格用户QoS保障和资源提供者利益的资源预留机制(CPRM)。该机制基于本地任务的统计特性,理论分析得出不同本地管理策略下的资源定价方法；通过将本地任务与网格任务竞争资源的非合作博弈问题转化为系统收益最大化问题进行求解,提出了预留方案求解算法。仿真实验表明,与传统的预留策略相比,CPRM能使各资源节点负载趋于平衡,并能有效提高空闲资源的利用率。
4.可靠性增强的资源预留策略
针对网格资源节点负载的动态性会导致资源服务能力动态变化、从而难以决策是否接纳资源预留申请的问题,基于资源节点接纳预留请求可靠性分析,提出了一个可适应网格用户偏好的预留请求接纳策略(RRS)。该策略通过分析资源本地负载和已接纳预留任务的实际执行数据来获取资源服务能力；以资源能力可满足预留需求的概率来评估资源接纳预留的可靠性；通过调整预留接纳阀值来满足网格用户对预留接纳风险的容忍程度。仿真实验表明,RRS在保障预留任务违约率方面有良好的表现,尤其当预留任务请求率从15%上升到25%时,与传统的资源预留策略相比其预留违约率可降低5%。
As the key technology for the global resources sharing and coordination, grid computing will be widely used in the future. In grid environment, the dynamic, heterogeneous, and autonomous features of resources challenges the stability of QoS(quality of service) provided for grid users. Advanced resources reservation (RR) mechanism is implied in real grid systems to provide QoS guarantee for end users. However, the uncertainty of grid service makes it difficult to realize ideal performance of RR. Furthermore, RR has many negative effects on the performance of gird system and the local task execution. Therefore, study on resource reservation mechanism is both theoretically sound and practically useful, which takes the profits of each participant into accounts, and controls its negative effects with the aim of providing "non-trivial QoS" effectively
In order to assure QoS of grid tasks, RR mechanism must guarantee reliability of the resources during the reserved period and degrade the negative effects of RR. This thesis focuses on the RR that can provide effective QoS guarantee of grid tasks, degrade negative effects on local task, and increases reliability of reservation admission control, on the basis of analyzing risk of reservation violation, participants'interest, resources price, and reliability of reservation admission. The main contributions and achievements of this thesis are as follows.
1. The user-oriented balanced benefit-risk RR model
The uncertainty of resource performance is the biggest obstacle to ensure SLA can be guaranteed and realize the goal of the RR. The benefit-risk model is established based on the analysis of reservation violation and reservation benefit. The model can evaluate the performance of resources node in RR through benefit and risk, and can predict the benefit and risk based on mathematical expectation and variance theory respectively. The double task programming in the model can be transformed into convex quadratic programming through utility function, and the reservation schema characterized by balanced benefit-risk (BBR) can be achieved. Through the adjustment of risk degree, the preference of resources users for interest and risk can be satisfied, and RR can adapt to the actual grid environment. Simulation experiment shows that, compared with the currently employed RR strategy, BBR has an obvious advantage in task failure rate, resources utilization rate, and some other performance index.
2. The utility-driven RR strategy
The Utinity-driven reservation strategy (UDS) with multi-node coordination is presented based on the analysis of resources price, market competitiveness of resources, and beneficiary of RR. Through service quality analysis of undergoing resources performance, the service quality satisfaction degree can be achieved, and the functional relation between the quality of resources service and market competitiveness is established. Under market economy environment, income of resources owners can be adjusted by lever of price, and a coordination reservation schema that can balance the reservation benefit of various resources can be achieved. Theoretical analysis and simulation experiments indicate that, compared with traditional reservation strategy, UDS strategy is preferential in the resources nodes load, balancing the relative interest rates of resources nodes, and enhancing the QoS.
3. Reservation mechanism aiming at balance between the interest of resources provider and security of users' QoS
Traditional RR strategy mainly focuses on the interests of resources provider or resources user, or considers the QoS for the user as the sole goal. Through the interests analysis of RR related participants, the Cost-and-Profit-balancing reservation mechanism (CPRM) is presented to balance the security of grid users'QoS and interest of resources provider. Based on the statistical features of local tasks, the resources pricing methods under different local management strategies can be achieved. By transforming the non-cooperative game between local task and grid computing into the maximization problem of system interests, the RR algorithm is presented. The simulation experiment shows that compared with traditional RR strategy, CPRM can proportionate the resources node load and enhance the utility rate of free resources.
4. More reliable and empowered RR strategy
The dynamism of grid resources node fluctuate the ability of resources service, which makes the decision of RR acceptance very tough. RRS suitable for the preference of grid user is introduced based on the stability analysis of resources nodes RR acceptance. Resources service ability can be obtained through the analysis of local resources load and the actual performance of accepted RR task. The reliability of RR acceptance can be assessed by the probability of performing the RR tasks. The tolerance degree of grid user for RR risk may be satisfied by adjusting the threshold value of RR acceptance. Simulation experiment shows that RRS works well in the assurance of RR performance, esp. when the request rate of RR tasks increases from15%to25%, the expected breach rate can be5%lower than the traditional RR strategy.
引文
[1]J. Soldatos, E. Vayias, L. Polymenakos. Grid Donors Resources Utilization Analysis towards Optimal Job Scheduling [C]. Proceedings of the DPSN'04, Workshop, held in the Scope of IFIP Networking. Athens,2004.
[2]I. Foster. The grid:Computing without bonds. Scientific American,2003, 288(4):78-85.
[3]G. W. Yang, H. Jin, M.L. Li. Grid computing in China. Journal of Grid Computing, 2004,2(2):193-206.
[4]H. Jin, D.Q. Zou, Z.F. Han. Implementation of a grid system based on Web. Mini-Micro Systems,2003,24(12):2053-2056.
[5]I. Foster, C. Kesselman. The Grid:Blueprint for a New Computing Infrastructure [M]. San Francisco, CA:Morgan Kaufmann,1999.
[6]Protein Data Bankworldwide Repository for the Processing and Distribution of 3-D Biological Macromolecular Structure Data. http://www.rcsb.org/pdb/.
[7]MyGrid-Directly Supporting the e-Scientist. http://www.mygrid.info/.
[8]NASA Information Power Grid. http://www.ipg.nasa.gov/.
[9]GEODISE Grid for Engineering Design Search and Optimization Involving Fluid Dynamics. http://www.geodise.org/.
[10]Distributed Aircraft Maintenance Environment DAME. http://www.iri.leeds.ac.uk/Projects/IAProjects/kariml.htm
[11]Grid Physics (Particle Physics, Astronomy, Experimental Gravitational waves) Network Gri-Phyn. http://www.griphyn.org/.
[12]Particle Physics Data Grid. http://www.ppdg.net/.
[13]Butterfly Grid for Multiplayer Games. http://www.butterfly.net/.
[14]Everquest Multiplayer Gaming Environment. http://www.everquest.com.
[15]H. Jin. Challenges of grid computing. In:W. Fan, Z. Wu, J. Yang, eds. Advances in Web-Age Information Management:Proceedings of the 6th Int'l Conf. LNCS 3739, Berlin:Springer-Verlag,2005.25-31.
[16]K. Krauter, R. Buyya, M. Maheswaran. A Taxonomy and Survey of Grid Resource Management System for Distributed Computing. Software:Practice and Experience, 2002,32(2):135-164.
[17]J. Ding, G.L. Chen, J. Gu. A Unified Resource Mapping Strategy in Computational Grid Environments. Journal of Software,2002,13(7):1303-1308.
[18]W.S. Zhang, G.W. Yang, M.M. Shen, et al. RSDictionary A Global Namespace for Distributed Computing Environment. Journal of Computer Research and Development,2005,42(8):1409-1414.
[19]W. Li, Z.W. Xu, G.Y. Bu, et al. An Effective Resource Locating Algorithm in Grid Environments. Chinese Journal of Computers,2003,26(11):1546-1549.
[20]邵凌霜,李田,赵俊峰,等.一种可扩展的Web Service QoS管理框架.计算机学报,2008,31(8)：1458-1470.
[21]I. Foster. What is the Grid? A Three Point Checklist. GRID Today,2002,1(6):20-27.
[22]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation [A]. Proceedings of International Workshop on QoS [C]. London, UK:IEEE Computer Society Press, 1999.27-36.
[23]I. Foster, A. Roy, V. Sander. A Quality of Service Architecture that Combines Resource Reservation and Application Adaptation [A]. Proceedings of International Workshop on QoS [C]. Pittsburgh USA:IEEE Computer Society Press,2000: 181-188.
[24]I. Foster, C. Kesselman. Globus:A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications,1997,11 (2):115-128.
[25]A.S. Grimshaw, W.A. Wulf. The Legion Vision of a Worldwide Virtual Computer [J]. Communications of the ACM,1997,40(1):39-45.
[26]M. Lewis, A.J. Ferrari, M.A. Humphery, et al. Support for Extensibility and Site Autonomy in the Legion Grid System Object Model [J]. Journal of Parallel and Distributed Computing,2003,63(5):525-538.
[27]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation [A]. In: International Workshop on Quality of Service (IWQoS'99) [C]. London:IEEE Computer Society,1999:27-36.
[28]FAFNER:Factoring via Network-Enabled Recursion. http://cs-www.bu.edu/cgi-bin/FAFNER/factor.pl
[29]I. Foster, J. Geisler, S. Tuecke. MPI on the I-WAY:A Wide-Area, Multimethod Implementation of the Message Passing Interface. Proc.1996 MPI Developers Conference,1996:10-17.
[30]http://setiathome.ssl.berkeley.edu/.
[31]http://www.distributed.net.
[32]I. Foster, C. Kesselman, S. Tuecke.The Anatomy of the Grid:Enabling Scalable Virtual Organizations [J]. Internation Journal of Supercomputer Applications, 2001,15(3):200-222.
[33]I. Foster, H. Kishimoto, A. Sawa, et al. The Open Grid Services Architecture[S]. GFD-Ⅰ.30, Global Grid Forum,2005.
[34]胡春明,怀进鹏,沃天宇,雷磊.一种支持端到端QoS的服务网格体系结构[J].软件学报,2006,17(6)：1448-1458.
[35]S. Benkner, I. Brandic, G. Engelbrecht, R. Schmidt. VGE-A Service-Oriented Grid Environment for On-Demand Supercomputing [C]. Proceedings of IEEE/ACM International Workshop on Grid Computing, Pittsburgh,2004:11-18.
[36]I. Foster, T. Maguire, D. Snelling. OGSATM WSRF Basic Profile 1.0 [S]. GFD-R-72, Open Grid Forum,2006.
[37]I. Foster, C. Kesselman, S. Tuecke. Anatomyof a Grid. http://www.globus.org/research/papers/anatomy.pdf,2007-2-1.
[38]I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations. International Journal of Supercomputing Applications, Vol.15, No.3,2002.
[39]徐志伟,冯百明,李伟.网格计算技术[M].北京：电子工业出版社,2004.
[40]胡明生.网格环境中决策资源协同调度研究[D].武汉：华中科技大学,2006：
[41]都志辉,陈渝,刘鹏.网格计算.北京：清华大学出版社,2002年10月第1版.
[42]J. Nabrzyski, J. Schopf, J.Weglarz. Grid resource Management:State of the Art and Research Issues.2003.
[43]鲁黎,杨寿保,刘鹏展等.基于动态定价的网格资源调度系统设计与仿真[J].系统仿真学报,2006,18(4)：932-937.
[44]S. Chapin, M. Clement, Q. Snell. A Grid Resource Management Architecture, strawman[C].Grid Forum Scheduling Working Group,1999,11.
[45]R. Buyya, S. Chapin, D. DiNucci. Architecture Models for Resource Management in the Grid [C].The First IEEE/ACM International Work-shop on Grid Computing(GRID2000). Springer Verlag,2000.
[46]R. Buyya, D. Abramson, J. Giddy, et al. Economic Models for Resource Management and Scheduling in Grid Computing [J]. The Journal of Concurrency and Computation:Practice and Experience(CCPE). Wiley Press,2002.14(13-15):1507-1542.
[47]D. Ferguson, Y. Yemini, C. Nikolaou. Microeconomic Algorithms for Load Balancing in Distributed Computer Systems[C]. Proceedings IEEE Int. Conf. on Distributed Computer Syst. San Jose,CA:[s.n.],1988:491-499.
[48]曹鸿强,肖侬,卢锡城,等.一种基于市场机制的计算网格资源调度方法[J].计算机研究与发展,2002,39(8)：913-916.
[49]翁楚良,陆鑫达.一种基于市场机制的网格资源调价算法[J].计算机研究与发展,2004,41(7)：1151-1156.
[50]M.M. Cendronl, C.B. Westphall. A Price-based Task Scheduling for Grid Computing[A].Proceedings of the 7th International Conference on Networking(ICN'08)[C]. Mexico:IEEE Computer Society,2008:762-766.
[51]蒋伟进,王璞.基于MAS市场机制的动态计算资源调度模型研究[J].计算机研究与发展,2007,44(1)：29-36
[52]M. Li, X. Chen, F. Jiao, et al. Optimization of Grid Resource Allocation Combining Fuzzy Theory with Generalized Assignment Problem [A]. Proceedings of the 6th International Conference on Grid and Cooperative Computing (GCC'07)[C]. Xinjiang:IEEE Computer Society,2007:142-146.
[53]C.M. Wang, H.M. Chen, C.C. Hsu, et al. Dynamic Resource Selection Heuristics for a Non-reserved Bidding-based Grid Environment [J]. Future Generation Computer Systems,2010,26(2):183-197.
[54]P. Ghosh, N. Roy, S. K. Das, et al. A Game Theory based Pricing Strategy for Job Allocation in Mobile Grids [A]. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04) [C]. Sata Fe:IEEE Computer Society, 2004,82.
[55]S. Penmatsa, A.T. Chronopoulos. Job Allocation Schemes in Computational Grids Based on Cost Optimization[A]. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)[C]. Denver:IEEE Computer Society,2005,180.
[56]K. Mong Sim, K. F. Ng. A Relaxed-Criteria Bargaining Protocol for Grid Resource Management [A]. Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid Workshops(CCGrid'06)[C]. Singapore:IEEE Computer Society,2006,8.
[57]K. Goswami, A. Gupta. Resource Selection in Grids Using Contract Net [A]. Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'08)[C]. Toulouse:IEEE Computer Society,2008: 105-109.
[58]R. Smith, R. Davis, The Contract Net Protocol:High Level Communication and Control in a Distributed Problem Solver, IEEE Transactions on Computers, Vol. C-29, No.12, pp.1104-1113,Dec.1.980, IEEE CS Press, USA.
[59]李立,刘元安,马晓雷.基于组合双向拍卖的网格资源分配[J].电子学报,2009,37(1)：165-169.
[60]R. Das, J. Hanson, J. Kephart, et al.Agent-human Interactions in the Continuous Double Auction [C].Proceedings of the Internation Joint Conferences in Artificial on Artificial Intellingence,2001.
[61]W. Vickrey. Counter-speculation,Auctions, and Competitive sealed tenders [J]. Journal of Finance,1961,16(1):9-37.
[62]B. Chun, D. Culler. Market-based Proportional Resource Sharing for Clusters [R]. Technical Report CSD-1092, University of California, Berkeley,2000.
[63]E. Crawley, R. Nair, B. Rajagopalan. A Framework for QoS-based Routing in the Internet[S]. USA:IETF RFC 2386,1998.
[64]B. Sabata, S. Chatterjee, M. Davis, et al. Taxonomy for QoS specifications. In:Proc. of the 3rd Int'l Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'97). Newreport Beach,1997:100-107.
[65]伍之昂, 罗军舟,宋爱波.基于QOS的网格资源管理[J].软件学报,2006,17(11)：2264-2276.
[66]R.J. Al-Ali, O.F. Rana, D.W. Walker, et al. G-QoSM:Grid Service Discovery Using QoS Properties [J]. Journal of Computing and Informatics, Special Issue on Grid Computing,2002,21(6):363-382.
[67]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation. [C]. Proceedings of International Workshop on Quality of Service, London,1999:27-36.
[68]W. Zhang, A. Cheng, M. Hu. Multisite Co-allocation Algorithms for Computational Grid [C]. In:Proceedings of International Parallel and Distributed Processing Symposium (IPDPS'06), April 25-29,2006, Rhodes Island, Greece:IEEE Computer Society Press,2006.
[69]J. Decker, J. Schneider. Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation [C]. Proceedings of International Symposium on Cluster Computing and the Grid (CCGrid'07), May 14-17,2007, Rio de Janeiro, Brazil:IEEE Computer Society Press,2007:335-342.
[70]A. Roy, V. Sander. Advance Reservation API [S]. GFD-E-5, Global Grid Forum Scheduling Working Group,2002.
[71]J.W. Cao, F. Zimmermann. Queue Scheduling and Advance Reservations with COSY [C]. Proceedings of International Parallel and Distributed Processing Symposium, New Mexico,2004.
[72]I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations, International Journal of High performance Computing Applications, vol.15, no.3,2001:200-222.
[73]A. Sulistio, R. Buyya. A Grid Simulation Infrastructure Supporting Advance Reservation [C]. Proceedings of International Conference on Parallel and Distributed Computing and Systems, Francisco,2004.
[74]A.C. Sodan, C. Doshi, L. Barsanti. Gang Scheduling and Adaptive Resource Allocation to Mitigate Advance Reservation Impact. [A] Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)[C]. Washington, DC, USA:IEEE Computer Society,2006:649-653.
[75]Q. Snell, M. Clement, D. Jackson, et al. The Performance Impact of Advance Reservation Metascheduling [C]. Proceedings of Job Scheduling Strategies for Parallel Processing, Mexico,2000:137-153.
[76]S. Naiksatam, S. Figueira, S.A. Chiappari, et al. Analyzing the Advance Reservation of Lightpaths in Lambda-Grids [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:985-992.
[77]T. Rolitz, A. Reinefeld. Co-Reservation with the Concept of Virtual Resources [C]. Proceeding of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:254-261.
[78]A. Sulistio, K.H. Kim, R. Buyya. Managing Cancellations and No-shows of Reservations with Overbooking to Increase Resource Revenue [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Lyon, 2008:267-276.
[79]D. Kuo, M. Mackeown. Advance Reservation and Co-allocation Protocol for Grid Computing [C]. Proceedings of IEEE International Conference on e-Science and Grid Computing, Melbourne,2005:80-89.
[80]U. Farooq, S. Majumdar, E.W. Parsons. Impact of Laxity on Scheduling with Advance Reservations in Grids [C]. Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Atlanta,2005:319-322.
[81]L. Wu, C. Wu, J. Cui, J. Xing. An Adaptive Advance Reservation Mechanism for Grid Computing [C]. Proceedings of International Conference on Parallel and Distributed Computing, Applications and Technologies, Dalian,2005:400-403.
[82]A. Sulistio, W. Schiffmann, R. Buyya. Advanced Reservation-based Scheduling of Task Graphs on Clusters [C]. Proceedings of IEEE International Conference on High Performance Computing, Bangalore,2006:18-21.
[83]N.R. Kaushik, S.M. Figueira, S.A. Chiappari. Flexible Time-Windows for Advance Reservation Scheduling [C]. Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, California,2006:218-225.
[84]M. Siddiqui, A. Villazon, T. Fahringer. Grid Capacity Planning with Negotiation-based Advance Reservation for Optimized QoS [C]. Proceedings of ACM/IEEE Conference on Supercomputing, Florida,2006:21-36.
[85]胡春明,怀进鹏,沃天宇.一种基于松弛时间的服务网格资源能力预留机制[J].计算机研究与发展,2007,44(1)：20-28.
[86]陈晓梅,卢锡城,王怀民.基于微观经济学方法的网络资源分配研究[J].计算机研究与发展,2001,38(11)：1345-1353.
[87]I. Foster, C. Kesselman,C. Lee et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation [C]. Proceedings of IEEE Int'l Workshop on Quality of Service, IEEE Computer Society Press, 1999:27-36.
[88]P.A. Dinda, D.R. O'Hallaron. Host Load Prediction Using Linear Models. Cluster Computing,2000,3(4):265-280.
[89]P.A. Dinda. The Statistical Properties of Host Load. Scientific Programming,1999, 7(3-4):211-229.
[90]R. Bhagwan, S. Savage, G. M. Voelker. Understanding Availability [J]. Lecture Notes in Computer Science,2003(2735):256-267.
[91]D.P. Anderson, Gilles Fedak. The Computational and Storage Potential of Volunteer Computing [A]. In:Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid (CCGrid'06)[C]. Singapore:IEEE Computer Society,2006: 73-80.
[92]J. Chu, K. Labonte, B. N. Levine. Availability and Locality Measurements of Peer-to-Peer File Systems [A]. Proceedings of ITCom:Scalability and Traffic Control in IP Networks[C]. Boston:IEEE Computer Society,2002:310-321.
[93]S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems [A]. Proceedings of Multimedia Computing and Neworking (MMCN'02)[C]. San Jose:The International Society of Optical Engineering,2002: 156-170.
[94]R. Arpaci, A. Dusseau, A. Vahdat, et al. The Interaction of Parallel and Sequential Workloads on a Network of Workstations [J]. ACM SIGMETRICS Performance Evaluation Review,1995,23(1):267-278.
[95]H. Casanova, A. Legrand, D. Zagorodnov, et al. Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. Proceedings of the 9th Heterogeneous Computing Workshop (HCW'00) [C]. Cancun:IEEE Computer Society,2000:349-363.
[96]P. Dinda. The Statistical Properties of Host Load [J]. Scientific Programming,7(3-4), 1999:211-229.
[97]R. Wolski, N. Spring, J. Hayes, Predicting the CPU Availability of Time-shared Unix Systems on the Computational Grid, Proceedings of the 8th IEEE Symp. on High Performance Distributed Computing,1999:1-8.
[98]R. Wolski, N. T. Spring, J. Hayes. The Network Weather Service:A Distributed Resource Performance Forecasting Service for Metacomputing [J]. Future Generation Computer Systems,1999,15(5):757-768.
[99]P.A. Dinda, D.R. O'Hallaron. An Extensible Toolkit for Resource Prediction in Distributed Systems [R]. Technical Report CMU-CS-99-138, School of Computer Science, Carnegie Mellon University,1999.
[100]P.A. Dinda. Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):160-173.
[101]M. Wu, X.H. Sun. Grid Harvest Service:A Performance System of Grid Computing [J]. Journal of Parallel and Distributed Computing,2006,66(10):1322-1337.
[102]A. Iosup, M. Jan, O. Sonmez, et al. On the dynamic resource availability in grids [C]. Proceedings of the 8th IEEE/ACM International Conference on Grid Computing. Austin, USA:IEEE Press,2007:26-33.
[103]L.G. Gong, X. H. Sun, E. Watson. Performance Modeling and Prediction of Non-dedicated Network Computing [J]. IEEE Transactions on Computers,2002, 51(9):1041-1055.
[104]D. Kondo, G. Fedak, et al. Resource Availability in Enterprise Desktop Grids [EB/OL]. [2006-01-11]. http://hal.inria.fr/inria-00000994/en/.
[105]M.W. Mutka. Sharing In a Privately Owned Workstation Environment [D]. Ph.D, University Of Wisconsin-Madison,1988.
[106]P.A. Dinda. The Statistical Properties of Host Load [C]. Proceedings of the Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR98). Pittsburgh,1998.
[107]M.E Crovella, A. Bustavros. Self-Similarity in World Wide Web Traffic:Evidence and Possible Causes [J]. IEEE/ACM Transactions on Networking,1997,6(5):835-846.
[108]P.A. Dinda, D. R. O'Hallaron. An Evaluation of Linear Models for Host Load Prediction [C]. Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing (HPDC-8). Redondo Beach,1999.
[109]P.A. Dinda. Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):160-173.
[110]A. Eswaradass, X. H. Sun, M. Wu. A Neural Network Based Predictive Mechanism for Available Bandwidth [C]. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05). Denver,2005.
[111]V. Berten, J. Goossens, and E. Jeannot. On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):113-124.
[112]X.J. Ren, S. Lee, R. Eigenmann, et al. Prediction of Resource Availability in Fine-Grained Cycle Sharing Systems Empirical Evaluation [J]. Journal of Grid Computing,2007,5:173-195.
[113]武斌.杨寿保.刘晓茜一种动态网格资源可用性风险评价方法[J]-中国科学技术大学学报2010(8)：870-875
[114]李志洁,程春田,黄飞雪等.一种基于序贯博弈的网格资源分本策略[J].软件学报,(3)：49-52
[115]R. Buyya, M. Murshed. GridSim:A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing.Concurrency and Computation:Practice and Experience,2002,14:1175-1220.
[116]A. Iosup, M. Jan, O. Sonmez, D. H. J. Epema. On the Dynamic Resource Availability in Grids. In Proceeding of 8th IEEE/ACM International Conference on Grid Computing (Grid'07),2007:26-33
[117]李茂胜,杨寿保,付前飞,杨锦.基于赔偿的网格资源交易模型[J].软件学报,2006,17(3)：472-480.
[118]M. Osborne, A. Rubinstein. A Course in Game Theory [M]. The MIT Press, Cambridge,1994.
[119]S. Roy, C. Melodidakis. Game theory:An Overview [J].The ICFAI Journal of Managerial Economics,2005,3(4):46-53.
[120]张维迎.信息经济学与博弈论[M].上海：上海人民出版社,2004.
[121]T. S. Ferguson, C. Melolidakis.Games with Finite Resources [J]. International Journal of Game Theory,2002,29(2):289-303.
[122]J. Nash. Non-cooperative games [J].Annals of Mathematics,1951,54(2):286-295.
[123]Y.K. Kwok, S.S. Song, K. Hwang. Selfish Grid Computing:Game-Theoretic Modeling and NAS Performance Results [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:1143-1150.
[124]Y.K. Kwok, K. Hwang, S.S. Song. Selfish Grids:Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation [J]. IEEE Transactions on Parallel and Distributed Systems,2007,18(5):621-636.
[125]R.T. Maheswaran, T. Basar. Nash Equilibrium and Decentralized Negotiation in Auctioning Divisible Resources. Group Decision and Negotiation,2003,12(5):361-395.
[126]J. Bredin, D. Kotz, D. Rus, et al. Computational Markets to Regulate Mobile-agent Systems. Autonomous Agents and Multi-Agent Systems,2003,6(3):235-263.
[127]P. Ghosh, N. Roy, S.K. Das, et al. A Game Theory based Pricing Strategy for Job Allocation in Mobile Grids [C]. Proceedings of International Parallel and Distributed Processing Symposium, New Mexico,2004.
[128]K. Rzadca, D. Trystram, A. Wierzbicki. Fair Game-Theoretic Resource Management in Dedicated Grids [C]. Proceedings of International Symposium on Cluster Computing and the Grid, Rio de Janeiro,2007:343-350.
[129]S.U. Khan, I. Ahmad. Non-cooperative, Semi-cooperative, and Cooperative Games-based Grid Resource Allocation [C]. Proceedings of International Parallel and Distributed Processing Symposium, Greece,2006.
[130]D. Ferguson, C. Nikolaou, J. Sairamesh, et al. Economic models for allocating resources in computer systems, in:Market-Based Control:A Paradigm for Distributed Resource Allocation, World Scientific,Singapore,1996.
[131]黄冠尧,洪佩琳,李津生.P2P-VCG：一种基于博弈论的带宽分配方案[J].计算机研究与发展,2007,44(1)：78-84.
[132]陈宝林.最优化理论与算法.第1版[M].北京：清华大学出版社,1989：527-530
[133]Markowitz. Portfolio selection [J]. Journal of Finanace,1952,(7):77-91.
[134]王春峰.金融市场风险管理[M].天津：天津大学出版社,2001.
[135]安起光,王厚杰,张文清.基于机会约束的均值-VaR投资组合模型研究[J].山东大学学报(理学版),2005,(6).
[136]U. Lublin, D.G. Feitelson. The Workload on Parallel Supercomputers:Modeling the Characteristics of Rigid Jobs[J]. Journal of Parallel and Distributed Computing,2003, 63:1105-1122.
[137]I.E. Sutherland. A futures market in computer time.communications of the ACM, 1968,11(6),449-451.
[138]C. Waldspurger, T. Hogg, B. Huberman, et al. Spawan:Adistributed computation economy. IEEE Transactions on Software Engineering, Vol.18,No.2,IEEE CS Press, USA, February,1992.
[139]N. R. Bogan, Economic Allocation of Computation Time with Computation Markets. MIT Laboratory for Computer Science Technical Report 633, August 1994.
[140]O. Regev, N. Nisan.The Popcorn Market:An Online Market for Computational Resources. Proceedings of the 1st International Conference on Information and Computational Economies, Charleston,SC, October 1998:148-157.
[141]L Boloni, D.C. Marinescu. An Object-oriented Framework for Building Collaborative Network Agents. In telligeng Systems and Interfaces. Netherlandw:Kluwer Publishing House,2000:31-64.
[142]R. Wolski, J.S. Plank, J. Brevik, et al. Analyzing Market-based Resource Allocation Strategies for the Computational Grid [J]. International Journal of High Performance Computing Application,2001,15(3):258-281.
[143]D. Abramson, J. Giddy, L. Kotler. High Performance Parametric Modeling with Nimrod-G:Killer Application for the Global Grid [C]. Cancun, Mexico:14th Internation Parallel and Distributed Processing Symposium (IPDPS'00),2000.
[144]R. Buyya, S.Venugopal. The Gridbus Toolkit for Service Oriented Grid and Utility Computing:An Overview and Status Report. GECON 2004, Seoul, Korea, Apr.2004.
[145]R. Buyya, D.Abramson, S. Venugopal. The Grid Economy. Special Issue on Grid Computing,2005,93(3):698-714.
[146]K. Subramoniam, M. Maheswaran,M.Toulouse.Towards a Micro-Economic Model for Resource Allocation in Grid Computing Systems. In:Proc. Canadian Conf. on Electrical &Computer Engineering,2002.
[147]张金水.经济控制论.北京：清华大学出版社,1989(1)：265-272.
[148]曹鸿强,肖侬,卢锡城等.一种基于市场机制的计算网格资源分配方法[J].计算机研究与发展,2002,39(8)：349-356.
[149]李茂胜.基于市场的网格资源管理研究[D].合肥：中国科学技术大学博士学位论文,2006.
[150]J.Q. Cheng, M.P. Wellman1. The WALRAS Algorithm:A Convergent Distributed Implementation of General Equilibrium Outcomes. Computational Economics,1998, 12(1):1-24.
[151]H.R. Varian. Microeconomic Analysis,3rd ed. New York:W.W. Norton & Company, 1992.
[152]S. Ran. A model for Web sevices discovery with QoS. ACM SIGEcom Exchanges, 2003,4(1):1-10.
[153]Y. Liu, A. Ngu, L. Zeng. QoS Computation and Policing in Dynamic Web Service Selection. In:Proc. of the WWW 2004. New York:ACM Press,2004:66-73. http://portal.acm.org/citation.cfm?id=1010444.
[154]李研,周明辉,李瑞超等.一种考虑QoS数据可信性的服务选择方法[J].软件学报.2008,10(19)：2620-2627.
[155]黄飞雪,李志洁.网格资源经济配置[M].北京：科学出版社,2010.
[156]A. Sulistio, R. Buyya. A Grid Simulation Infrastructure Supporting Advance Reservation[A] Proceedings of the 16th Int'l Conf. on Parallel and Distributed Computing and Systems[C]. Cambridge USA:ACTA Press,2004:1-7.
[157]W. Smith, I. Foster, V. Taylor. Scheduling With Advanced Reservations [A]. Proceedings of the 14th Int'l Parallel and Dist. Proc. Symp[C].New York, NY, USA: ACM,2000.:289-290.
[158]M. Wu, X.H. Sun, Y. Chen. QoS Oriented Resource Reservation in Shared Environments [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Singapore,2006.
[159]L.O. Burchard, B. Linnert, J. Schneider. A Distributed Load-Based Failure Recovery Mechanism for Advance Reservation Environments [C]. Proceeding of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:1071-1078.
[160]H. Zhao, R. Sakellariou. Advance Reservation Policies for Workflows [A]. Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'06)[C]. Saint-Malo, France:ACM Press,2006:47-67.
[161]Kris Bubendorfer. Fine Grained Resource Reservation in Open Grid Economies [A].Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (e-Science'06)[C]. Washington, DC, USA:IEEE Computer Society,2006:81-87.
[162]J. B. Xing, C. Wu, M. L. Tao, et al. Flexible Advance Reservation for Grid Computing[A].The 2nd International Workshop on Grid and Cooperative Computing(GCC'03)[C], Shaihai:Lecture notes in computer science,2003.241-248.
[163]P. Xiao, Z.G. Hu. Relaxed Resource Advance Reservation Policy in Grid Computing [J]. Journal of China Universities of Posts and Telecommunications,2009,16(3): 108-113.
[164]A.W. Mu'alem, D.G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling [J]. IEEE Transactions on Parallel and Distributed Systems,2001,12(6):529-543.
[165]U. Farooq, S. Majumdar, E.W. Parsons, A Frame to Achieve Guaranteed QoS for Applications and High System Performance in Multi-Institutional Grid Computing, Proceedings of the 2006 International Conference on Parallel Processing (ICPP'06),2006:373-380.
[166]A. Sulistio, K. H. Kim, R. Buyya, Using Revenue Management to Determine Pricing of Reservations, Third IEEE International Conference on e-Science and Grid Computing,2007:396-404.
[167]G. Singh, C. Kesselman, E. Deelman. Adaptive Pricing for Resource Reservations in Shared Environments, in the 8th Grid Computing Conference,2007:74-80.
[168]D.M. Nicol, W.H. Sanders, K.S. Trivedi. Model-Based Evaluation:From Dependability to Security [J]. IEEE Transactions on Dependable and Secure Computing,2004, 1(1):48-65.
[169]Y.S. Dai, M. Xie, K.L. Poh. Reliability of Grid Service Systems [J].Computers and Industrial Engineering,2006,50(1-2):130-147.
[170]A. Avizienis, J.C. Laprie, B. Randell, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing [J]. IEEE Transactions on Dependable and Secure Computing,2004,1(1):11-33.
[171]P. Townend, J. Xu. Dependability in Grids [J]. IEEE Distributed Systems Online, 2005,6(12):1-1.
[172]V. Sander. Networking Issues for Grid Infrastructure [S].Informational Document GFD-Ⅰ.037, Open Grid Forum,2004.
[173]P. Resnick, R. Zeckhauser. Trust Among Strangers in Internet Transactions:Empirical Analysis of eBay's Reputation System. In:Working Paper for the NBER Workshop on Empirical Studies of Electronic Commerce.2001.
[174]F. Cornelli, E. Damiani, S. Vimercati, et al. Choosing Reputable Servents in a P2P Network. In:Lassner D, ed. Proceedings of the 11th Int'l WWW Conf. Hawaii:ACM Press,2002:376-386.
[175]S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina. The Eigen Trust Algorithm for Reputation Management in P2P Networks. Proceedings of the 12th WWW Conf. Budapest:ACM Press,2003:640-651.
[176]M. Xie, Y.S.Dai, K.L. Poh. Computing Systems Reliability [M].New York:Kluwer Academic Publishers,2004.
[177]Y.S. Dai, M. Xie, K.L. Poh. Reliability of Grid Service Systems [J].Computers and Industrial Engineering,2006,50(1-2):130-147.
[178]Grid Reliability:A Study of Failures on the Egee Infrastructure. Kyriacos Neocleous and Marios D. Dikaiakos.
[179]S.C. Guo,H.Z Huang, Z.L. Wang, et al.Grid Service Reliability Modeling and Optimal Task Scheduling Considering Fault Recovery [J].2011,60(1):263-274.
[180]张利永,韩燕波.一种主动式的网格工作流可靠性保障方法[J].中山大学学报(自然科学版),2008,47(6)：93-99.
[181]马满福,姚军.网格计算经济中资源的可靠性控制[J].计算机工程与设计,2008,29(2)：337-339
[182]Taverna User Manua. http://www.mygrid.org.uk/user manual 1.7[Z],2008.
[183]X.H. Sun, M. Wu. Grid Harvest Service:A System for Long-term, Application-level Task Scheduling [A]. Proceedings of Int'l Symposium on Parallel and Distributed Processing. Nice, France:IEEE Computer Society Press,2003.
[184]M. Wu, X.H. Sun, Y. Chen. QoS Oriented Resource Reservation in Shared Environments [A]. Proceedings of International Symposium on Cluster Computing and the Grid, Singapore, IEEE Computer Society Press,2006:601-608.
[185]U. Lublin, D.G. Feitelson. The Workload on Parallel Supercomputers:Modeling the Characteristics of Rigid Jobs [J]. Journal of Parallel and Distributed Computing,2003, 63:1105-1122.
[186]A. Iosup, M. Jan, O. Sonmez, et al. The Characteristics and Performance of Groups of Jobs in Grids[J]. Lecture Notes on Computer Science,2007,4641:382-393.
[187]D. Gross, C.M. Harris. Fundamentals of queuing theory [M]. USA:John Wiley and Sons,1998.
[188]肖鹏,胡志刚.面向实时网格任务的多策略资源协同分配模型[J].吉林大学学报(工学版)2010,40(01)：224-0223.
[2]I. Foster. The grid:Computing without bonds. Scientific American,2003, 288(4):78-85.
[3]G. W. Yang, H. Jin, M.L. Li. Grid computing in China. Journal of Grid Computing, 2004,2(2):193-206.
[4]H. Jin, D.Q. Zou, Z.F. Han. Implementation of a grid system based on Web. Mini-Micro Systems,2003,24(12):2053-2056.
[5]I. Foster, C. Kesselman. The Grid:Blueprint for a New Computing Infrastructure [M]. San Francisco, CA:Morgan Kaufmann,1999.
[6]Protein Data Bankworldwide Repository for the Processing and Distribution of 3-D Biological Macromolecular Structure Data. http://www.rcsb.org/pdb/.
[7]MyGrid-Directly Supporting the e-Scientist. http://www.mygrid.info/.
[8]NASA Information Power Grid. http://www.ipg.nasa.gov/.
[9]GEODISE Grid for Engineering Design Search and Optimization Involving Fluid Dynamics. http://www.geodise.org/.
[10]Distributed Aircraft Maintenance Environment DAME. http://www.iri.leeds.ac.uk/Projects/IAProjects/kariml.htm
[11]Grid Physics (Particle Physics, Astronomy, Experimental Gravitational waves) Network Gri-Phyn. http://www.griphyn.org/.
[12]Particle Physics Data Grid. http://www.ppdg.net/.
[13]Butterfly Grid for Multiplayer Games. http://www.butterfly.net/.
[14]Everquest Multiplayer Gaming Environment. http://www.everquest.com.
[15]H. Jin. Challenges of grid computing. In:W. Fan, Z. Wu, J. Yang, eds. Advances in Web-Age Information Management:Proceedings of the 6th Int'l Conf. LNCS 3739, Berlin:Springer-Verlag,2005.25-31.
[16]K. Krauter, R. Buyya, M. Maheswaran. A Taxonomy and Survey of Grid Resource Management System for Distributed Computing. Software:Practice and Experience, 2002,32(2):135-164.
[17]J. Ding, G.L. Chen, J. Gu. A Unified Resource Mapping Strategy in Computational Grid Environments. Journal of Software,2002,13(7):1303-1308.
[18]W.S. Zhang, G.W. Yang, M.M. Shen, et al. RSDictionary A Global Namespace for Distributed Computing Environment. Journal of Computer Research and Development,2005,42(8):1409-1414.
[19]W. Li, Z.W. Xu, G.Y. Bu, et al. An Effective Resource Locating Algorithm in Grid Environments. Chinese Journal of Computers,2003,26(11):1546-1549.
[20]邵凌霜,李田,赵俊峰,等.一种可扩展的Web Service QoS管理框架.计算机学报,2008,31(8)：1458-1470.
[21]I. Foster. What is the Grid? A Three Point Checklist. GRID Today,2002,1(6):20-27.
[22]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation [A]. Proceedings of International Workshop on QoS [C]. London, UK:IEEE Computer Society Press, 1999.27-36.
[23]I. Foster, A. Roy, V. Sander. A Quality of Service Architecture that Combines Resource Reservation and Application Adaptation [A]. Proceedings of International Workshop on QoS [C]. Pittsburgh USA:IEEE Computer Society Press,2000: 181-188.
[24]I. Foster, C. Kesselman. Globus:A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications,1997,11 (2):115-128.
[25]A.S. Grimshaw, W.A. Wulf. The Legion Vision of a Worldwide Virtual Computer [J]. Communications of the ACM,1997,40(1):39-45.
[26]M. Lewis, A.J. Ferrari, M.A. Humphery, et al. Support for Extensibility and Site Autonomy in the Legion Grid System Object Model [J]. Journal of Parallel and Distributed Computing,2003,63(5):525-538.
[27]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation [A]. In: International Workshop on Quality of Service (IWQoS'99) [C]. London:IEEE Computer Society,1999:27-36.
[28]FAFNER:Factoring via Network-Enabled Recursion. http://cs-www.bu.edu/cgi-bin/FAFNER/factor.pl
[29]I. Foster, J. Geisler, S. Tuecke. MPI on the I-WAY:A Wide-Area, Multimethod Implementation of the Message Passing Interface. Proc.1996 MPI Developers Conference,1996:10-17.
[30]http://setiathome.ssl.berkeley.edu/.
[31]http://www.distributed.net.
[32]I. Foster, C. Kesselman, S. Tuecke.The Anatomy of the Grid:Enabling Scalable Virtual Organizations [J]. Internation Journal of Supercomputer Applications, 2001,15(3):200-222.
[33]I. Foster, H. Kishimoto, A. Sawa, et al. The Open Grid Services Architecture[S]. GFD-Ⅰ.30, Global Grid Forum,2005.
[34]胡春明,怀进鹏,沃天宇,雷磊.一种支持端到端QoS的服务网格体系结构[J].软件学报,2006,17(6)：1448-1458.
[35]S. Benkner, I. Brandic, G. Engelbrecht, R. Schmidt. VGE-A Service-Oriented Grid Environment for On-Demand Supercomputing [C]. Proceedings of IEEE/ACM International Workshop on Grid Computing, Pittsburgh,2004:11-18.
[36]I. Foster, T. Maguire, D. Snelling. OGSATM WSRF Basic Profile 1.0 [S]. GFD-R-72, Open Grid Forum,2006.
[37]I. Foster, C. Kesselman, S. Tuecke. Anatomyof a Grid. http://www.globus.org/research/papers/anatomy.pdf,2007-2-1.
[38]I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations. International Journal of Supercomputing Applications, Vol.15, No.3,2002.
[39]徐志伟,冯百明,李伟.网格计算技术[M].北京：电子工业出版社,2004.
[40]胡明生.网格环境中决策资源协同调度研究[D].武汉：华中科技大学,2006：
[41]都志辉,陈渝,刘鹏.网格计算.北京：清华大学出版社,2002年10月第1版.
[42]J. Nabrzyski, J. Schopf, J.Weglarz. Grid resource Management:State of the Art and Research Issues.2003.
[43]鲁黎,杨寿保,刘鹏展等.基于动态定价的网格资源调度系统设计与仿真[J].系统仿真学报,2006,18(4)：932-937.
[44]S. Chapin, M. Clement, Q. Snell. A Grid Resource Management Architecture, strawman[C].Grid Forum Scheduling Working Group,1999,11.
[45]R. Buyya, S. Chapin, D. DiNucci. Architecture Models for Resource Management in the Grid [C].The First IEEE/ACM International Work-shop on Grid Computing(GRID2000). Springer Verlag,2000.
[46]R. Buyya, D. Abramson, J. Giddy, et al. Economic Models for Resource Management and Scheduling in Grid Computing [J]. The Journal of Concurrency and Computation:Practice and Experience(CCPE). Wiley Press,2002.14(13-15):1507-1542.
[47]D. Ferguson, Y. Yemini, C. Nikolaou. Microeconomic Algorithms for Load Balancing in Distributed Computer Systems[C]. Proceedings IEEE Int. Conf. on Distributed Computer Syst. San Jose,CA:[s.n.],1988:491-499.
[48]曹鸿强,肖侬,卢锡城,等.一种基于市场机制的计算网格资源调度方法[J].计算机研究与发展,2002,39(8)：913-916.
[49]翁楚良,陆鑫达.一种基于市场机制的网格资源调价算法[J].计算机研究与发展,2004,41(7)：1151-1156.
[50]M.M. Cendronl, C.B. Westphall. A Price-based Task Scheduling for Grid Computing[A].Proceedings of the 7th International Conference on Networking(ICN'08)[C]. Mexico:IEEE Computer Society,2008:762-766.
[51]蒋伟进,王璞.基于MAS市场机制的动态计算资源调度模型研究[J].计算机研究与发展,2007,44(1)：29-36
[52]M. Li, X. Chen, F. Jiao, et al. Optimization of Grid Resource Allocation Combining Fuzzy Theory with Generalized Assignment Problem [A]. Proceedings of the 6th International Conference on Grid and Cooperative Computing (GCC'07)[C]. Xinjiang:IEEE Computer Society,2007:142-146.
[53]C.M. Wang, H.M. Chen, C.C. Hsu, et al. Dynamic Resource Selection Heuristics for a Non-reserved Bidding-based Grid Environment [J]. Future Generation Computer Systems,2010,26(2):183-197.
[54]P. Ghosh, N. Roy, S. K. Das, et al. A Game Theory based Pricing Strategy for Job Allocation in Mobile Grids [A]. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04) [C]. Sata Fe:IEEE Computer Society, 2004,82.
[55]S. Penmatsa, A.T. Chronopoulos. Job Allocation Schemes in Computational Grids Based on Cost Optimization[A]. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)[C]. Denver:IEEE Computer Society,2005,180.
[56]K. Mong Sim, K. F. Ng. A Relaxed-Criteria Bargaining Protocol for Grid Resource Management [A]. Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid Workshops(CCGrid'06)[C]. Singapore:IEEE Computer Society,2006,8.
[57]K. Goswami, A. Gupta. Resource Selection in Grids Using Contract Net [A]. Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'08)[C]. Toulouse:IEEE Computer Society,2008: 105-109.
[58]R. Smith, R. Davis, The Contract Net Protocol:High Level Communication and Control in a Distributed Problem Solver, IEEE Transactions on Computers, Vol. C-29, No.12, pp.1104-1113,Dec.1.980, IEEE CS Press, USA.
[59]李立,刘元安,马晓雷.基于组合双向拍卖的网格资源分配[J].电子学报,2009,37(1)：165-169.
[60]R. Das, J. Hanson, J. Kephart, et al.Agent-human Interactions in the Continuous Double Auction [C].Proceedings of the Internation Joint Conferences in Artificial on Artificial Intellingence,2001.
[61]W. Vickrey. Counter-speculation,Auctions, and Competitive sealed tenders [J]. Journal of Finance,1961,16(1):9-37.
[62]B. Chun, D. Culler. Market-based Proportional Resource Sharing for Clusters [R]. Technical Report CSD-1092, University of California, Berkeley,2000.
[63]E. Crawley, R. Nair, B. Rajagopalan. A Framework for QoS-based Routing in the Internet[S]. USA:IETF RFC 2386,1998.
[64]B. Sabata, S. Chatterjee, M. Davis, et al. Taxonomy for QoS specifications. In:Proc. of the 3rd Int'l Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'97). Newreport Beach,1997:100-107.
[65]伍之昂, 罗军舟,宋爱波.基于QOS的网格资源管理[J].软件学报,2006,17(11)：2264-2276.
[66]R.J. Al-Ali, O.F. Rana, D.W. Walker, et al. G-QoSM:Grid Service Discovery Using QoS Properties [J]. Journal of Computing and Informatics, Special Issue on Grid Computing,2002,21(6):363-382.
[67]I. Foster, C. Kesselman, C. Lee, et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation. [C]. Proceedings of International Workshop on Quality of Service, London,1999:27-36.
[68]W. Zhang, A. Cheng, M. Hu. Multisite Co-allocation Algorithms for Computational Grid [C]. In:Proceedings of International Parallel and Distributed Processing Symposium (IPDPS'06), April 25-29,2006, Rhodes Island, Greece:IEEE Computer Society Press,2006.
[69]J. Decker, J. Schneider. Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation [C]. Proceedings of International Symposium on Cluster Computing and the Grid (CCGrid'07), May 14-17,2007, Rio de Janeiro, Brazil:IEEE Computer Society Press,2007:335-342.
[70]A. Roy, V. Sander. Advance Reservation API [S]. GFD-E-5, Global Grid Forum Scheduling Working Group,2002.
[71]J.W. Cao, F. Zimmermann. Queue Scheduling and Advance Reservations with COSY [C]. Proceedings of International Parallel and Distributed Processing Symposium, New Mexico,2004.
[72]I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations, International Journal of High performance Computing Applications, vol.15, no.3,2001:200-222.
[73]A. Sulistio, R. Buyya. A Grid Simulation Infrastructure Supporting Advance Reservation [C]. Proceedings of International Conference on Parallel and Distributed Computing and Systems, Francisco,2004.
[74]A.C. Sodan, C. Doshi, L. Barsanti. Gang Scheduling and Adaptive Resource Allocation to Mitigate Advance Reservation Impact. [A] Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)[C]. Washington, DC, USA:IEEE Computer Society,2006:649-653.
[75]Q. Snell, M. Clement, D. Jackson, et al. The Performance Impact of Advance Reservation Metascheduling [C]. Proceedings of Job Scheduling Strategies for Parallel Processing, Mexico,2000:137-153.
[76]S. Naiksatam, S. Figueira, S.A. Chiappari, et al. Analyzing the Advance Reservation of Lightpaths in Lambda-Grids [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:985-992.
[77]T. Rolitz, A. Reinefeld. Co-Reservation with the Concept of Virtual Resources [C]. Proceeding of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:254-261.
[78]A. Sulistio, K.H. Kim, R. Buyya. Managing Cancellations and No-shows of Reservations with Overbooking to Increase Resource Revenue [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Lyon, 2008:267-276.
[79]D. Kuo, M. Mackeown. Advance Reservation and Co-allocation Protocol for Grid Computing [C]. Proceedings of IEEE International Conference on e-Science and Grid Computing, Melbourne,2005:80-89.
[80]U. Farooq, S. Majumdar, E.W. Parsons. Impact of Laxity on Scheduling with Advance Reservations in Grids [C]. Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Atlanta,2005:319-322.
[81]L. Wu, C. Wu, J. Cui, J. Xing. An Adaptive Advance Reservation Mechanism for Grid Computing [C]. Proceedings of International Conference on Parallel and Distributed Computing, Applications and Technologies, Dalian,2005:400-403.
[82]A. Sulistio, W. Schiffmann, R. Buyya. Advanced Reservation-based Scheduling of Task Graphs on Clusters [C]. Proceedings of IEEE International Conference on High Performance Computing, Bangalore,2006:18-21.
[83]N.R. Kaushik, S.M. Figueira, S.A. Chiappari. Flexible Time-Windows for Advance Reservation Scheduling [C]. Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, California,2006:218-225.
[84]M. Siddiqui, A. Villazon, T. Fahringer. Grid Capacity Planning with Negotiation-based Advance Reservation for Optimized QoS [C]. Proceedings of ACM/IEEE Conference on Supercomputing, Florida,2006:21-36.
[85]胡春明,怀进鹏,沃天宇.一种基于松弛时间的服务网格资源能力预留机制[J].计算机研究与发展,2007,44(1)：20-28.
[86]陈晓梅,卢锡城,王怀民.基于微观经济学方法的网络资源分配研究[J].计算机研究与发展,2001,38(11)：1345-1353.
[87]I. Foster, C. Kesselman,C. Lee et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation [C]. Proceedings of IEEE Int'l Workshop on Quality of Service, IEEE Computer Society Press, 1999:27-36.
[88]P.A. Dinda, D.R. O'Hallaron. Host Load Prediction Using Linear Models. Cluster Computing,2000,3(4):265-280.
[89]P.A. Dinda. The Statistical Properties of Host Load. Scientific Programming,1999, 7(3-4):211-229.
[90]R. Bhagwan, S. Savage, G. M. Voelker. Understanding Availability [J]. Lecture Notes in Computer Science,2003(2735):256-267.
[91]D.P. Anderson, Gilles Fedak. The Computational and Storage Potential of Volunteer Computing [A]. In:Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid (CCGrid'06)[C]. Singapore:IEEE Computer Society,2006: 73-80.
[92]J. Chu, K. Labonte, B. N. Levine. Availability and Locality Measurements of Peer-to-Peer File Systems [A]. Proceedings of ITCom:Scalability and Traffic Control in IP Networks[C]. Boston:IEEE Computer Society,2002:310-321.
[93]S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems [A]. Proceedings of Multimedia Computing and Neworking (MMCN'02)[C]. San Jose:The International Society of Optical Engineering,2002: 156-170.
[94]R. Arpaci, A. Dusseau, A. Vahdat, et al. The Interaction of Parallel and Sequential Workloads on a Network of Workstations [J]. ACM SIGMETRICS Performance Evaluation Review,1995,23(1):267-278.
[95]H. Casanova, A. Legrand, D. Zagorodnov, et al. Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. Proceedings of the 9th Heterogeneous Computing Workshop (HCW'00) [C]. Cancun:IEEE Computer Society,2000:349-363.
[96]P. Dinda. The Statistical Properties of Host Load [J]. Scientific Programming,7(3-4), 1999:211-229.
[97]R. Wolski, N. Spring, J. Hayes, Predicting the CPU Availability of Time-shared Unix Systems on the Computational Grid, Proceedings of the 8th IEEE Symp. on High Performance Distributed Computing,1999:1-8.
[98]R. Wolski, N. T. Spring, J. Hayes. The Network Weather Service:A Distributed Resource Performance Forecasting Service for Metacomputing [J]. Future Generation Computer Systems,1999,15(5):757-768.
[99]P.A. Dinda, D.R. O'Hallaron. An Extensible Toolkit for Resource Prediction in Distributed Systems [R]. Technical Report CMU-CS-99-138, School of Computer Science, Carnegie Mellon University,1999.
[100]P.A. Dinda. Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):160-173.
[101]M. Wu, X.H. Sun. Grid Harvest Service:A Performance System of Grid Computing [J]. Journal of Parallel and Distributed Computing,2006,66(10):1322-1337.
[102]A. Iosup, M. Jan, O. Sonmez, et al. On the dynamic resource availability in grids [C]. Proceedings of the 8th IEEE/ACM International Conference on Grid Computing. Austin, USA:IEEE Press,2007:26-33.
[103]L.G. Gong, X. H. Sun, E. Watson. Performance Modeling and Prediction of Non-dedicated Network Computing [J]. IEEE Transactions on Computers,2002, 51(9):1041-1055.
[104]D. Kondo, G. Fedak, et al. Resource Availability in Enterprise Desktop Grids [EB/OL]. [2006-01-11]. http://hal.inria.fr/inria-00000994/en/.
[105]M.W. Mutka. Sharing In a Privately Owned Workstation Environment [D]. Ph.D, University Of Wisconsin-Madison,1988.
[106]P.A. Dinda. The Statistical Properties of Host Load [C]. Proceedings of the Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR98). Pittsburgh,1998.
[107]M.E Crovella, A. Bustavros. Self-Similarity in World Wide Web Traffic:Evidence and Possible Causes [J]. IEEE/ACM Transactions on Networking,1997,6(5):835-846.
[108]P.A. Dinda, D. R. O'Hallaron. An Evaluation of Linear Models for Host Load Prediction [C]. Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing (HPDC-8). Redondo Beach,1999.
[109]P.A. Dinda. Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):160-173.
[110]A. Eswaradass, X. H. Sun, M. Wu. A Neural Network Based Predictive Mechanism for Available Bandwidth [C]. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05). Denver,2005.
[111]V. Berten, J. Goossens, and E. Jeannot. On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids [J]. IEEE Transactions on Parallel and Distributed System,2006,17(2):113-124.
[112]X.J. Ren, S. Lee, R. Eigenmann, et al. Prediction of Resource Availability in Fine-Grained Cycle Sharing Systems Empirical Evaluation [J]. Journal of Grid Computing,2007,5:173-195.
[113]武斌.杨寿保.刘晓茜一种动态网格资源可用性风险评价方法[J]-中国科学技术大学学报2010(8)：870-875
[114]李志洁,程春田,黄飞雪等.一种基于序贯博弈的网格资源分本策略[J].软件学报,(3)：49-52
[115]R. Buyya, M. Murshed. GridSim:A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing.Concurrency and Computation:Practice and Experience,2002,14:1175-1220.
[116]A. Iosup, M. Jan, O. Sonmez, D. H. J. Epema. On the Dynamic Resource Availability in Grids. In Proceeding of 8th IEEE/ACM International Conference on Grid Computing (Grid'07),2007:26-33
[117]李茂胜,杨寿保,付前飞,杨锦.基于赔偿的网格资源交易模型[J].软件学报,2006,17(3)：472-480.
[118]M. Osborne, A. Rubinstein. A Course in Game Theory [M]. The MIT Press, Cambridge,1994.
[119]S. Roy, C. Melodidakis. Game theory:An Overview [J].The ICFAI Journal of Managerial Economics,2005,3(4):46-53.
[120]张维迎.信息经济学与博弈论[M].上海：上海人民出版社,2004.
[121]T. S. Ferguson, C. Melolidakis.Games with Finite Resources [J]. International Journal of Game Theory,2002,29(2):289-303.
[122]J. Nash. Non-cooperative games [J].Annals of Mathematics,1951,54(2):286-295.
[123]Y.K. Kwok, S.S. Song, K. Hwang. Selfish Grid Computing:Game-Theoretic Modeling and NAS Performance Results [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:1143-1150.
[124]Y.K. Kwok, K. Hwang, S.S. Song. Selfish Grids:Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation [J]. IEEE Transactions on Parallel and Distributed Systems,2007,18(5):621-636.
[125]R.T. Maheswaran, T. Basar. Nash Equilibrium and Decentralized Negotiation in Auctioning Divisible Resources. Group Decision and Negotiation,2003,12(5):361-395.
[126]J. Bredin, D. Kotz, D. Rus, et al. Computational Markets to Regulate Mobile-agent Systems. Autonomous Agents and Multi-Agent Systems,2003,6(3):235-263.
[127]P. Ghosh, N. Roy, S.K. Das, et al. A Game Theory based Pricing Strategy for Job Allocation in Mobile Grids [C]. Proceedings of International Parallel and Distributed Processing Symposium, New Mexico,2004.
[128]K. Rzadca, D. Trystram, A. Wierzbicki. Fair Game-Theoretic Resource Management in Dedicated Grids [C]. Proceedings of International Symposium on Cluster Computing and the Grid, Rio de Janeiro,2007:343-350.
[129]S.U. Khan, I. Ahmad. Non-cooperative, Semi-cooperative, and Cooperative Games-based Grid Resource Allocation [C]. Proceedings of International Parallel and Distributed Processing Symposium, Greece,2006.
[130]D. Ferguson, C. Nikolaou, J. Sairamesh, et al. Economic models for allocating resources in computer systems, in:Market-Based Control:A Paradigm for Distributed Resource Allocation, World Scientific,Singapore,1996.
[131]黄冠尧,洪佩琳,李津生.P2P-VCG：一种基于博弈论的带宽分配方案[J].计算机研究与发展,2007,44(1)：78-84.
[132]陈宝林.最优化理论与算法.第1版[M].北京：清华大学出版社,1989：527-530
[133]Markowitz. Portfolio selection [J]. Journal of Finanace,1952,(7):77-91.
[134]王春峰.金融市场风险管理[M].天津：天津大学出版社,2001.
[135]安起光,王厚杰,张文清.基于机会约束的均值-VaR投资组合模型研究[J].山东大学学报(理学版),2005,(6).
[136]U. Lublin, D.G. Feitelson. The Workload on Parallel Supercomputers:Modeling the Characteristics of Rigid Jobs[J]. Journal of Parallel and Distributed Computing,2003, 63:1105-1122.
[137]I.E. Sutherland. A futures market in computer time.communications of the ACM, 1968,11(6),449-451.
[138]C. Waldspurger, T. Hogg, B. Huberman, et al. Spawan:Adistributed computation economy. IEEE Transactions on Software Engineering, Vol.18,No.2,IEEE CS Press, USA, February,1992.
[139]N. R. Bogan, Economic Allocation of Computation Time with Computation Markets. MIT Laboratory for Computer Science Technical Report 633, August 1994.
[140]O. Regev, N. Nisan.The Popcorn Market:An Online Market for Computational Resources. Proceedings of the 1st International Conference on Information and Computational Economies, Charleston,SC, October 1998:148-157.
[141]L Boloni, D.C. Marinescu. An Object-oriented Framework for Building Collaborative Network Agents. In telligeng Systems and Interfaces. Netherlandw:Kluwer Publishing House,2000:31-64.
[142]R. Wolski, J.S. Plank, J. Brevik, et al. Analyzing Market-based Resource Allocation Strategies for the Computational Grid [J]. International Journal of High Performance Computing Application,2001,15(3):258-281.
[143]D. Abramson, J. Giddy, L. Kotler. High Performance Parametric Modeling with Nimrod-G:Killer Application for the Global Grid [C]. Cancun, Mexico:14th Internation Parallel and Distributed Processing Symposium (IPDPS'00),2000.
[144]R. Buyya, S.Venugopal. The Gridbus Toolkit for Service Oriented Grid and Utility Computing:An Overview and Status Report. GECON 2004, Seoul, Korea, Apr.2004.
[145]R. Buyya, D.Abramson, S. Venugopal. The Grid Economy. Special Issue on Grid Computing,2005,93(3):698-714.
[146]K. Subramoniam, M. Maheswaran,M.Toulouse.Towards a Micro-Economic Model for Resource Allocation in Grid Computing Systems. In:Proc. Canadian Conf. on Electrical &Computer Engineering,2002.
[147]张金水.经济控制论.北京：清华大学出版社,1989(1)：265-272.
[148]曹鸿强,肖侬,卢锡城等.一种基于市场机制的计算网格资源分配方法[J].计算机研究与发展,2002,39(8)：349-356.
[149]李茂胜.基于市场的网格资源管理研究[D].合肥：中国科学技术大学博士学位论文,2006.
[150]J.Q. Cheng, M.P. Wellman1. The WALRAS Algorithm:A Convergent Distributed Implementation of General Equilibrium Outcomes. Computational Economics,1998, 12(1):1-24.
[151]H.R. Varian. Microeconomic Analysis,3rd ed. New York:W.W. Norton & Company, 1992.
[152]S. Ran. A model for Web sevices discovery with QoS. ACM SIGEcom Exchanges, 2003,4(1):1-10.
[153]Y. Liu, A. Ngu, L. Zeng. QoS Computation and Policing in Dynamic Web Service Selection. In:Proc. of the WWW 2004. New York:ACM Press,2004:66-73. http://portal.acm.org/citation.cfm?id=1010444.
[154]李研,周明辉,李瑞超等.一种考虑QoS数据可信性的服务选择方法[J].软件学报.2008,10(19)：2620-2627.
[155]黄飞雪,李志洁.网格资源经济配置[M].北京：科学出版社,2010.
[156]A. Sulistio, R. Buyya. A Grid Simulation Infrastructure Supporting Advance Reservation[A] Proceedings of the 16th Int'l Conf. on Parallel and Distributed Computing and Systems[C]. Cambridge USA:ACTA Press,2004:1-7.
[157]W. Smith, I. Foster, V. Taylor. Scheduling With Advanced Reservations [A]. Proceedings of the 14th Int'l Parallel and Dist. Proc. Symp[C].New York, NY, USA: ACM,2000.:289-290.
[158]M. Wu, X.H. Sun, Y. Chen. QoS Oriented Resource Reservation in Shared Environments [C]. Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid, Singapore,2006.
[159]L.O. Burchard, B. Linnert, J. Schneider. A Distributed Load-Based Failure Recovery Mechanism for Advance Reservation Environments [C]. Proceeding of IEEE/ACM International Symposium on Cluster Computing and the Grid, Cardiff,2005:1071-1078.
[160]H. Zhao, R. Sakellariou. Advance Reservation Policies for Workflows [A]. Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'06)[C]. Saint-Malo, France:ACM Press,2006:47-67.
[161]Kris Bubendorfer. Fine Grained Resource Reservation in Open Grid Economies [A].Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (e-Science'06)[C]. Washington, DC, USA:IEEE Computer Society,2006:81-87.
[162]J. B. Xing, C. Wu, M. L. Tao, et al. Flexible Advance Reservation for Grid Computing[A].The 2nd International Workshop on Grid and Cooperative Computing(GCC'03)[C], Shaihai:Lecture notes in computer science,2003.241-248.
[163]P. Xiao, Z.G. Hu. Relaxed Resource Advance Reservation Policy in Grid Computing [J]. Journal of China Universities of Posts and Telecommunications,2009,16(3): 108-113.
[164]A.W. Mu'alem, D.G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling [J]. IEEE Transactions on Parallel and Distributed Systems,2001,12(6):529-543.
[165]U. Farooq, S. Majumdar, E.W. Parsons, A Frame to Achieve Guaranteed QoS for Applications and High System Performance in Multi-Institutional Grid Computing, Proceedings of the 2006 International Conference on Parallel Processing (ICPP'06),2006:373-380.
[166]A. Sulistio, K. H. Kim, R. Buyya, Using Revenue Management to Determine Pricing of Reservations, Third IEEE International Conference on e-Science and Grid Computing,2007:396-404.
[167]G. Singh, C. Kesselman, E. Deelman. Adaptive Pricing for Resource Reservations in Shared Environments, in the 8th Grid Computing Conference,2007:74-80.
[168]D.M. Nicol, W.H. Sanders, K.S. Trivedi. Model-Based Evaluation:From Dependability to Security [J]. IEEE Transactions on Dependable and Secure Computing,2004, 1(1):48-65.
[169]Y.S. Dai, M. Xie, K.L. Poh. Reliability of Grid Service Systems [J].Computers and Industrial Engineering,2006,50(1-2):130-147.
[170]A. Avizienis, J.C. Laprie, B. Randell, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing [J]. IEEE Transactions on Dependable and Secure Computing,2004,1(1):11-33.
[171]P. Townend, J. Xu. Dependability in Grids [J]. IEEE Distributed Systems Online, 2005,6(12):1-1.
[172]V. Sander. Networking Issues for Grid Infrastructure [S].Informational Document GFD-Ⅰ.037, Open Grid Forum,2004.
[173]P. Resnick, R. Zeckhauser. Trust Among Strangers in Internet Transactions:Empirical Analysis of eBay's Reputation System. In:Working Paper for the NBER Workshop on Empirical Studies of Electronic Commerce.2001.
[174]F. Cornelli, E. Damiani, S. Vimercati, et al. Choosing Reputable Servents in a P2P Network. In:Lassner D, ed. Proceedings of the 11th Int'l WWW Conf. Hawaii:ACM Press,2002:376-386.
[175]S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina. The Eigen Trust Algorithm for Reputation Management in P2P Networks. Proceedings of the 12th WWW Conf. Budapest:ACM Press,2003:640-651.
[176]M. Xie, Y.S.Dai, K.L. Poh. Computing Systems Reliability [M].New York:Kluwer Academic Publishers,2004.
[177]Y.S. Dai, M. Xie, K.L. Poh. Reliability of Grid Service Systems [J].Computers and Industrial Engineering,2006,50(1-2):130-147.
[178]Grid Reliability:A Study of Failures on the Egee Infrastructure. Kyriacos Neocleous and Marios D. Dikaiakos.
[179]S.C. Guo,H.Z Huang, Z.L. Wang, et al.Grid Service Reliability Modeling and Optimal Task Scheduling Considering Fault Recovery [J].2011,60(1):263-274.
[180]张利永,韩燕波.一种主动式的网格工作流可靠性保障方法[J].中山大学学报(自然科学版),2008,47(6)：93-99.
[181]马满福,姚军.网格计算经济中资源的可靠性控制[J].计算机工程与设计,2008,29(2)：337-339
[182]Taverna User Manua. http://www.mygrid.org.uk/user manual 1.7[Z],2008.
[183]X.H. Sun, M. Wu. Grid Harvest Service:A System for Long-term, Application-level Task Scheduling [A]. Proceedings of Int'l Symposium on Parallel and Distributed Processing. Nice, France:IEEE Computer Society Press,2003.
[184]M. Wu, X.H. Sun, Y. Chen. QoS Oriented Resource Reservation in Shared Environments [A]. Proceedings of International Symposium on Cluster Computing and the Grid, Singapore, IEEE Computer Society Press,2006:601-608.
[185]U. Lublin, D.G. Feitelson. The Workload on Parallel Supercomputers:Modeling the Characteristics of Rigid Jobs [J]. Journal of Parallel and Distributed Computing,2003, 63:1105-1122.
[186]A. Iosup, M. Jan, O. Sonmez, et al. The Characteristics and Performance of Groups of Jobs in Grids[J]. Lecture Notes on Computer Science,2007,4641:382-393.
[187]D. Gross, C.M. Harris. Fundamentals of queuing theory [M]. USA:John Wiley and Sons,1998.
[188]肖鹏,胡志刚.面向实时网格任务的多策略资源协同分配模型[J].吉林大学学报(工学版)2010,40(01)：224-0223.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |