The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1991 vol.40)
pp: 295-306
ABSTRACT
<p>Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm/sup 3/) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm/sup 2/) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.</p>
INDEX TERMS
pipelined computations; linear array systems; shared memory systems; time complexities; parallel computations; host-satellite systems; computation module execution times; intermodule communication times; homogeneity constraints; space complexities; parallel mapping algorithms; computational complexity; parallel algorithms.
CITATION
D.M. Nicol, D.R. O'Hallaron, "Improved Algorithms for Mapping Pipelined and Parallel Computations", IEEE Transactions on Computers, vol.40, no. 3, pp. 295-306, March 1991, doi:10.1109/12.76406
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool