The MARS15 Monte Carlo code capabilities to deal with time-consuming deep penetration shielding problems and other computationally tough tasks in accelerator, detector and shielding applications, have been enhanced by a parallel processing option. It has been developed, implemented and tested on the Fermilab Accelerator Division Linux cluster and network of Sun workstations. The code uses a mes...

MPI/MBCF is a high-performance MPI library targeting a cluster of workstations connected by a commodity network. It is implemented with the Memory-Based Communication Facilities (MBCF), which provides software mechanisms for users to access remote task's memory space with oo-the-shelf network hardware. MPI/MBCF uses Memory-Based FIFO for message buuering and Remote Write for communication witho...

A mechanism for message delivery is at the core of any implementation of Message-Passing Interface (MPI) [1]. In a distributed memory computer, shared or not, it is most feasible to synchronize messages in the local memory of the destination process. Accordingly, the initial step in message delivery is for the source process to transmit a message envelope a small packet containing synchronizati...

In this paper, we discuss the performance achieved by several implementations of the recently deened Message Passing Interface (MPI) standard. In particular, performance results for diierent implementations of the broadcast operation are analyzed and compared on the Delta, Paragon, SP1 and CM5.

The aim of Para++ is to provide a user-level C++ interface to message passing libraries, by encapsulating the notions of processes and inter-processes communications into specificC++ objects and streams. Actually, this abstraction level allows to implement Para++ with any kind of message passing library. Para++’s main idea is to add new C++ io-streams allowing inter-tasks communications. These ...

We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes individual data of possibly different size, and all processes have to collect all data from all processes. The pipelined algorithm is useful for the implementation of the MPI Allgatherv collective operation of MPI (the M...

The exploitation of parallelism in general purpose soft-core processors has been increasingly considered an efficient approach to accelerate embedded applications. Therefore, it’s important to use standard parallel programming paradigms that facilitate the development of parallel applications, abstracting the user from architectural details. The Message Passing Interface (MPI) is a standard lib...

We propose extensions to the Message Passing Interface (MPI) that generalize the MPI communicator concept to allow multiple communication endpoints per process, dynamic creation of endpoints, and the transfer of endpoints between processes. The generalized communicator construct can be used to express a wide range of interesting communication structures, including collective communication opera...

The Message Passing Interface (MPI) framework is widely used in implementing imperative programs that exhibit a high degree of parallelism. The PARTYPES approach proposes a behavioural type discipline for MPI-like programs in which a type describes the communication protocol followed by the entire program. Well-typed programs are guaranteed to be exempt from deadlocks. In this paper we describe...

In this paper we present a parallel implementation for solving the string matching problem. Experiments are realized using the Message Passing Interface (MPI) library on a cluster of personal computers, interconnected by a high-performance Fast Ethernet network. Significant speedup was achieved using different text sizes and number of processors.