## Abstract

We consider a simple restriction of the PRAM model (called PPRAM), where the input is arbitrarily partitioned between a fixed set of p processors and the shared memory is restricted to m cells. This model allows for investigating the tradeoffs/bottlenecks with respect to the communication bandwidth (modeled by the shared memory size m) and the number of processors p. It is quite simple and allows the design of optimal algorithms without loosing the effect of communication bottlenecks. We have focused on the PPRAM complexity of problems that have O(n) sequential solutions (where n is the input size), and where m≤p≤n. We show tight time bounds for several problem in this model such as summing, Boolean threshold, routing, list reversal and k-selection. We get typically two sorts of complexity behaviors for these problems: Either O(n/p+p/m) which means that the time scales with the number of processors and with memory size (in appropriate range) but not with both. The other is a O(n/m) which does not scales with p and reflects a communication bottleneck (as long as m<p). We are not aware of any problem whose complexity scales with both p and m (e.g O(n/√m·p)). This might explain why in actual implementations one often fails to get p-scalability for p close to n.

Original language | English |
---|---|

Pages | 74-82 |

Number of pages | 9 |

DOIs | |

State | Published - 1999 |

Externally published | Yes |

Event | Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 - Saint-Malo Duration: 27 Jun 1999 → 30 Jun 1999 |

### Conference

Conference | Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 |
---|---|

City | Saint-Malo |

Period | 27/06/99 → 30/06/99 |

## ASJC Scopus subject areas

- Software
- Safety, Risk, Reliability and Quality