Performance-based data distribution for data mining applications on grid computing environments

Effective data distribution techniques can significantly reduce the total execution time of a program on grid computing environments, especially for data mining applications. In this paper, we describe a linear programming formulation for the data distribution problem on grids. Furthermore, a heuristic method, named Heuristic Data Distribution Scheme (HDDS), is proposed to solve this problem. We implement two types of data mining applications, Association Rule Mining and Decision Tree Construction, and conduct experiments on grid testbeds. Experimental results show that data mining programs using the proposed HDDS to distribute data could execute more efficiently than traditional schemes could.     

网格计算经济中的资源绑定

针对网格计算经济,提出资源绑定的模型,并结合任务对资源的需求和QoS要求,就绑定资源的描述、价格、资源绑定的优化,绑定流程等进行了深入研究.在此基础上,实现了基于绑定的调度算法.实验结果证明,资源绑定在任务完成时间和成本支出上取得了良好的效果,促进了资源调度,有利于提高整个网格资源管理系统的效率.     

复合模式的网格系统信任授权模型

作为研究焦点的网格系统提供了一种受控的跨边界的资源共享的虚拟框架。对网格环境进行了分析,讨论了网格对信任管理的需求。在分析各种信任模型不足的基础上,基于网格具体的应用环境,并结合以PGP用户为中心的信任模型和SPKI授权证书机制各自的优势,提出了复合模式的网格信任授权模型,并完整设计了整个模型的可实现框架。     

Cost profile prediction for grid computing

The accurate prediction of cost profiles of future job tasks on the nodes of clusters or grids helps users to select the cost performance profile that best suits their budgets. The current software designed to deploy job tasks uses forecasts of the target computers' future load profiles. Once the job task's future load profile is known, converting it to its cost profile needs further analysis as the cost depends on other factors such as its delays and variable background loads. This paper introduces a new charging mechanism for charging future job tasks, called the Cost Profiling Model. The model has been implemented in a Software Framework and evaluated for its prediction accuracy. Copyright © 2009 John Wiley & Sons, Ltd.     

Dynamic call and connection admission control in automatically switched optical network for grid computing applications

In recent years,Grid computing applications are becoming more and more important to the scientific and business communities and are likely to open to the consumer market and widely develop in the near future,which is a great challenge brought by the potentially large number of Grid users(perhaps millions)and high frequency of their job requests.Automatically switched optical network(ASON),which is a promising high capacity intelligent transport network infrastructure,has been already deployed in the world and regarded as a promising solution to foster the expansion of Grid computing from local area networks to wide area networks.However,by theoretical analysis and simulative evaluation of Grid job blocking in the distributed call and connection setup process of ASON,this paper verifies that ASON and the conventional admission control mechanism confront a problem in supporting future large-scale Grid computing.In order to address this issue,a novel dynamic call and connection admission control(DCCAC)scheme is proposed to improve the network performance and guarantee quality of service(QoS)of Grid applications.This scheme is applicable with complete network information,no network information and partial network information.Numerical results show that the DCCAC scheme can improve the efficiency of the network to a great extent.Moreover,all the analysis and algorithms in this paper are based on ITU-T ASON recommendations,which make the DCCAC scheme more applicable in network engineering for future Grid computing.     

网格计算及网格体系结构研究综述

网格计算是继Internet和Web技术之后，信息技术的第3次革命，最终将改变分布式资源的共享和服务方式。对网格计算进行了简单介绍，重点介绍网格系统构建的核心技术，即网格体系结构的研究及最新进展情况。且着重介绍了以协议为中心的5层沙漏结构和以服务为中心的新一代网格体系结构OGSA。     

QoS in grid computing

Grid computing is already a mainstream paradigm for resource-intensive scientific applications, but it also promises to become the future model for enterprise applications. The grid enables resource sharing and dynamic allocation of computational resources, thus increasing access to distributed data, promoting operational flexibility and collaboration, and allowing service providers to scale efficiently to meet variable demands. Large-scale grids are complex systems composed of thousands of components from disjoined domains. Planning the capacity to guarantee quality of service (QoS) in such environments is a challenge because global service-level agreements (SLAs) depend on local SLAs. We provide a motivating example for grid computing in an enterprise environment and then discuss the how resource allocation affects SLAs.     

基于RMI的高性能计算网格二次开发模型

根据高性能计算和网格的特点,提出一种网格二次开发模型(GRM)。结合RMI和SSL/TLS技术,该模型提供了访问中间件的一致性接口,屏蔽了通过网络访问网格的繁杂问题,解决了敏感数据在不安全的广域网中传输的问题。以科学计算网格的中间件为基础,实现了GRM。多个基于GRM的用户接口开发经历和实验结果表明,GRM为开发人员提供了一个简单易用和功能全面的开发模型,而且具有良好的性能和可移植性。     

网格合同计算的有效协商机制研究

随着网格商业化的不断深入,网格计算要求：服务提供者和消费者间在组合服务中需达成端对端的高服务质量协议,高可靠性的组合服务协商机制和保障机制在网格计算中扮演着越来越重要的角色。所提出的网格合同计算模型,在组合服务过程中提供统一的用户接口,使交易双方自动动态协商满足每个单独服务的服务质量约束条件。在网格合同计算模型中,利用代理技术实现了自治网格合同计算协商机制,该协商机制遵循改进的两阶段提交FIPA协议。在服务合同中导入了软服务合同SSC和硬服务合同HSC概念,并指出动态绑定服务之前所生成的软服务合同SSC仅仅起到占位符的作用,只有在绑定时通过“硬化”才获得真实的服务承诺。     

信任驱动的网格调度算法

针对目前网格资源管理中任务与资源匹配问题的不足,基于信任效益函数与匹配概念,提出了信任驱动的网格调度匹配算法。在调度中同时还考虑了任务和资源效益值,对已经提出的两种信任驱动的网格调度算法进行改进。结果证明:该算法较传统基于的信任驱动调度算法而言,信任效益值,资源效益值,负载平衡和失效服务数等方面有较好的综合性能。     

网格计算经济中资源的可靠性控制

针对网格资源的可靠性问题,提出了一个包括注册真实性,信任评价和调度契约构成的分层控制模型.针对该模型,提出了资源注册信息的验证方法和契约的模式.仿真实验表明,该模型在资源注册信息验证的基础上,优先调度了信息真实、运行可靠的资源,通过可靠性资源的选择和控制促进了计算经济的可靠性.     

基于任务可分的网格资源预留机制

资源预留能提供保证QoS的网格服务,但提前预留会增加服务请求拒绝率,且产生的资源碎片降低了资源利用率。在预留分类和预留容量等概念定义的基础上,提出了一种基于可分割任务的网格资源预留机制TDR。TDR中,资源预留在多个方向具有可变的灵活度,并在一定的条件下被分割为多个子预留,从而提高系统容纳能力,并描述了相应的接纳控制算法。仿真实验结果表明,提出的机制能有效地减少预留产生的资源碎片和请求拒绝率,增加资源利用率。     

Active Grid Information Server for grid computing

We describe the Active Grid Information Server for performing expressive resource discovery searches and resource management in a grid environment. We represent server meta-data, such as their CPU power, storage capacity and bandwidth as points in a multi-dimensional space and then express queries as predicates over these points. The design of the system is driven by its application as a part of the information infrastructure for computational grids. Such grids provide an infrastructure for sharing computing resources; an information infrastructure is their inherent part which collects resource data and provides search functionality. Our approach complements current solutions such as MDS by adding Event Condition Action rules and an ability to efficiently handle dynamic attributes. An Event Condition Action rule-based system can support ad hoc, adaptive, flexible, and dynamic schedulers that are modifiable at runtime. We evaluate our Active Grid Information Server by evaluating Event Condition Action rules for termination, confluence, and conflict.     

一种应用于网格计算环境的任务调度模式*

提出了一种新的网格任务调度模式,针对网格计算资源有组织、松耦合、自治等特性,建立基于多层次虚拟组织形式的计算资源模型;根据网格环境中应用任务粗粒度、特定资源依赖等特点,建立了网格任务的描述模型;提出并实现了相应的子任务生成算法、任务初始调度算法及自动调整算法。设计实现了能够支持仿真及实际网格计算环境可扩展网格任务调度器,通过理论分析和仿真实验对算法的正确性、效果和效率进行了评价。     

Nanoinformatics: developing new computing applications for nanomedicine

Nanoinformatics has recently emerged to address the need of computing applications at the nano level. In this regard, the authors have participated in various initiatives to identify its concepts, foundations and challenges. While nanomaterials open up the possibility for developing new devices in many industrial and scientific areas, they also offer breakthrough perspectives for the prevention, diagnosis and treatment of diseases. In this paper, we analyze the different aspects of nanoinformatics and suggest five research topics to help catalyze new research and development in the area, particularly focused on nanomedicine. We also encompass the use of informatics to further the biological and clinical applications of basic research in nanoscience and nanotechnology, and the related concept of an extended "nanotype" to coalesce information related to nanoparticles. We suggest how nanoinformatics could accelerate developments in nanomedicine, similarly to what happened with the Human Genome and other -omics projects, on issues like exchanging modeling and simulation methods and tools, linking toxicity information to clinical and personal databases or developing new approaches for scientific ontologies, among many others.     

Distributed computing model for processing remotely sensed images based on grid computing

With advances in remote-sensing technology, the large volumes of data cannot be analyzed efficiently and rapidly, especially with arrival of high-resolution images. The development of image-processing technology is an urgent and complex problem for computer and geo-science experts. It involves, not only knowledge of remote sensing, but also of computing and networking. Remotely sensed images need to be processed rapidly and effectively in a distributed and parallel processing environment. Grid computing is a new form of distributed computing, providing an advanced computing and sharing model to solve large and computationally intensive problems. According to the basic principle of grid computing, we construct a distributed processing system for processing remotely sensed images. This paper focuses on the implementation of such a distributed computing and processing model based on the theory of grid computing. Firstly, problems in the field of remotely sensed image processing are analyzed. Then, the distributed (and parallel) computing model design, based on grid computing, is applied. Finally, implementation methods with middleware technology are discussed in detail. From a test analysis of our system, TARIES.NET, the whole image-processing system is evaluated, and the results show the feasibility of the model design and the efficiency of the remotely sensed image distributed and parallel processing system.     

具有自主计算特征的新型网格体系结构研究

网格环境的复杂性和动态性迫切需要自主计算范型的支持。提出了一种具有自主计算特征的新型网格体系结构。网格的自我管理功能通过自主网格服务层、多Agent自主协同层和表达用户需求的政策层来完成。为了更好的实现Agent间的自主协同,提出了构造多Agent相似-关联树的算法。模拟环境下实现的网格原型系统的运行表明,符合该体系结构的网格系统具有一定程度的自配置、自优化、自保护和自愈合的能力。