共查询到20条相似文献,搜索用时 140 毫秒
1.
网格计算环境下资源管理的研究 总被引:2,自引:1,他引:1
网格计算是下一代互联网的应用模式,资源管理是网格技术研究的核心任务之一,包含资源发现、任务调度和负载均衡.由于网格中的资源具有分布性、自治性、异构性和动态性,对网格资源进行高效的管理是一个具有挑战性的问题.通过对各种资源管理模型的对比,提出把移动Agent和计算经济机制引入网格资源管理,可以很好地进行资源的发布、资源发现和资源的调度. 相似文献
2.
3.
4.
为了实现网格计算资源的动态自适应性管理,移动代理技术被引入网格资源管理,提出了基于移动代理的网格资源管理调度模型;在模型基础上,采用遗传算法针对网格计算环境下移动Agent任务调度问题展开了深入的研究。 相似文献
5.
基于移动Agent的网格计算资源管理模型设计 总被引:2,自引:1,他引:1
网格计算是当前高性能计算领域的一个研究热点,由于网格计算的资源具有分布性,异构性,自治性,动态性等特点,因而其资源管理比一般系统的资源管理具有更大的复杂度。文中提出了一种基于Agent的网格计算资源管理模型,并且采用了混合遗传模拟退火算法作为调度策略,满足了网格对调度系统可扩展性和全局最优调度的需求。实验结果证实了该方法的有效性。 相似文献
6.
7.
随着Internet技术的日趋成熟,网格计算(Grid Computing)的设想引起了全球范围的关注.网格计算的关键要素是对非集中控制的资源进行协调,通过标准的、开放的、通用的协议和接口,提供非凡的服务质量(QoS)保证.本文试图探索一种基于多Agent的、分布式节点自治的网格资源管理模型,通过在校园网环境下实现该模型,为使用者提供一个分布的、易于扩展的、高效实用的网络计算环境. 相似文献
8.
为了克服传统网格系统采用Globus集中式模型或P2P网络分布式模型具有的无法兼顾全局控制性和扩展性的问题,提出了一种基于移动Agent和混合蛙跳算法的网格资源管理模型;首先,引入移动Agent将资源管理模型划分为应用管理模块、资源管理模块和资源表示模块,然后通过在经典的混合蛙跳算法加入差分扰动设计了一种改进的混合蛙跳算法,最后,在资源管理模块中的资源分配Agent中运行改进的混合蛙跳算法实现用户任务到资源的调度;采用GridSim工具进行仿真,实验结果表明,文中的资源管理模型具有较强的全局控制能力和扩展性能,资源利用率高达95.65%,较其它方法具有较小的时间跨度和较高的资源利用率,是一种适用于网格环境的有效资源管理模型。 相似文献
9.
网格资源分配是网格计算中的关键问题之一,引起网格研究者越来越多的关注。网格资源分配的过程就是任务与资源映射的过程。在分析已有的网格资源分配方法的基础上,首先提出了一种基于Agent的网格资源管理模型,主要由用户层、客户服务层、信息服务层、区域管理层和资源层组成。在此基础上对基于Agent联盟的网格资源分配方法进行了研究,最后给出了实例分析。 相似文献
10.
11.
12.
动态自适应性网格资源管理模型研究 总被引:2,自引:1,他引:2
由于网格计算中的资源具有分布性、自治性、异构性和动态性,对计算网格资源进行高效的管理是一个具有挑战性的问题。提出了把移动代理技术引入网格计算资源管理,从而为资源管理提供一个自适应性的广域资源环境,使网格计算系统能够自动适应环境的变化,为网格计算资源管理的动态自适应性研究指引了方向。 相似文献
13.
Grid computing is a newly developed technology for complex systems with large-scale resource sharing, wide-area communication,
and multi-institutional collaboration. Grid scheduling is an important infrastructure in the grid computing environment. Most
of the existing grids scheduling methods focus on maximizing processor utilization without taking grid load into consideration.
This may lead to significant inefficiencies in performance such as large job queues and processing delays. In this paper,
we propose a multiagent-based scheduling system for computational grids with a new approach. Agent technology is suitable
for a computational grid because of the dynamic, heterogeneous, and autonomous nature of the grid. The main idea of the proposed
system is a combination of a static scheduling using a fixed scheduling algorithm and a dynamic adjustment through the autonomous
behavior of agents. The superiority of the proposed system, in reducing the load of the grid and minimizing the response time
for executing user applications, is demonstrated by simulation experiments. 相似文献
14.
15.
16.
基于计算经济模型改善网格资源分发和发现的性能 总被引:1,自引:0,他引:1
该文在基于计算经济的计算网格体系结构Nimrod/G的基础上,结合NWS设计并实现了一个网格资源分发和发现原型系统,实验表明:该系统可以有效地改进网格系统中的资源分发和发现的性能,进一步提高了网格资源的管理和调度的性能。 相似文献
17.
18.
Sensor enabled grid may combine real time data about physical environment with vast computational resources derived from the grid architecture. One of the major challenges of designing a sensor enabled grid is how to efficiently schedule sensor resource to user jobs across the collection of sensor resources. The paper presents an agent based scheme for assigning sensor resources to appropriate sensor grid users on the basis of negotiation results among agents. The proposed model consists of two types of agents: the sensor resource agents that represent the economic interests of the underlying sensor resource providers of the sensor grid and the sensor user agents that represent the interests of grid user application using the grid to achieve goals. Interactions between the two agent types are mediated by means of market mechanisms. We model sensor allocation problems by introducing the sensor utility function. The goal is to find a sensor resource allocation that maximizes the total profit. This paper proposes a distributed optimal sensor resource allocation algorithm. The performance evaluation of proposed algorithm is evaluated and compared with other resource allocation algorithms for sensor grid. The paper also gives the application example of proposed approach. 相似文献
19.
20.
《Journal of Computer and System Sciences》2006,72(4):706-726
This paper is to solve efficient QoS based resource scheduling in computational grid. It defines a set of QoS dimensions with utility function for each dimensions, uses a market model for distributed optimization to maximize the global utility. The user specifies its requirement by a utility function. A utility function can be specified for each QoS dimension. In the grid, grid task agent acted as consumer pay for the grid resource and resource providers get profits from task agents. The task agent' utility can then be defined as a weighted sum of single-dimensional QoS utility function. QoS based grid resource scheduling optimization is decomposed to two subproblems: joint optimization of resource user and resource provider in grid market. An iterative multiple QoS scheduling algorithm that is used to perform optimal multiple QoS based resource scheduling. The grid users propose payment for the resource providers, while the resource providers set a price for each resource. The experiments show that optimal QoS based resource scheduling involves less overhead and leads to more efficient resource allocation than no optimal resource allocation. 相似文献