The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - October (1990 vol.1)
pp: 399-414
ABSTRACT
<p>It is shown that the transformed programs so generated provide significant speedups over the original program on vector processors and vector multiprocessors. The parallelism that arises when multiple instances of a program are executed on simultaneously available data sets is exploited. This is in contrast to the existing approaches that aim at detecting parallelism within a program. The analytic model is used to prove the optimality of the complete first policy for block selection for a class of program graphs known asnonregressive graphs. Analytic and simulation models of the technique clearly indicate the speedups that could be achieved when several data sets are available simultaneously, as is the case in many fields of interest.</p>
INDEX TERMS
Index Termsparallelism; unification; source-to-source transformation; sequential programs; vector processors; vector multiprocessors; optimality; program graphs; nonregressive graphs; parallel programming; programming theory
CITATION
V.J. Rego, A.P. Mathur, "Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 4, pp. 399-414, October 1990, doi:10.1109/71.80170
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool