Learn More
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full deenition of BSPlib in C, motivates the design of its basic operations, and gives examples of their use. The library enables programming in two distinct styles: direct remote memory access using(More)
Scalable computing will, over the next few years, become the normal form of computing. In this paper we present a uniied framework , based on the BSP model, which aims to serve as a foundation for this evolutionary development. A number of important techniques, tools and methodologies for the design of sequential algorithms and programs have been developed(More)
General purpose parallel computing systems come in a variety of forms. We have various kinds of distributed memory architectures, shared memory multiprocessors, and clusters of workstations. New technologies may increase this range still further. Can one hope to design portable and scalable parallel software in the face of such architectural diversity? In(More)
An eecient BSP realisation of Strassen's matrix multiplication algorithm is described. 1 Strassen's Algorithm Let A and B be two n n matrices and consider the problem of computing C = A B. We can regard the matrices A; B; C as each composed of four n=2 n=2 submatrices. For example, ! If the submatrices of B and C are described in the same way then we have C(More)
A major challenge for computer science in the 1990s is to determine the extent to which general purpose parallel computing can be achieved. The goal is to deliver both scalable parallel performance and architecture independent parallel software. (Work in the 1980s having shown that either of these alone can be achieved.) Success in this endeavour would(More)