一种基于Message Passing的并行程序设计技术

本文首先分析介绍结构并行计算机系统的两种方法：Ｍｕｌｔｉｐｏｒｃｅｓｓｏｒｓ和Ｍｕｌｔｉｃｏｍｐｕｔｅｒｓ，然后介绍一种Ｍｕｌｔｉｃｏｍｐｕｔｅｒｓ并行计算机系统中基于ｍｅｓｓａｇｅｐａｓｓｉｎｇ的并行程序设计环境以及并行程序设计方法，它具有程序设计简单，直观等特点，易于构造程序模型，并能获得较好的加速比。     

基于Message Passing的并行编程环境

在分布式并行计算机系统中，由于处理机间无共享内存，因此采用了ＭｅｓｓａｇｅＰａｓｓｉｎｇ方式实现处理间的通信。文中讨论了基于ＭｅｓｓａｇｅＰａｓｓｉｎｇ的并行编程环境所应具备的特点，然后介绍几种被人们普遍接受的并行编程环境。     

基于MPI的并行程序设计

在介绍消息传递接口标准（MPI）和分析并行程序设计方法的基础上，提出了在并行程序设计中需要进行算法级分析和程序级测试，以此来对影响具体的并行程序执行效率的因素进行分析，并用实例验证了分析结果。最后对MPI的实现之——MPICH1．2．5版本的不足，提出了改进的方法。     

基于MPI的并行程序设计

在介绍消息传递接口标准(MPI)和分析并行程序设计方法的基础上,提出了在并行程序设计中需要进行算法级分析和程序级测试,以此来对影响具体的并行程序执行效率的因素进行分析,并用实例验证了分析结果。最后对MPI的实现之一———MPICH1.2.5版本的不足,提出了改进的方法。     

一种基于Message Passing的通信技术和并行程序设计方法

分布式并行计算机系统中，由于没有处理机间的共享内存以支持数据通信，因而需要以Ｍｅｓｓａｇｅ－Ｐａｓｓｉｎｇ的方式来实现处理机间的数据共享。本文介绍一种基于Ｍｅｓｓａｇｇｅ－Ｐａｓｓｉｎｇ的通信技术以及以此为基础的并行程序设计方法。     

基于分布式共享存储器的并行程序设计

本文概述了分布式并行系统和分布式共享存储器的一般概念，讨论了使用共享对象和可靠广播的并行程序设计模型，最后给出了我们的改进模型。     

基于主动消息与LogP模型的并行程序设计

主动消息将通信和计算集成为一体，是一种相当有效和高适应性的通信体系结构。ＬｏｇＰ模型是一种面向实际的并行算法设计模型?较好地反映了当前ＭＰＰ的关键性能参数。本文讨论了它的特点，在此基础上着重分析了它在并行程序设计上的互补性。     

从河内塔的并行解到UNITY程序设计

从事并行程序设计实践的人往往把精力耗费在为变量分配内存,为循环体寻求并行上,却忽略对问题本身的分析.其实能否并行的决定因素是应用问题本身.人们往往急于得到能够运行的代码,一开始就把复杂的问题和复杂的并行环境掺和起来了.河内塔(Hanoi Tower)问题看似无法并行,实际上却允许极大的并行.它的并行解及求解过程对并行程序设计应有一定的启发.     

并行程序环境及其系统移植实现

并行程序设计环境作为分布并行系统中，并行应用程序开发设计与调试运行控制的工具，对于并行处理技术的研究发展与推广应用，具有重要的作用、本文将分析讨论并行程序环境Ｅｘｐｒｅｓｓ与ＰＶＭ的系统特点及其实现方法，同时，介绍Ｅｘｐｒｅｓｓ系统在并行图归约智能工作站上的系统移植实现。     

Approximating the buffer allocation problem using epochs

The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages—such applications may deadlock when executed on a system with an insufficient number of message buffers. Thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing portable parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [A. Brodsky, J. Pedersen, A. Wagner, On the complexity of buffer allocation in message passing systems, Journal of Parallel and Distributed Computing 65 (2005) 692–713].     

Log File Formats for Parallel Applications: A Review

The objective of this paper is the review of the log file formats that allow the performance visualization of parallel applications based on the usage of message passing interface (MPI) standard. These file formats have been designed by the LANS (Laboratory for Advanced Numerical Software) group of the Argonne National Laboratory and they are distributed together with the corresponding viewers as part of the MPE (multipurpose environment) library of the MPICH implementation of the MPI. The formats studied in this paper is the ALOG, CLOG, SLOG1 and SLOG2 file formats—the formats are studied in chronological order and the main features of their structures are presented.     

CSP-i: An implementation of communicating sequential processes

Hoare's proposal for a notation for communicating sequential processes has led to the development of a number of concurrent languages based on the concept of message passing. CSP-i is a new language which reflects the design objectives of the original CSP notation more faithfully than most of these other languages. This paper describes the development of the language, as well as an implementation for a single processor, with simulated time-slicing providing pseudo-concurrency.     

MPI-implementation of PFI-code for numerical modeling of the anatomy of breast cancer

Large-scale parallelized distributed computing has been implemented in the message passing interface (MPI) environment to solve numerically, eight reaction-diffusion equations representing the anatomy and treatment of breast cancer. The numerical algorithm is perturbed functional iterations (PFI) which is completely matrix-free. Fully distributed computations with multiple processors have been implemented on a large scale in the serial PFI-code in the MPI environment. The technique of implementation is general and can be applied to any serial code. This has been validated by comparing the computed results from the serial code and those from the MPI-version of the parallel code.     

Computational science in high schools: defining curricula and environments

The paper presents a new approach for the introduction of computational science into high level school curricula. It also discusses a set of real life problems that are appropriate for these curricula because they can be described through simple models. The computer based simulation of these systems require an ad hoc environment, including a programming language, suitable for this target age. The paper proposes a new environment, the ORESPICS environment, including a new programming language. The sequential part of the language integrates the classical imperative constructs with a simple set of graphical primitives, mostly taken from the LOGO language. The concurrent part of the language is based on the message passing paradigm. The solutions of some classical problems through ORESPICS are shown.     

大规模并行计算机系统并行性能模拟技术研究

性能模拟技术是计算机系统性能评价的重要手段.介绍了面向大规模并行计算机系统以及消息传递应用程序的并行性能模拟技术,总结了相关的关键技术和国内外研究现状.对几个代表性的并行模拟器系统进行了详细介绍.结合并行计算机系统和应用的发展趋势,讨论了未来并行模拟器设计、实现面临的问题和可能的解决方案.     

MPI的多维数组传递协议

本文首先简要介绍了基于多机系统的半长处理平台所采用的消息传递机制，针对其在传递多维数组时存在的不足，提出了多维数组传递协议，并将其在ＭＰＩ并行虚拟处理平台上实现。     

分布并行系统的并行程序设计环境

分布式并行计算机系统中，由于没有共享内存以支持处理机间的数据交换，因而需采用ｍｅｓｓａｇｅｐａｓｓｉｎｇ的方式实现并行计算中处理机间的数据通讯，并行程序设计环境作为程序员使用并行计算机系统工具，对于并行处理技术以及并行计算机系统的发展与推广应用都有重要的作用，本文将分布基于ｍｅｓｓａｇｅｐａｓｓｉｎｇ的并行计算机系统中的并行程序设计环境的基本问题，并介绍几种典型的并行程序设计环境。     

A theorem on atomicity in distributed algorithms

Reasoning about a distributed algorithm is simplified if we can ignore the time needed to send and deliver messages and can instead pretend that a process sends a collection of messages as a single atomic action, with the messages delivered instantaneously as part of the action. A theorem is derived that proves the validity of such reasoning for a large class of algorithms. It generalizes and corrects a well-known folk theorem about when an operation in a multiprocess program can be considered atomic.List of notations A The set of program actions - A The algorithm under consideration - A The reduced version of algorithmA - A The action obtained by executing the operationA as an atomic action - C The set of state components - d[i] A variable of the Distance-Finding Algorithm - L An operation ofA, as in C2 - The operation obtained by adding toL the actions that deliver messages sent byL - N _p(S) The set of possible next actions of processp from states - P The correctness property - R An operation ofA, as in C2 - S The set of states - S ₀ The set of initial states - S _c The range of values of state componentc - X An action ofA, as in C2 - Usually denotes an execution ofA - The execution ofA that corresponds to an execution ofA When snow conditions are poor,Dr. L. Lamport works at Digital Equipment Corporation's Systems Research Center. As an undergraduate, he took a course in atomic physics.