@inproceedings{cd0e32192a57441c9d92aae0c0e0e224,
title = "PROBLEM SIZE, PARALLEL ARCHITECTURE, AND OPTIMAL SPEEDUP.",
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.",
author = "Nicol, {David M.} and Willard, {Frank H.}",
year = "1987",
month = dec,
day = "1",
language = "English (US)",
isbn = "0271006080",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",
pages = "347--354",
editor = "Sahni, {Sartaj K.}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",
}