基于校园网络的元计算实验系统WADE的设计与实现

元计算系统是可以作为虚拟的整体而使用的地理上分散的异构计算资源，这些资源包括计算机、数据库和昂贵仪器等．元计算系统在硬件和软件方面均有异构性，适合具有不同内在并行性的复杂应用的执行．现存的绝大多数并行系统都是同构的，不具有这一优势，因此，研究异构环境下的元计算系统就很有现实意义．WADE是基于校园网络开发的元计算实验系统，使用MD支持异构数据格式转换，使用面向对象技术实现单一映像系统，使用优先约束的任务调度算法来实现应用程序的调度和运行，并提供与流行的并行编程软件如PVM等的接口。     

基于移动代理的网格计算

网格计算环境具有异构性、分布性、动态性、局域自治性等特点,针对以上特性,利用移动代理技术的网格计算方法,可以提供高效统一的应用接口,实现多编程环境下的协同应用求解,从而有效屏蔽其异构和分布等特性,动态适应其资源的变化。详细说明了基于移动代理的网格计算的体系结构和主要模块的功能,并阐述了移动代理的实现过程。     

基于代理的网格计算中间件

WADE系统是基于代理技术实现的一个可屏蔽异构和分布性的动态自适应的校园计算网格，提出了基于代理技术在校园网络内实现并行计算的方法，详细论述了基于代理的网格计算中间件的体系结构和主要模块功能，阐述了利用代理实现异构编译、协同计算的过程，给出了代理的Java实现方法，利用软件代理实现网格计算中间件，可以解决异构计算平台下多种并行编程环境的协同计算问题，为用户提供统一的服务接口，这将大大增强系统的可用性。     

全球计算系统及其关键技术的研究

全球计算系统利用Internet上空闲计算资源来解决大规模分布式应用。基于Internet的全球计算系统需要重新考虑分布式系统的一些问题：可扩展性、容错、异构、安全、编程模型等,论文分析了一些典型的全球计算系统,讨论并总结它们解决这些问题的关键技术。     

多平台移动数据库系统的自由软件实现

论文讨论了移动计算环境下设计和实现移动数据库系统面临的问题,由此提出了一个基于自由软件、支持多平台和异构、优化的“移动数据库-同步组件-中央数据库”三级结构的设计和实现方案。着重论述了其中的关键技术,如移动数据库的层次封装、同步流程、并发条件下的冲突检测算法、系统组建及优化。依该方案已开发出一个面向应用的测试系统,提供数据部署和同步、冲突处理及系统管理等功能,兼容并扩展了移动数据库应用编程规范。     

面向对象的元计算系统的单一映象空间模型研究

随着计算机网络技术的成熟,基于网络的高性能计算技术正趋向异构节点间的元计算技术方向发展。元计算系统的研究目标是：将地理上分布的、属于不同管理域的、运行不同软件的、异构的计算和存储资源以及昂贵的仪器设备通过高速网络连接起来,形成超级计算能力。支持元计算的、将异构计算节点连接起来、实现系统透明访问的技术,是元系统的研究重点。本文论述了一种基于树型结构的单一映象空间模型－SiSM,它屏蔽构节点的硬件边界,为用户提供统一的编程接口、透明访问的虚拟机器。     

异构应用资源共享系统的研究与设计

随着应用资源的日益增长和应用需求的不断变化，个人计算环境需要集成不同平台的异构应用资源。该文基于虚拟计算技术，提出一种异构应用资源融合和共享机制。通过对应用资源的挖掘、发布及注册，实现跨平台的异构应用资源融合和个人计算环境的动态重构。研究成果在科技部科技基础条件平台建设计划中得到了较好的应用。     

基于网格的消息传递接口的实现:MPICH-G2

MPI(消息传递接口)作为一种著名的底层并行编程模型已被提出来作为网格编程的基础。描述了基于网格的消息传递接口的实现MPICH-G2，它基于MPICH和Gllobus工具包实现，在启动和管理中隐藏了异构性，具有良好的异构通讯性能。用一个例子说明如何在一个由Globus搭建的计算网格环境中通过MPICH-G2来创建和执行MPI计算。     

布告同高性能计算和广域异构资源共享的元计算系统

元计算系统主要用于高性能的计算，实现广域异构网络资源共享，这些资源十分丰富，包括计算机、数据库和昂贵仪器等，随着计算机网络的发展与成熟，元计算正成为网络计算方面的新的研究热点，在国外，元计算的研究已经有相当的基础，提出了概念设计，并开发了一些实验性系统，文章对元计算的研究情况进行了综述，论述了不同元计算系统的设计特点和存在的问题，提出了在国内进行元计算研究应该解决的几个关键问题。     

面向高性能计算和广域异构资源共享的元计算系统

元计算系统主要用于高性能计算,实现广域异构网络资源共享。这些资源十分丰富,包括计算机、数据库和昂贵仪器等。随着计算机网络的发展与成熟,元计算正成为网络计算方面的新的研究热点。在国外,元计算的研究已经有相当的基础,提出了概念设计,并开发了一些实验性系统。文章对元计算的研究情况进行了综述,论述了不同元计算系统的设计特点和存在的问题,提出了在国内进行元计算研究应该解决的几个关键问题。     

Service-oriented middleware for distributed data mining on the grid

Distribution of data and computation allows for solving larger problems and executing applications that are distributed in nature. The grid is a distributed computing infrastructure that enables coordinated resource sharing within dynamic organizations consisting of individuals, institutions, and resources. The grid extends the distributed and parallel computing paradigms allowing for resource negotiation and dynamical allocation, heterogeneity, open protocols, and services. Grid environments can be used both for compute-intensive tasks and data intensive applications by exploiting their resources, services, and data access mechanisms. Data mining algorithms and knowledge discovery processes are both compute and data intensive, therefore the grid can offer a computing and data management infrastructure for supporting decentralized and parallel data analysis. This paper discusses how grid computing can be used to support distributed data mining. Research activities in grid-based data mining and some challenges in this area are presented along with some promising future directions for developing grid-based distributed data mining.     

基于LSF集群系统的分布式并行计算

介绍了LSF集群系统和分布式并行计算的基本概念,基于LSF集群系统提出了一个分布式并行计算的基本结构和分级任务调度策略,另外在此结构上实现了矩阵相乘的分布式并行计算,并对此结构进行了性能评测,最后分析了基于LSF集群系统的分布式并行计算具有的优点和存在的不足.     

A dominant predecessor duplication scheduling algorithm for heterogeneous systems

This paper proposes a new duplication-based task scheduling algorithm for distributed heterogeneous computing (DHC) systems. For such systems, many researchers have focused on solving the NP-complete problem of scheduling directed acyclic task graphs to minimize the makespan. However, the heterogeneity of computational resources and communication mechanisms poses some major obstacles to achieving high parallel efficiency. This paper proposes a heuristic strategy called the Dominant Predecessor Duplication (DPD) scheduling algorithm, which allows for system heterogeneities and communication bandwidth to exploit the potential of parallel processing. This algorithm can improve system utilization and avoid redundant resource consumption, resulting in better schedules. Experimental results show that the system heterogeneities and program structures of applications affect scheduling performance, and that our presented algorithm is better able to avoid these problems than those presented in previous literature. Here, we show that our algorithm can be applied to design efficient distributed systems to overcome performance bottlenecks caused by system heterogeneities.

基于动态虚拟机模型的云计算调度方法

将虚拟机加入云计算环境,可充分利用云计算的资源共享优势及其并行、分布计算功能;提出了一种可根据需要动态添加或删除虚拟机的模型系统,可有效节约云计算的使用费用,提高成本效率;研究了可用于本模型系统的两种资源调度算法——自适应先到先得（Adaptive First Come First Serve,AFCFS）和最大者优先（Largest Job First Served,LJFS）算法,尽量避免不必要的延迟,最大可能地提高系统性能,因为这对于分布式系统资源调度算法十分重要;模拟实验中采用了响应时间、等待时间、到达率等性能指标及性价比这一成本指标,比较了几种算法的性能效率,研究验证了模型系统的成本效率。实验结果表明几种算法可高效地运用于云计算环境,并能提高系统性能效率和成本效率。     

Dynamic workload balancing of parallel applications with user-level scheduling on the Grid

This paper suggests a hybrid resource management approach for efficient parallel distributed computing on the Grid. It operates on both application and system levels, combining user-level job scheduling with dynamic workload balancing algorithm that automatically adapts a parallel application to the heterogeneous resources, based on the actual resource parameters and estimated requirements of the application. The hybrid environment and the algorithm for automated load balancing are described, the influence of resource heterogeneity level is measured, and the speedup achieved with this technique is demonstrated for different types of applications and resources.     

A Grid-based Virtual Reactor: Parallel performance and adaptive load balancing

We address the problem of porting parallel distributed applications from static homogeneous cluster environments to dynamic heterogeneous Grid resources. We introduce a generic technique for adaptive load balancing of parallel applications on heterogeneous resources and evaluate it using a case study application: a Virtual Reactor for simulation of plasma chemical vapour deposition. This application has a modular architecture with a number of loosely coupled components suitable for distribution over the Grid. It requires large parameter space exploration that allows using Grid resources for high-throughput computing. The Virtual Reactor contains a number of parallel solvers originally designed for homogeneous computer clusters that needed adaptation to the heterogeneity of the Grid. In this paper we study the performance of one of the parallel solvers, apply the technique developed for adaptive load balancing, evaluate the efficiency of this approach and outline an automated procedure for optimal utilization of heterogeneous Grid resources for high-performance parallel computing.     

The distributed program reliability analysis on ring-type topologies

Distributed computing system (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed program reliability (DPR) is addressed to obtain this reliability measure. In this paper, we propose a polynomial-time algorithm for computing the DPR of ring topology and show that solving the DPR problem on a ring of trees topology is NP-hard.Scope and purposeThe widespread use of distributed computing system is due to the price–performance revolution in microelectronics, the development of cost-effective and efficient communication subsets, the development of resource sharing software, and the increased user demands for communication, economical sharing of resources, and productivity. This article is concerned with the analysis of distributed program reliability on a ring-distributed computing system. The distributed program reliability is a useful measure for reliability evaluation of distributed computing system. The distributed program reliability analyses also give a good index for designing a high-reliability-performance-distributed computing system.     

一种多集群网格的负载均衡算法

网格环境由于其可扩展性、异构性以及大量的传输延迟,使得网格环境下的负载均衡不同于传统的分布式系统。提出了一种动态的分布式负载均衡算法,该算法综合考虑网格站点的处理能力和站点之间的传输延迟,采用即时分配策略来降低作业的执行成本,目标是使系统平均作业响应时间最小化。仿真结果显示该算法显著减少了作业的平均响应时间。     

基于ProActive的容错调度器设计与实现

在分布式计算系统中保证并行应用计算的正确性及提高计算系统中动态资源的利用率是一个重要的研究问题。在原有的基于ProActive的并行计算平台上,引入呼吸通信机制、故障节点发现机制和子任务重新调度机制,设计和实现了一个容错调度系统。实验表明该调度器在部分节点出现故障的情况下,能保证并行计算的正确性,并具有较好的性能。