### Abstract

The authors examine the numerical solution of an elliptic partial differential equation in order to study the relationship between problem size and architecture. The equation's domain is discretized into n**2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships among grid size, stencil type, partitioning strategy, processor execution time, and communication network type are quantified. The authors thus determine the optimal number of processors to assign to the solution (and hence the optimal speedup), and identify (1) the smallest grid which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the International Conference on Parallel Processing |

Editors | Sartaj K. Sahni |

Publisher | Pennsylvania State Univ Press |

Pages | 347-354 |

Number of pages | 8 |

ISBN (Print) | 0271006080 |

State | Published - Dec 1 1987 |

Externally published | Yes |

Event | Proc Int Conf Parallel Process 1987 - Universal Park, PA, USA Duration: Aug 17 1987 → Aug 21 1987 |

### Publication series

Name | Proceedings of the International Conference on Parallel Processing |
---|---|

ISSN (Print) | 0190-3918 |

### Other

Other | Proc Int Conf Parallel Process 1987 |
---|---|

City | Universal Park, PA, USA |

Period | 8/17/87 → 8/21/87 |

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'PROBLEM SIZE, PARALLEL ARCHITECTURE, AND OPTIMAL SPEEDUP.'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the International Conference on Parallel Processing*(pp. 347-354). (Proceedings of the International Conference on Parallel Processing). Pennsylvania State Univ Press.