用基于对象的Java中间件实现校园网网格计算

本文通过对校园网网格计算环境、计算的特殊性等的讨论,提出了通过Java中间件以构建“计算池”的方法来实现“校园网网格”,从而为我国高校构建自身的校园网网格提供了一个可供选择的实际方案。     

Exploitation of a parallel clustering algorithm on commodity hardware with P2P-MPI

The goal of clustering is to identify subsets called clusters which usually correspond to objects that are more similar to each other than they are to objects from other clusters. We have proposed the MACLAW method, a cooperative coevolution algorithm for data clustering, which has shown good results (Blansché and Gançarski, Pattern Recognit. Lett. 27(11), 1299–1306, 2006). However the complexity of the algorithm increases rapidly with the number of clusters to find. We propose in this article a parallelization of MACLAW, based on a message-passing paradigm, as well as the analysis of the application performances with experiment results. We show that we reach near optimal speedups when searching for 16 clusters, a typical problem instance for which the sequential execution duration is an obstacle to the MACLAW method. Further, our approach is original because we use the P2P-MP1 grid middleware (Genaud and Rattanapoka, Lecture Notes in Comput. Sci., vol. 3666, pp. 276–284, 2005) which both provides the message passing library and infrastructure services to discover computing resources. We also put forward that the application can be tightly coupled with the middleware to make the parallel execution nearly transparent for the user.     

基于资源管理的网络技术探究

介绍了网格的分类与特征、组成,阐述了网格系统体系结构、网格计算的关键技术、资源管理系统的功能、资源管理系统的模型,详述了资源管理系统的体系结构、资源管理系统的多级调度机制和工作过程。     

Grid programming: some indications where we are headed

Grid computing enables the development of large scientific applications on an unprecedented scale. Grid-aware applications, also called meta-applications or multi-disciplinary applications, make use of coupled computational resources that are not available at a single site. In this light, the Grids let scientists solve larger or new problems by pooling together resources that could not be coupled easily before. It is well known that the programmer’s productivity in designing and implementing efficient distributed/parallel applications on high-performance computers is still usually a very time-consuming task. Grid computing makes the situation worse. Consequently, the development of Grid programming environments that would enable programmers to efficiently exploit this technology is an important and hot research issue.

After an introduction on the main Grid programming issues, this paper will review the most important approaches/projects conducted in this field worldwide.     

P2P-MPI: A Peer-to-Peer Framework for Robust Execution of Message Passing Parallel Programs on Grids

This paper presents P2P-MPI, a middleware aimed at computational Grids. From the programmer point of view, P2P-MPI provides a message-passing programming model which enables the development of MPI applications for Grids. Its originality lies in its adaptation to unstable environments. First, the peer-to-peer design of P2P-MPI allows for a dynamic discovery of collaborating resources. Second, it gives the user the possibility to adjust the robustness of an execution thanks to an internal process replication mechanism. Finally, we measure the performance of the integrated message passing library on several benchmarks and on different hardware platforms.     

Semantic routing of search queries in P2P networks

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Heavy network traffic limits the scalability of P2P networks. Indexing is a method to reduce this traffic. But indexes tend to become large with the growth of the network. Also, limiting the size of these indexes causes loss of indexing information. In this paper we introduce a novel ontology based index (OI) which limits the size of the indexes without sacrificing indexing information. We show that the method can be employed by many P2P networks. The OI sits on top of routing and maintenance modules of a P2P network and enhances it. The OI prunes branches of search trees which have no chance to proceed to a response. Also the OI guarantees that an enhanced routing algorithm and its basic version have the same result set for a given search query. This means that the OI reduces traffic without reducing quality of service. To measure the performance of the OI we apply it on Chord (DHT based) and HyperCup (non-DHT based) P2P networks and show that it reduces the networks’ traffic significantly.     

GDB--一种数据库网格系统

网格计算技术将资源有效整合,从而提供统一且灵活的资源共享,但目前主要应用于科学研究,不适于民用和商业应用。通过研究网格计算的重要内容——数据库共享技术,本文提出了数据库网格系统GDB。资源代理、中间件和XML技术的采用,使GDB能够有效整合数据库资源,解决民用和商业领域应用中所遇到的问题。实跋表明,GDB有着广阔的应用前景。     

A component-based approach to build a portable and flexible middleware for metacomputing

The huge amount of computing resources in the Internet makes it possible to build metacomputers for solving large-scale problems. Despite the great availability of software infrastructures for managing such systems, metacomputer programming is often based on models that do not appear to be suitable to run applications on wide-area, unreliable, highly-variable networks of computers. In this paper, we present a customisable, Java-based middleware which provides programmers with a portable and flexible framework to run applications over a hierarchical, virtual network architecture. The middleware is designed according to a component-based approach that enables the execution behaviour of each computing node to be customised in order to satisfy application needs. The paper shows some examples of programming model customisation and demonstrates that flexibility can be achieved without significantly compromising performance.     

The Grid[Way] Job Template Manager, a tool for parameter sweeping

Parameter sweeping is a widely used algorithmic technique in computational science. It is specially suited for high-throughput computing since the jobs evaluating the parameter space are loosely coupled or independent.A tool that integrates the modeling of a parameter study with the control of jobs in a distributed architecture is presented. The main task is to facilitate the creation and deletion of job templates, which are the elements describing the jobs to be run. Extra functionality relies upon the GridWay Metascheduler, acting as the middleware layer for job submission and control. It supports interesting features like multi-dimensional sweeping space, wildcarding of parameters, functional evaluation of ranges, value-skipping and job template automatic indexation.The use of this tool increases the reliability of the parameter sweep study thanks to the systematic bookkeeping of job templates and respective job statuses. Furthermore, it simplifies the porting of the target application to the grid reducing the required amount of time and effort.

Program summary

Program title: Grid[Way] Job Template Manager (version 1.0)Catalogue identifier: AEIE_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIE_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Apache license 2.0No. of lines in distributed program, including test data, etc.: 3545No. of bytes in distributed program, including test data, etc.: 126 879Distribution format: tar.gzProgramming language: Perl 5.8.5 and aboveComputer: Any (tested on PC x86 and x86_64)Operating system: Unix, GNU/Linux (tested on Ubuntu 9.04, Scientific Linux 4.7, centOS 5.4), Mac OS X (tested on Snow Leopard 10.6)RAM: 10 MBClassification: 6.5External routines: The GridWay Metascheduler [1].Nature of problem: To parameterize and manage an application running on a grid or cluster.Solution method: Generation of job templates as a cross product of the input parameter sets. Also management of the job template files including the job submission to the grid, control and information retrieval.Restrictions: The parameter sweep is limited by disk space during generation of the job templates. The wild-carding of parameters cannot be done in decreasing order. Job submission, control and information is delegated to the GridWay Metascheduler.Running time: From half a second in the simplest operation to a few minutes for thousands of exponential sampling parameters.Reference:

• [1] 

  GridWay Installation Guide, http://www.gridway.org/doku.php?id=documentation:release_5.6:ig.

     

Middleware for the use of storage in communication

The Logistical Computing and Internetworking (LoCI) project is a reflection of the way that the next generation internetworking fundamentally changes our definition of high performance wide area computing. A key to achieving this aim is the development of middleware that can provide reliable, flexible, scalable, and cost-effective delivery of data with quality of service guarantees to support high performance applications of all types. The LoCI effort attacks this problem with a simple but innovative strategy. At the base of the LoCI project is a richer view of the use of storage in communication and information sharing.     

P2P-Grid结构模型研究与设计

网格和P2P网络技术在当今分布式计算研究中有十分重要的意义和地位,这两种技术都是通过汇聚互联网中来自不同机构的数量庞大的资源,来满足用户之间的资源共享需求。但是它们在具体实现与应用中遇到一定困难。文中在分析了其各自的优点和不足的同时,比较了它们的相似性,提出了一种结合二者技术优势的新的分布式模型———P2P-Grid模型。它是由一些被称之为Super-Peer的小型的网格系统通过P2P技术互连构成。在充分比较该模型与银行运作模式的基础上,设计了整体结构模型,包括系统结构模型、功能模型和任务调度模型。     

一个高分子模拟计算网格的资源管理

主要介绍了一个高分子模拟计算网格平台资源管理的研究与实现.该计算网格的资源平台是集群式高性能计算机系统,接口采用了Globus3.2 GRAM,符合OGSA的标准.对于集群式高性能计算机系统的管理采用OpenPBS.由于OpenPBS不支持Globus3.2,因此扩展了OpenPBS的相关组件.同时还为计算任务提供了checkpoint机制,给用户的计算程序提供了容错功能.实践结果表明,本软件很好地实现了计算网格的资源管理.     

嵌入式多核系统软件设计和开发

嵌入式多核系统包含多种同构和异构的计算、存储和通信资源来完成复杂的功能.需要采用相对复杂的软件栈来完成任务调度、资源管理和通信.软件设计和开发中需要解决的关键问题包括任务分解和调度、并行方法、通信延迟、操作系统和中间件的设计等.需要选择合理的解决方案来满足嵌入式环境对实时和资源限制的要求.     

AgentTeamwork: Coordinating grid-computing jobs with mobile agents

AgentTeamwork is a grid-computing middleware system that dispatches a collection of mobile agents to coordinate a user job over remote computing nodes in a decentralized manner. Its utmost focus is to maintain high availability and dynamic balancing of distributed computing resources to a parallel-computing job. For this purpose, a mobile agent is assigned to each process engaged in the same job, monitors its execution at a different machine, takes its periodical execution snapshot, moves it to a lighter-loaded machine, and resumes it from the latest snapshot upon an accidental crash. The system also restores broken inter-process communication involved in the same job using its error-recoverable socket and mpiJava libraries in collaboration among mobile agents. We have implemented the first version of our middleware including a mobile agent execution platform, error-recoverable socket and mpiJava API libraries, a job wrapper program, and several types of mobile agents such as commander, resource, sentinel, and bookkeeper agents, each orchestrating, allocating resources to, monitoring and maintaining snapshots of a user process respectively. This paper presents AgentTeamwork’s execution model, its implementation techniques, and our performance evaluation using the Java Grande benchmark test programs. Munehiro Fukuda received a B.S. from the College of Information Sciences and an M.S. from the Master’s Program in Science and Enginnering at the University of Tsukuba in 1986 and 1988. He received his M.S. and Ph.D. in Information and Computer Science at the University of California at Irvine in 1995 and 1997, respectively. He worked at IBM Tokyo Research Laboratory from 1988 to 1993 and taught at the University of Tsukuba from 1998 to 2001. Since 2001, he has been an assistant professor at Computing & Software Systems, the University of Washington, Bothell. His research interests include mobile agents, multi-threading, cluster computing, grid computing and distributed simulations. Koichi Kashiwagi received a Bachelor of Science degree from the Faculty of Science, Ehime University in 2000 and a Master of Engineering degree from the Department of Compter Science, Ehime University in 2002. In 2004 he became a research assistant in Department of Compter Science, Ehime University. His research interests include distributed computing, job scheduling, and grid computing. Shin-ya Kobayashi received the B.E. degree, M.E. degree, and Dr.E. degree in Communication Engineering from Osaka University in 1985, 1988, and 1991 respectively. From 1991 to 1999, he was on the faculty of Engineering at Kanazawa University, Japan. From 1999 to 2004, He was an Associate Professor in the Department of Computer Science, Ehime University. He is a Professor at Graduate School of Science and Engineering, Ehime University. His research interests include distributed processing, and parallel processing. He is a member of the Information Processing Society of Japan, the Institute of Electrical Engineers of Japan, IEEE, and ACM.     

A grouped P2P network for scalable grid information services

Information services play a crucial role in grid environments in that the state information can be used to facilitate the discovery of resources and the services available to meet user requirements, and also to help tune the performance of a grid system. However, the large size and dynamic nature of the grid brings forth a number of challenges for information services. This paper presents PIndex, a grouped peer-to-peer network that can be used for scalable grid information services. PIndex builds on Globus MDS4, but introduces peer groups to dynamically split the large grid information search space into many small sections to enhance its scalability and resilience. PIndex is subsequently modeled with Colored Petri Nets for performance evaluation. The simulation results show that PIndex is scalable and resilient in dealing with a large number of peer nodes.

动态自适应DDS实时中间件的研究与实现

从动态服务发现和容错两个角度对现有DCPS DDS中间件进行了改进。将目前的发布/订阅模型的信息集中存储结构修改为分布式P2P分布式结构,并利用Chord协议实现主题信息的发布和匹配查询,从而实现了自适应能力。在传统心跳检测模型的基础上,提出了加速推拉模型,以提高失效节点的检测效率。最后通过对实现的中间件进行测试,验证了其在相对动态变化不很频繁的情况下,具有实时、容错、自适应的特点。     

一种基于预测和激励机制的网格任务调度框架

随着网格技术的发展,在解决了资源的异构性、规模可扩展性、可靠性等方面的同时,也以其资源的动态性和自治性给传统的任务调度领域带来了新的挑战.参考了著名的网格资源经济系统理论以及一些成熟的调度预测算法和故障处理机制,并在此基础上考虑了实际环境下的网络延迟和人工干预等因素,提出了改进后的基于预测的任务调度思想和基于激励的故障恢复机制,并依此搭建了一个网格任务调度中间件应用实例.     

网格环境下的数据集成中间件的设计与实现*

首先介绍了科学数据库的项目背景,分析了其资源特点和数据集成的需求,比较了不同的技术路线,然后设计了网格环境下的数据集成中间件,并着重阐述了该中间件中各个模块的详细设计内容,最后总结和评估了该系统。该系统已经被成功地应用于科学数据网格中。     

基于GOS的国家网格集成环境及应用实例开发*

中国国家网格作为国内最主要的网格为用户提供了良好的计算服务.详细讨论了网格中间件系统软件GOS的功能和结构,以及基于GOS的中国国家网格集成环境,给出了生物信息软件MEME在国家网格环境下的集成实现,并提出了今后的工作方向.     

基于QoS的网格错误处理服务选择模型

在检测到错误发生的情况下,错误管理服务如何针对实际的不同网格应用程序,选择恰当的错误处理服务,是保证可靠网格容错能力的一个关键问题.针对网格计算环境下的错误处理需求,提出一种基于服务质量QoS的错误处理服务选择模型.在分析网格错误处理的相关背景及需求基础上,给出几种常用错误处理技术的形式化定义,提出相应的服务质量标准;将基于QoS的错误处理服务选择问题抽象为多属性决策问题,建立相应的决策模型.