Message passing and shared address space parallelism on an SMP cluster
Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, ...
The Paderborn University BSP (PUB) library
The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the ...
Optimal task scheduling at run time to exploit intra-tile parallelism
In this paper we address the issue of iteration space tiling to minimize the completion time of loops when executed on multicomputers. The previous work on tiling assumes atomic execution of tiles to minimize synchronization costs. In this work, we ...
Towards the automatic optimal mapping of pipeline algorithms
The assignment of computations to processors is a crucial factor determining the effectiveness of a parallel algorithm. The portability of parallel programs has involved lot of effort during the last decade. However, the performance of a parallel code ...
Network interface multicast protocols for wormhole-based networks of workstations
Wormhole-routing high-speed local area networks (e.g., Myrinet), increasingly used to build high-performance Network of Workstations, do not usually provide hardware support to multicast communication, that must instead be implemented in software by ...
