一种高效的网格资源监测算法ACTC的改进算法

资源监控是网格计算的关键组成部分。资源监控算法既要保证网格系统中资源信息高保真度又要考虑资源信息在网络传输中的负担最低。ACTC算法就是为实现以上目的而被提出,但是算法中对资源信息更新量的动态门槛值(d_threshold)计算方式不合理,有可能导致算法演变成低级的单纯依靠时间敏感机制(TSM)来发送资源更新通知,并且算法中遗漏了一些极端情况的考虑。提出了新的d_threshold计算公式和限制条件,进行性能改进和完善,并对改进前后两算法进行实验对比。实验表明,改进后算法提高了资源信息准确性,并使监控系统     

网格中国进行时

近年来,网格作为一种新兴的影响未来的技术,成为人们关注的热点。对网格的定义,可以简单认为,网格是一种信息社会的网络基础设施。它将实现互联网上所有资源的互联互通,包括计算资源、存储资源、通信资源、软件资源、信息资源、知识资源等。网格将连通一个个信息和资源孤岛,让人们的工作和生活变得更方便。虽然道理简单易懂,但网格究竟是什么?它离我们的生活究竟有多近?本期《服务器》,我们将关注网格的最新进展,关注网格在我们身边的应用。     

一种基于网格的教育资源管理模型

数据网格由于其在跨组织资源的协调共享等问题解决上的优越性,成为了广域教育资源库的首选平台.本文首先提出了适合我国教育资源管理的基于网格平台的分层模型,并针对教育资源网格的特点提出了一种教育资源管理的综合安全解决方案.实验表明,分层结构和安全体系是可行的,具有较好的有效性和可扩展性.     

基于感知网格的无线传感器网络动态采样策略

在分析无线传感器网络时空相关性模型的基础上,提出一种基于感知网格的无线传感器网络动态采样策略.将监测区域划分为多个感知网格,感知网格内只有簇头节点保持活跃状态,当出现异常数据后再激活感知网格内其他节点来获得更详细的信息.该策略通过减少无线传感器节点之间相同的或相近的采样数据上传来降低冗余信息的传输.仿真结果表明:该策略显著提高了无线传感器网络能量效率.     

混合蚁群算法在网格计算任务调度中的应用

网格环境下的资源分配与任务调度问题已经被证明了是一个NP难题,而传统的任务调度算法很难对大量的异构的、动态的网格任务进行有效的调度。本文提出了一种任务调度模型,并且在该模型中采用混合蚁群算法,该算法以信息素为启发,引导蚂蚁选择最优资源。蚂蚁选择资源之后不仅进行信息素的整体更新,还要求预分配网格资源时进行信息素的局部更新。模拟实验表明该算法是一种快速,有效,负载更均衡的算法。     

基于MDS4的数据网格资源发现系统设计与实现

为了从数据网格大量分布、多样、异构的资源中发现合适可用的数据资源.提出了基于网格中间件Globus Toolkit4.0中MDS组件的解决方法.在MDS中内嵌了7种Information Provider,它们只提供计算资源信息,不能提供如数据库、数据文件等数据网格资源信息.针对这个不足,利用MDS良好的可扩展性,设计了一个数据网格资源发现系统,并用Java语言并开发了支持数据网格资源信息的Information Provider.测试结果表明该方法有效可行.     

基于云模型的网格资源分配策略

网格是下一代的Internet,是目前网络研究的重点。网格资源分配是网格中非常重要的部分,而且网格资源有分布、异构、动态、由多个组织所拥有和具有不同的使用、访问及消费模型等特点,属于定性的范畴。传统的网格资源分配策略无法有效对定性的网格资源进行分配,容易形成网络瓶颈。云模型是定性定量间转换的不确定性模型,通过它能将定性的网格资源转换为定量的表达。因此笔者提出了一种新的网格资源分配策略,把云模型运用于网格资源分配,将定性的网格资源映射为定量的可细微变化的不同云滴,然后再配合目前研究相对比较成熟的算法或模型进行资源分配,实验表明新的策略能更准确地对网格资源进行评价并有效分配。     

基于网格的煤矿安全应用网格体系研究

煤矿安全应用工作中数据信息分布、计算资源闲置、异构以及计算功能单一严重制约着行业应用和信息化的发展。网格（grid）是新一代高性能计算环境和信息服务基础设施,能够实现动态跨地域的资源共享和协同工作。该文基于新兴的网格技术,参照OGSA体系,提出并构建了从信息获取、处理到应用的完整的煤矿安全应用网格（CMSAG）体系结构。同时结合行业应用需求,着重研究了其资源表示、资源管理、存储访问以及数据缓存等关键技术,最后通过具体应用示例的工作流程论证了该网格体系的应用模式。     

网格计算在图书文献信息检索中的应用

本文首先介绍了基于元数据表示的信息网格相关技术,探讨了信息网格技术在图书文献信息资源中的应用.论文从整合分布异构信息资源入手,以现有主流网格中间件Globus Toolkit为基础研究平台,基于目前图书文献信息数据库分布零散,内部实现存在异构性,难以满足跨库统一检索的实际需求,提出了一种基于信息网格层的异构跨库信息服务体系结构和基于元数据的资源整合技术,并从信息网格总体结构和逻辑结构进行了分析与设计,最后并详细实现了MDS信息服务组件.     

一种新概念的组件软件：服务网格

传统意义上的分布式计算与并行计算,分别只是空间与时间上的并发,对资源的共享与利用程度有限。本文阐述一种新概念的组件软件:基于网格计算(grid computing)的Web服务(Web Services),即所谓服务网格,其目标是对一定的网格域上的资源进行整合,促进分布在网络上,特别是lnternet上的计算资源,通信资源,存储资源,数据资源,信息资源的充分共享与高效利用。     

QoS based resource provisioning and scheduling in grids

As Grid computing has emerged as a technology for providing the computational resources to industries and scientific projects, new requirements arise. Nowadays, resource management has become an important research area in the Grid computing environment. To provision the appropriate resource to a corresponding application is a tedious task. So, it is important to check and verify the provisioning of the resource before the application’s execution. In this paper, a resource provisioning framework has been presented that offers a resource provisioning policy, which caters to provisioned resource allocation and resource scheduling. The framework has been formally specified and verified. Formal specification and verification of the framework helps in predicting possible errors before the scheduling process itself, and thus results in efficient resource provisioning and scheduling of Grid resources.     

Formal QoS Policy Based Grid Resource Provisioning Framework

Grid resource provisioning is a complex task that is often compromised due to non-availability of the desired resources. The heterogeneous and dynamic nature of the Grid resources depends on the Quality of Service (QoS) based resource provisioning for allocation of appropriate resources to Grid applications. Until resource provisioning is considered a fundamental capability, predictable QoS cannot be delivered to the Grid consumers. A resource provisioning policy based on QoS parameters is required for efficient Grid resource provisioning. In this paper a resource provisioning framework has been proposed. This framework offers resource provisioning policy that caters to provisioned resource allocation and resource scheduling. The policy rules have been specified in XML schema. The policy has been validated by Z Formal specification language and implementation has been demonstrated through a case study. The experimental results demonstrate that QoS based provisioned approach is effective in minimizing cost and submission burst time of applications in comparison to the existing approaches.     

Assessing Green Strategies in Peer-to-Peer Opportunistic Grids

Opportunistic peer-to-peer (P2P) Grids are distributed computing infrastructures that harvest the idle computing cycles of computing resources geographically distributed. In these Grids, the demand for resources is typically bursty. During bursts of resource demand, many Grid resources are required, but on other occasions they may remain idle for long periods of time. If the resources are kept powered on even when they are neither processing their owners’ workload nor Grid jobs, their exploitation is not efficient in terms of energy consumption. One way to reduce the energy consumed in these idleness periods is to place the computers that form the Grid in a “sleeping” state which consumes less energy. In Grid computing, this strategy introduces a tradeoff between the benefit of energy saving and the associated costs in terms of increasing the job response time, also known as makespan, and reducing the hard disks’ lifetime. To mitigate these costs, it is usually introduced a timeout policy together with the sleeping state, which tries to avoid useless state transitions. In this work, we use simulations to analyze the potential of using sleeping states to save energy in each site of a P2P Grid. Our results show that sleeping states can save energy with low associated impact on jobs’ makespan and hard disks’ lifetime. Furthermore, the best sleeping strategy to be used depends on the characteristics of each individual site, thus, each site should be configured to use the sleeping strategy that best fits its characteristics. Finally, differently from other kinds of Grid infrastructures, P2P Grids can place a machine in sleeping mode as soon as it becomes idle, i.e. it is not necessary to use an aggressive timeout policy. This allows increases on the Grid’s energy saving without impacting significantly the jobs’ makespan and the disks’ lifetime.     

校园信息网格的安全问题的研究与方案

网格是一门新兴的网络技术,是现代高科技发展的产物。目前校园网蓬勃发展,出现了良好的局面,但是由于技术问题,在校园网内形成了一个个的信息"孤岛",给共享及管理网络资源带来了很大的困难,网格技术的出现给解决这一问题提供了新的方案。本文主要给出了网格和信息网格的定义,分析了目前网格面临的安全问题,比较详细地给出了网格安全问题的解决方案。     

一种基于语义的P2P网格资源发现模型

网格环境中资源的有效管理和发现在网格研究中占有十分重要的地位。文章提出了一种基于语义和P2P技术的新的网格资源发现模型——Semantic-basedPeertoPeerGrid(简称SPTOPGrid)。该模型采用P2P技术进行资源检索,每个peer节点都能提供资源描述和某个知识领域的本体库(ontology);采用publish/subscribe模式进行资源分发;利用语义知识库进行资源的匹配,进行智能化的资源搜索,能够适应网格资源的复杂性、异构性和动态性,具有良好的扩展性。     

计算网格中资源调度研发现状及展望

网格在解决分散式资源共享方面具有广阔的应用前景,使得它成为下一代互联网瞩目的焦点.而计算网格为资源的需求和供给提供定量分析,激励资源拥有者加入网格的同时保证资源消费者合理有效地使用资源.介绍计算网格通用模型GRACE的基础上,针对该模型中的热点问题--资源管理和调度展开讨论,分析比较当前的几种调度方案,为进一步提出高效完备的资源调度算法作准备.     

Validating and Scaling the MicroGrid: A Scientific Instrument for Grid Dynamics

Large-scale Grids that aggregate and share resources over wide-area networks present major challenges in understanding dynamic application and resource behavior for performance, stability, and reliability. Accurate study of the dynamic behavior of applications, middleware, resources, and networks depends on coordinated and accurate modeling of all four of these elements simultaneously. We have designed and implemented a tool called the MicroGrid which enables accurate and comprehensive study of the dynamic interaction of applications, middleware, resource, and networks. The MicroGrid creates a virtual Grid environment – accurately modeling networks, resources, the information services (resource and network metadata) transparently. Thus, the MicroGrid enables users, Grid researchers, or Grid operators to study arbitrary collections of resources and networks. The MicroGrid includes the MaSSF online network simulator which provides packet-level accurate, but scalable network modeling. We present experimental results with applications which validate the implementation of the MicroGrid, showing that it not only runs real Grid applications and middleware, but that it accurately models both their and underlying resource and network behavior. We also study a range of techniques for scaling a critical part of the online network simulator to the simulation of large networks. These techniques employ a sophisticated graph partitioner, and a range of edge and node weighting schemes exploiting a range of static network and dynamic application information. The best of these, profile-driven placement, scales well to online simulation of large networks of 6,000 nodes using 24 simulation engine nodes.     

Peer-to-peer systems for discovering resources in a dynamic grid

The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutions are extensions of P2P DHT-based networks. We believe that these systems are not flexible enough when the indexed data are very dynamic, i.e., the values of the resource attributes change very frequently over time. This is a common case for Grid metadata, like CPU loads, queue occupation, etc. Moreover, since common requests for Grid resources may be expressed as multi-attribute range queries, we think that the DHT-based P2P solutions are poorly flexible and efficient in handling them.In this paper we present two P2P systems. Both are based on Routing Indexes, which are used to efficiently route queries and update messages in the presence of highly variable data. The first system uses a tree-shaped overlay network. The second one is an evolution of the first, and is based on a two-level hierarchical network topology, where tree topologies must only be maintained at the lower level of the hierarchy, i.e., within the various node groups making up the network. The main goal of the second organization is to achieve a simpler maintenance of the overall P2P graph topology, by preserving the good properties of the tree-shaped topology.We discuss the results of extensive simulation studies aimed at assessing the performance and scalability of the proposed approaches. We also analyze how the network topologies affect the propagation of query and update messages.     

一种统一的资源预留策略

资源预留可以保证任务在开始执行时获得资源,而这在网格这样资源动态性很强的环境中是很可贵的,因而资源预留是网格任务调度中一种普遍采用的策略。当前资源预留的研究主要集中在计算资源预留的情况,文中提出了一个网格环境中资源预留的统一策略,该策略对其它资源的预留和计算资源的预留一起加以考虑,经过模拟验证,该策略能够很好地和我们先前设计的一种基于资源预留的任务映射算法结合起来,适用于网格的动态、异构性环境。