基于PVM的C++对象分布并行机制的初步研究

对象具有内在的并行性.将面向对象程序设计与分布并行处理相结合,可产生既具有面向对象特征,又充分利用资源,还可缩短作业运行时间的对象分布并行系统.提出了一种基于PVM(parallelvirtualmachine)的C++对象的分布并行机制.该机制以协议和pvmlib作了向后兼容扩充的PVM系统为对象分布并行支撑;用预处理器将用户作业的并行类分离,并派遣到(PVM)系统中的目标机进行异地编译、加载执行;通过把并行类映射为PVM任务,请求对象消息映射为请求PVM任务消息来实现并行类对象的分布并行.实验结果表明,此对象分布并行机制(当问题规模达到一定程度时)可提高系统资源利用率和程序运行效率,并能简化PVM应用编程.     

基于PVM的并行算法研究

随着数据库规模的增长，数据挖掘技术变得非常重要，而且从数据库中挖掘隐藏的规则也变得十分必要．提出了一种在数据库中发现关联规则的并行Apriori算法，并在并行虚拟机(PVM)环境下实现了该算法．该算法是通过在处理器间分割数据来实现数据的并行化的．     

基于Windows XP的PVM的实现

对PVM的概念、组成进行了简要的介绍，通过对PVM的分析重点讨论了其在Windows XP下的安装和配置命令，分析了PVM配置故障产生的原因，成功建立了PVM的并行环境，并在此基础上对并行环境下编写程序的两种不同方法进行了详细描述。     

基于机群系统的PVM并行编程技术研究

首先简单介绍了当今最流行的分布式并行编程环境之一－PVM系统;然后论述了基于机群系统的PVM编程的一般方法,详细讨论了计算任务的分解,程序模式的选择,进程同步的设置及消息传递等关键步骤,最后,对PVM程序的调试作了简单的探讨。     

基于PVM的OpenGL的并行实现

本文在以微机为节点的并行虚拟机(PVM)上实现了三维图形工业标准OpenGL,具有实用价值.文中提出了新的图像平面分割算法和图像区域的分块绘制与回传方法,使得各处理机之间的数据交换量较小且分布在整个绘制过程中.该方法特别适合于通信开销大的网络分布式计算环境.利用帧间一致性和线性预测,使得任务的分配与绘制并行完成,避免了等待.本文的研究结果可直接应用于建立基于微机网络的交互式实时三维图形系统.     

PVM网络并行计算实现方案

使用双网卡方案实现了基于PVM平台的网络并行计算环境，并在该环境下测试了并行整体光照算法。对实际的测试结果进行了分析，讨论了利用PVM进行网络并行计算的机制和优化方法。     

基于PVM的安全线程机制的研究

PVM并行虚拟机是一种广为使用的分布并行消息库,使用进程作为并行任务的基本单位。但是PVM不支持安全的线程机制。在研究借鉴先前研究经验的基础上,研究支持PVM线程安全的机制,在PVM库和POSIX线程库之上设计了支持PVM线程应用的库PTL,使基于进程的消息传递模型可以基于线程来实现。阐述了其设计原理,给出了程序设计示例,最后给出总结。     

基于PVM的博弈树的网络并行搜索

通过分析博弈理论和a-b剪枝搜索过程,提出了使用PVM构造并行搜索网络.设计和实现了基于PVM的博弈树并行搜索过程.在博弈树搜索中通过构造的并行搜索网络和使用分而治之的策略把搜索过程分布在多个计算机上同时进行,在叶计算机结点的搜索中,通过a-b剪枝技术,剪枝了大量的搜索结点.全局并行搜索和局部剪枝技术的使用,加快了搜索的速度,解决了使用单计算机搜索速度和时间不可行的问题.该博弈并行搜索模型,适用于一般的博弈树搜索问题.     

用并行遗传算法解决带约束并行多机调度问题

遗传算法是一种全局优化的数值计算方法。它存在自然并行性。本文提出一种解带约束并行多机调度问题的主从式控制网络并行遗传算法,并在PVM环境下实现。计算结果表明,并行遗传算法是有效的,且能适用于大规模并行多机调度问题。     

基于PVM的稠密线性方程组网上并行求解

将求解线性方程组的Gauss-Jordan消去法与Gauss列主元消去法结合起来,提出了利用并行计算支撑软件PVM在局域网上高效并行求解稠密线性方程组的算法.该算法处理机间的通信开销较少,实现了负载平衡和各处理机间的全并行工作.用1～24台桌面PC机按两种网络布局方式连接成的局域网,在PVM3.4 on Windows2000、VC 6.0并行计算平台上编程对该算法进行了数值试验,得到了正确的结果.     

基于语义传递的分层事务调度技术的研究

传统的读写事务模型是面向机器的，即事务的每个操作都是对数据库的存取操作，并且事务只有两层：逻辑层和物理层；逻辑层描述对逻辑数据的操作，如对记录的修改，查询等。物理层是描述对磁盘页面的操作；因此，它不能有效地描述应用程序的语义，本文提出了一个３层事务模型，在传统事务模型的基础上增加了一个语义层，该层能有铲地描述应用环境的各种语义，为事务处理提供语义信息。同时设计了基于这种事务模型的并发控制机制，该机     

Jcluster: an efficient Java parallel environment on a large‐scale heterogeneous cluster

In this paper, we present Jcluster, an efficient Java parallel environment that provides some critical services, in particular automatic load balancing and high‐performance communication, for developing parallel applications in Java on a large‐scale heterogeneous cluster. In the Jcluster environment, we implement a task scheduler based on a transitive random stealing (TRS) algorithm. Performance evaluations show that the scheduler based on TRS can make any idle node obtain a task from another node with much fewer stealing times than random stealing (RS), which is a well‐known dynamic load‐balancing algorithm, on a large‐scale cluster. In the performance aspects of communication, with the method of asynchronously multithreaded transmission, we implement a high‐performance PVM‐like and MPI‐like message‐passing interface in pure Java. The evaluation of the communication performance is conducted among the Jcluster environment, LAM‐MPI and mpiJava on LAM‐MPI based on the Java Grande Forum's pingpong benchmark. Copyright © 2005 John Wiley & Sons, Ltd.     

微机网络环境下提高PVM并行程序性能的策略

网络并行计算是并行计算与分布式计算技术非常重要的发展方向之一,结合具体的数值试验,探讨了Windows操作系统下基于PVM的网络并行数值计算中影响PVM并行程序性能的几个重要因素,包括负载平衡、通信开销、网络性能、任务粒度、处理机个数、精度要求及处理机内存容量问题等,并提出了提高PVM并行程序性能的相应策略,以高效快速地实现问题的求解.     

基于Myrinet的用户空间精简协议

通信子系统是影响工作站机群系统整体性能的主要因素.文章在分析和比较了3种常用的网络性能之后,指出上层协议的处理是影响工作站机群系统性能的主要瓶颈.在由640Mbps的Myrinet连接的8台Sun SPARC工作站组成的机群系统上实现了一个用户层的高性能的精简通信协议——RCP(reduced communication protocol).通过精简协议的冗余功能、减少数据拷贝次数和直接操作硬件缓冲区等方法,达到低延迟、高效率.RCP的回路延迟时间比TCP/IP小得多（200μs vs 1 540μs）,     

Parallel Large Scale High Accuracy Navier-Stokes Computations on Distributed Memory Clusters

We present a highly scalable parallelization of a high-accuracy 3D serial multiblock Navier-Stokes solver. The code solves the full Navier-Stokes equations and is capable of performing large-scale computations for practical configurations in an industrial enviroment. The parallelization strategy is based on the geometrical domain decomposition principle, and on the overlapped communication and computation concept. The important advantage of the strategy is that the suggested type of message-passing ensures a very high scalability of the algorithm from the network point of view, because, on the average, the communication work per processor is not increased if the number of processors is increased. The parallel multiblock-structured Navier-Stokes solver based on the parallel virtual machine (PVM) routines was implemented on 106-processors distributed memory cluster managed by the MOSIX software package. Analysis of the results demonstrated a high level of parallel efficiency (speed up) of the computational algorithm. This allowed the reduction of the execution time for large-scale computations employing 10 million of grid points, from an estimated 46 days on the SGI ORIGIN 2000 computer (in the serial single-user mode) to 5–6 hours on 106-processors cluster. Thus, the parallel multiblock full Navier-Stokes code can be successfully used for large-scale practical aerodynamic simulations of a complete aircraft on millions-points grids on a daily basis, as needed in industry.     

集群系统通信性能的测量

集群系统通信性能作为影响集群性能的主要因素之一,其测量对寻找集群内部通信瓶颈具有指导作用。采用NetPIPE基准测试对PC集群系统和Sun工作站集群的通信性能进行了测量,实验结果与理论分析一致,表明在通信性能方面,MPI环境整体上优于PVM,合并一些非相关短消息为长消息能够优化集群应用。并采用性能模拟的方法,以基准测试为工具,对两个集群系统的带参数LogP通信模型进行了定量化地测量和计算,完整表征了集群通信子系统的通信性能特征。     

JPI:基于纯Java语言的异构并行处理支持平台

针对使用Ｐａｒａｌｌｅｌ Ｖｉｒｕａｌ Ｍａｃｈｉｎｅl（ＰＶＭ）和ＭｅｓｓａｇｅＰａｓｓｉｎｇ Ｉｎｔｅｒｆａｃｅ（ＭＰＩ）软件包的解决方案,该软件包用纯Ｊａｖａ语言实现了类似于ＰＶＭ和ＭＰＩ所提供的任务调度、通信和全局归约操作等方面的功能,基于ＪＰＩ的并行程序的运行和性能测试表明,ＪＰＩ不仅解决了并行程序在异构环境中的无缝移植问题,并且能够为包括网络密集型在内的并行程度提供有效的开发、运行支持。     

Parallel computation on multilayer cluster grids

Cluster architectures are increasingly used to solve high‐performance computing applications. To build more computational power, sets of clusters, interconnected by high‐speed networks, can be used in an elaboration to form a cluster grid. In this type of architecture, it is difficult to exploit all the internal resources of a cluster, because each one can be shielded by a firewall and is usually configured with machines where there is only one visible IP front‐end node that hides all its internal nodes from the external world. The exploitation of resources is even more complicated if we consider the general case where each internal node of a cluster can be a front‐end node of an another cluster. This type of architecture has been defined as a multilayer cluster grid. In this paper, a Parallel Virtual Machine (PVM) extension is presented which, through a middleware solution based on the H2O distributed metacomputing framework, permits the building of a parallel virtual machine in a multilayer cluster grid environment. In addition, the existing code written for PVM can be executed into this environment without modifications. Copyright © 2007 John Wiley & Sons, Ltd.     

Application of Parallel Virtual Machine Framework to the Strong Prime Problem

This paper use the well-discussed PVM (Parallel Virtual Machine) software with several personal computers, and adopt the widespread Microsoft Windows '98 operating system as our operation platform to construct a heterogeneous PCs cluster. By engaging the related researches of PC cluster system and cluster computing theory, we apply our heterogeneous PC cluster computing system to generate more secure parameters for some public key cryptosystems such as RSA. Copes with each parameter's related mathematic theory's restriction, enormous computation power is needed to get better computation performance in generating these parameters. In this paper, we contribute heterogeneous PCs combined with the PVM software to cryptosystem parameters, which is conformed to today's safety specification and requirement. We practically generate these data to prove that computer cluster can effectively accumulate enormous computation power, and then demonstrate the cluster computation application in finding strong primes which are needed in some public key cryptosystems.     

曙光1000A上消息传递与共享存储的比较

分布式共享存储虽然有易于编程的优点,但往往被认为效率不高、完全由软件实现的分布式共享存储系统（又称为虚拟共享存储系统）更是如此,文中以典型的消息传递系统ＰＶＭ与分布式共享存储系统ＪＩＡＪＩＡ粉列,报这两种并行程序设计环境的特点,并用７个应用程序在曙光１０００Ａ上分别比较了这两个系统的性能,实验３结果表明,ＪＩＡＪＩＡ的与ＰＶ玎当,但基于ＪＩＡＪＩＡ的并行程序设计却比ＰＶＮ简单得多。