Communicating sequential processes
Communicating sequential processes
Complexity of network synchronization
Journal of the ACM (JACM)
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
A bridging model for parallel computation
Communications of the ACM
Efficient run-time support for irregular block-structured applications
Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Relaxed barrier synchronization for the BSP model of computation on message-passing architectures
Information Processing Letters - Special issue on parallel models
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Performance Prediction of Oblivious BSP Programs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
An experiment is conducted to assess the feasibility of transforming BSPc omputations into systems employing explicit asynchronous two - sided communications. The aim of the work is to show how a verified BSPprogram may be transformed into a guaranteed correct conventional message-passing implementation which may, in certain circumstances, avoid the expense of providing a synchronisation barrier.