article · 2007
Load Bounding for Implicit Parallelism
Gerald Ostheimer, Antony J. T. Davie
Cited by 0Abstract and details only
Abstract
It is well known that exploiting parallelism beyond the available machine parallelism can lead to vastly increased resource requirements. Programs which can run in linear space under a sequential execution regime may require exponential space in the context of unrestricted parallelism. In this paper we present an efficient adaptive software solution for the problem of avoiding excessive parallelism when evaluating implicitly parallel functional programs. We give an informal proof for the effectiveness of our method and discuss its limitations. The solution and the proof are based on a compilation scheme mapping lazy functional programs onto message-passing parallel architectures. Our strategy is completely distributed and can be expected to scale well to large machine configurations. 1 1 Introduction and Background Fifteen years after John Backus' clarion call to break the von Neumann bottleneck by adopting a functional programming style [Ba78], commercial multiprocessors are now ava...
Cite this paper
Ostheimer, G., & Davie, A. J. T. (2007). Load Bounding for Implicit Parallelism.
Ostheimer, Gerald, and Antony J. T. Davie. “Load Bounding for Implicit Parallelism.” 2007.
Ostheimer, Gerald, and Antony J. T. Davie. 2007. “Load Bounding for Implicit Parallelism.”
Ostheimer, G. and Davie, A.J.T. (2007) ‘Load Bounding for Implicit Parallelism’.
@article{ostheimer2007load,
title = {{Load Bounding for Implicit Parallelism}},
author = {Ostheimer, Gerald and Davie, Antony J. T.},
year = {2007}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.