#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1976

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- David B. Skillicorn, Jonathan M. D. Hill, William F. McColl
- Scientific Programming
- 1997

- Jonathan M. D. Hill, William F. McColl, +6 authors Rob H. Bisseling
- Parallel Computing
- 1998

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)

- William F. McColl
- Computer Science Today
- 1995

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)

- W F Mccoll
- 1993

A vast amount of work has been done in recent years on the design, analysis, implementation and veriication of special purpose parallel computing systems. This paper presents a survey of various aspects of this work. A long, but by no means complete, bibliography is given.

- Rob H. Bisseling, William F. McColl
- IFIP Congress
- 1994

Bulk synchronous parallel architectures offer the prospect of achieving both scal-able parallel performance and architecture independent parallel software. They provide a robust model on which to base the future development of general purpose parallel computing systems. In this paper we theoretically and experimentally analyse the efficiency with which a… (More)

- William F. McColl
- Future Generation Comp. Syst.
- 1996

- William F. McColl, Alexander Tiskin
- Algorithmica
- 1999

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Its modification, the BSPRAM model, allows one to combine the advantages of distributed and shared-memory style programming. In this paper we study the BSP memory complexity of matrix multiplication. We propose new memory-efficient BSP… (More)

- W F McColl
- 1995

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)

- W F McColl
- 1995

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)

- William F. McColl, Mike Paterson
- SIAM J. Comput.
- 1977