The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1996 vol.22)
pp: 762-773
ABSTRACT
<p><b>Abstract</b>—The amount of memory required by a parallel program may be spectacularly larger then the memory required by an equivalent sequential program, particularly for programs that use recursion extensively. Since most parallel programs are nondeterministic in behavior, even when computing a deterministic result, parallel memory requirements may vary from run to run, even with the same data. Hence, parallel memory requirements may be both large (relative to memory requirements of an equivalent sequential program) and unpredictable.</p><p>Assume that each parallel program has an underlying sequential execution order that may be used as a basis for predicting parallel memory requirements. We propose a simple restriction that is sufficient to ensure that any program that will run in <it>n</it> units of memory sequentially can run in <it>mn</it> units of memory on <it>m</it> processors, using a scheduling algorithm that is always within a factor of two of being optimal with respect to time.</p><p>Any program can be transformed into one that satisfies the restriction, but some potential parallelism may be lost in the transformation. Alternatively, it is possible to define a parallel programming language in which only programs satisfying the restriction can be written.</p>
CITATION
F. Warren Burton, "Guaranteeing Good Memory Bounds for Parallel Programs", IEEE Transactions on Software Engineering, vol.22, no. 10, pp. 762-773, October 1996, doi:10.1109/32.544353
73 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool