## Accounting for memory bank contention and delay in high-bandwidth multiprocessors (1997)

### Cached

### Download Links

Venue: | In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures |

Citations: | 32 - 5 self |

### BibTeX

@INPROCEEDINGS{Blelloch97accountingfor,

author = {Guy E. Blelloch and Phillip B. Gibbons and Yossi Matias and Marco Zagha},

title = {Accounting for memory bank contention and delay in high-bandwidth multiprocessors},

booktitle = {In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures},

year = {1997},

pages = {84--94}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent years. As a result, several shared-memory multiprocessors consist of more memory banks than processors. The object of this paper is to provide a simple model (with only a few parameters) for the design and analysis of irregular parallel algorithms that will give a reasonable characterization of performance on such machines. For this purpose, we extend Valiant’s bulk-synchronous parallel (BSP) model with two parameters: a parameter for memory bank delay, the minimum time for servicing requests at a bank, and a parameter for memory bank expansion, the ratio of the number of banks to the number of processors. We call this model the (d, x)-BSP. We show experimentally that the (d, x)-BSP captures the impact of bank contention and delay on the CRAY C90 and J90 for irregular access patterns, without modeling machine-specific details of these machines. The model has clarified the performance characteristics of several unstructured algorithms on the CRAY C90 and J90, and allowed us to explore tradeoffs and optimizations for these algorithms. In addition to modeling individual algorithms directly, we also consider the use of the (d, x)-BSP as a bridging model for emulating a very high-level abstract model, the Parallel Random Access Machine (PRAM). We provide matching upper and lower bounds for emulating the EREW and QRQW PRAMs on the (d, x)-BSP.